Submission #1365604


Source Code Expand

#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
const int MAXN = 100005;
const int ESIZE = MAXN << 1;
int n, m;
int et = 1, fir[MAXN], to[ESIZE], ne[ESIZE], len[ESIZE];
int col[MAXN];
long long A[5], ans;

void link(int u, int v) {
    to[++et] = v, ne[et] = fir[u], fir[u] = et;
    to[++et] = u, ne[et] = fir[v], fir[v] = et;
    len[et - 1] = 1, len[et] = -1;
}

bool dfs(int o, int fa, int c) {
    A[col[o] = c]++, A[3]++; bool flag = 1;
    for (int i = fir[o]; i; i = ne[i]) {
        A[4]++;
        if (i != fa) {
            if (col[to[i]] == -1)
                flag &= dfs(to[i], i ^ 1, (c + len[i] + 3) % 3);
            else if (col[to[i]] != (c + len[i] + 3) % 3)
                flag = 0;
        }
    }
    return flag;
}

int main() {
    scanf("%d %d", &n, &m);
	for (int i = 1, x, y; i <= m; i++) {
		scanf("%d %d", &x, &y);
        link(x, y);
    }
    for (int i = 1; i <= n; i++)
        col[i] = -1;
    for (int i = 1, res; i <= n; i++)
        if (col[i] == -1) {
            A[0] = A[1] = A[2] = A[3] = A[4] = 0;
            res = dfs(i, 0, 0);
            if (res)
                ans += A[0] && A[1] && A[2] ? A[0] * A[1] + A[1] * A[2] + A[2] * A[0] : A[4] >> 1;
            else
                ans += A[3] * A[3];
        }
    printf("%lld", ans);
    return 0;
}

Submission Info

Submission Time
Task F - Blackout
User MasterJH5574
Language C++14 (GCC 5.4.1)
Score 1700
Code Size 1378 Byte
Status AC
Exec Time 26 ms
Memory 7936 KB

Compile Error

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

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1700 / 1700
Status
AC × 3
AC × 53
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
All 0_00.txt, 0_01.txt, 0_02.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
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 128 KB
0_01.txt AC 1 ms 128 KB
0_02.txt AC 1 ms 128 KB
1_00.txt AC 1 ms 128 KB
1_01.txt AC 1 ms 512 KB
1_02.txt AC 19 ms 3328 KB
1_03.txt AC 21 ms 7936 KB
1_04.txt AC 21 ms 7936 KB
1_05.txt AC 21 ms 7936 KB
1_06.txt AC 21 ms 7936 KB
1_07.txt AC 21 ms 7936 KB
1_08.txt AC 21 ms 7936 KB
1_09.txt AC 21 ms 7936 KB
1_10.txt AC 21 ms 7936 KB
1_11.txt AC 21 ms 7936 KB
1_12.txt AC 21 ms 7936 KB
1_13.txt AC 21 ms 7936 KB
1_14.txt AC 17 ms 3328 KB
1_15.txt AC 17 ms 3328 KB
1_16.txt AC 17 ms 3328 KB
1_17.txt AC 17 ms 2560 KB
1_18.txt AC 26 ms 4480 KB
1_19.txt AC 25 ms 4480 KB
1_20.txt AC 25 ms 4480 KB
1_21.txt AC 26 ms 4480 KB
1_22.txt AC 26 ms 4480 KB
1_23.txt AC 25 ms 4480 KB
1_24.txt AC 25 ms 4480 KB
1_25.txt AC 26 ms 4480 KB
1_26.txt AC 25 ms 4480 KB
1_27.txt AC 25 ms 4352 KB
1_28.txt AC 26 ms 4480 KB
1_29.txt AC 25 ms 4480 KB
1_30.txt AC 25 ms 4352 KB
1_31.txt AC 25 ms 4480 KB
1_32.txt AC 25 ms 4480 KB
1_33.txt AC 26 ms 4480 KB
1_34.txt AC 25 ms 4480 KB
1_35.txt AC 24 ms 4096 KB
1_36.txt AC 24 ms 4352 KB
1_37.txt AC 25 ms 4608 KB
1_38.txt AC 23 ms 3840 KB
1_39.txt AC 23 ms 3712 KB
1_40.txt AC 26 ms 4480 KB
1_41.txt AC 26 ms 4608 KB
1_42.txt AC 23 ms 4096 KB
1_43.txt AC 24 ms 4224 KB
1_44.txt AC 25 ms 4608 KB
1_45.txt AC 23 ms 3456 KB
1_46.txt AC 25 ms 4608 KB
1_47.txt AC 26 ms 4480 KB
1_48.txt AC 24 ms 3968 KB
1_49.txt AC 25 ms 4352 KB