Submission #1677849


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef pair<int, int> pii;

#define fst first
#define snd second
#define pb push_back
#define REP(i, a, b)  for(int i = (a), i##end = (b); i < i##end; ++i)
#define DREP(i, a, b) for(int i=(a-1), i##end = (b); i >=i##end; --i)

template <typename T> bool chkmax(T& a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> bool chkmin(T& a, T b) { return a > b ? a = b, 1 : 0; }

const int N = 400;
const int M = 100000;
const int oo = 0x3f3f3f3f;

template<typename T> T read() {
    T n(0), f(1);
    char ch = getchar();
    for( ;!isdigit(ch); ch = getchar()) if(ch == '-') f = -1;
    for( ; isdigit(ch); ch = getchar()) n = n * 10 + ch - 48; 
    return n * f;
}

int n, m;
bool ban[N + 5];
int x[M + 5], y[M + 5];
bitset <N + 5> f[N + 5];

int main() {
#ifdef Wearry
    freopen("data.txt", "r", stdin);
    freopen("ans.txt", "w", stdout);
#endif

    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; ++i) f[i][i] = true;
    for(int i = 1; i <= m; ++i) {
        scanf("%d%d", x + i, y + i);
    }

    for(int i = m; i >= 1; --i) {
        for(int j = 1; j <= n; ++j) {
            if(f[j][x[i]] && f[j][y[i]]) { ban[j] = true; continue; }
            if(f[j][x[i]]) f[j][y[i]] = true;
            if(f[j][y[i]]) f[j][x[i]] = true;
        }
    }

    int ans = 0;
    for(int i = 1; i <= n; ++i) if(!ban[i])
        for(int j = i + 1; j <= n; ++j) if(!ban[j] && (f[i] & f[j]).none()) {
            ++ ans;
        }
    printf("%d\n", ans);

    return 0;
}

Submission Info

Submission Time
Task E - Poor Turkeys
User Wearry
Language C++14 (GCC 5.4.1)
Score 1400
Code Size 1606 Byte
Status AC
Exec Time 92 ms
Memory 1024 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:39:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
                          ^
./Main.cpp:42:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", x + i, y + i);
                                    ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1400 / 1400
Status
AC × 4
AC × 75
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt, 1_52.txt, 1_53.txt, 1_54.txt, 1_55.txt, 1_56.txt, 1_57.txt, 1_58.txt, 1_59.txt, 1_60.txt, 1_61.txt, 1_62.txt, 1_63.txt, 1_64.txt, 1_65.txt, 1_66.txt, 1_67.txt, 1_68.txt, 1_69.txt, 1_70.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 1 ms 256 KB
1_00.txt AC 3 ms 256 KB
1_01.txt AC 3 ms 256 KB
1_02.txt AC 3 ms 256 KB
1_03.txt AC 4 ms 256 KB
1_04.txt AC 7 ms 256 KB
1_05.txt AC 6 ms 256 KB
1_06.txt AC 7 ms 256 KB
1_07.txt AC 8 ms 256 KB
1_08.txt AC 14 ms 384 KB
1_09.txt AC 16 ms 384 KB
1_10.txt AC 22 ms 384 KB
1_11.txt AC 17 ms 384 KB
1_12.txt AC 51 ms 640 KB
1_13.txt AC 78 ms 896 KB
1_14.txt AC 69 ms 768 KB
1_15.txt AC 67 ms 768 KB
1_16.txt AC 3 ms 256 KB
1_17.txt AC 2 ms 256 KB
1_18.txt AC 3 ms 256 KB
1_19.txt AC 4 ms 256 KB
1_20.txt AC 7 ms 256 KB
1_21.txt AC 6 ms 256 KB
1_22.txt AC 6 ms 256 KB
1_23.txt AC 7 ms 256 KB
1_24.txt AC 14 ms 384 KB
1_25.txt AC 13 ms 384 KB
1_26.txt AC 17 ms 384 KB
1_27.txt AC 18 ms 384 KB
1_28.txt AC 58 ms 768 KB
1_29.txt AC 68 ms 896 KB
1_30.txt AC 56 ms 768 KB
1_31.txt AC 42 ms 640 KB
1_32.txt AC 3 ms 256 KB
1_33.txt AC 3 ms 256 KB
1_34.txt AC 2 ms 256 KB
1_35.txt AC 4 ms 256 KB
1_36.txt AC 5 ms 256 KB
1_37.txt AC 5 ms 256 KB
1_38.txt AC 6 ms 256 KB
1_39.txt AC 6 ms 256 KB
1_40.txt AC 16 ms 384 KB
1_41.txt AC 17 ms 384 KB
1_42.txt AC 16 ms 384 KB
1_43.txt AC 18 ms 384 KB
1_44.txt AC 92 ms 1024 KB
1_45.txt AC 84 ms 896 KB
1_46.txt AC 81 ms 896 KB
1_47.txt AC 78 ms 896 KB
1_48.txt AC 2 ms 256 KB
1_49.txt AC 2 ms 256 KB
1_50.txt AC 2 ms 256 KB
1_51.txt AC 3 ms 256 KB
1_52.txt AC 3 ms 256 KB
1_53.txt AC 3 ms 256 KB
1_54.txt AC 3 ms 256 KB
1_55.txt AC 5 ms 256 KB
1_56.txt AC 9 ms 384 KB
1_57.txt AC 7 ms 256 KB
1_58.txt AC 8 ms 256 KB
1_59.txt AC 9 ms 384 KB
1_60.txt AC 77 ms 896 KB
1_61.txt AC 72 ms 896 KB
1_62.txt AC 67 ms 768 KB
1_63.txt AC 62 ms 768 KB
1_64.txt AC 2 ms 256 KB
1_65.txt AC 2 ms 256 KB
1_66.txt AC 2 ms 256 KB
1_67.txt AC 3 ms 256 KB
1_68.txt AC 12 ms 384 KB
1_69.txt AC 92 ms 1024 KB
1_70.txt AC 1 ms 256 KB