Submission #1750334


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define LL long long
int n, m;
const int N = 200000;
vector <int> bi[N], bb[N];
int col[N], cnt[3], all;
LL ans; int nw;
void dfs(int t, int c)
{
    if (col[t] == -1)
    {
        col[t] = c;
        cnt[c] ++;
    }
    else
    {
        if (col[t] != c) all = 1;
        return;
    }
    for (int i = 0; i < bi[t].size(); ++ i)
        dfs(bi[t][i], (c + 1) % 3), nw ++;
    for (int i = 0; i < bb[t].size(); ++ i)
        dfs(bb[t][i], (c + 2) % 3);
}
int main()
{
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= m; ++ i)
    {
        int a, b;
        scanf("%d%d", &a, &b);
        bi[a].push_back(b);
        bb[b].push_back(a);
    }
    for (int i = 1; i <= n; ++ i) col[i] = -1;
    for (int i = 1; i <= n; ++ i) if (col[i] == -1)
    {
        cnt[0] = cnt[1] = cnt[2] = 0;
        all = nw = 0;
        dfs(i, 0);
        if (all) ans += 1ll * (cnt[0] + cnt[1] + cnt[2]) * (cnt[0] + cnt[1] + cnt[2]);
        else if (cnt[0] && cnt[1] && cnt[2])
            ans += 1ll * cnt[0] * cnt[1] + 1ll * cnt[0] * cnt[2] + 1ll * cnt[1] * cnt[2];
        else ans += nw;
    }
    printf("%lld\n", ans);
}

Submission Info

Submission Time
Task F - Blackout
User AwD
Language C++14 (GCC 5.4.1)
Score 1700
Code Size 1209 Byte
Status AC
Exec Time 48 ms
Memory 22528 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:28: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:32:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &a, &b);
                              ^

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 4 ms 9600 KB
0_01.txt AC 4 ms 9600 KB
0_02.txt AC 4 ms 9600 KB
1_00.txt AC 5 ms 9600 KB
1_01.txt AC 5 ms 9984 KB
1_02.txt AC 35 ms 16256 KB
1_03.txt AC 39 ms 22528 KB
1_04.txt AC 40 ms 22528 KB
1_05.txt AC 40 ms 22528 KB
1_06.txt AC 40 ms 22528 KB
1_07.txt AC 40 ms 22528 KB
1_08.txt AC 40 ms 22528 KB
1_09.txt AC 40 ms 22528 KB
1_10.txt AC 40 ms 22528 KB
1_11.txt AC 40 ms 22528 KB
1_12.txt AC 40 ms 22528 KB
1_13.txt AC 37 ms 19328 KB
1_14.txt AC 27 ms 13560 KB
1_15.txt AC 27 ms 13560 KB
1_16.txt AC 27 ms 13560 KB
1_17.txt AC 21 ms 10880 KB
1_18.txt AC 45 ms 15616 KB
1_19.txt AC 45 ms 15616 KB
1_20.txt AC 45 ms 15488 KB
1_21.txt AC 45 ms 15616 KB
1_22.txt AC 45 ms 15616 KB
1_23.txt AC 45 ms 15616 KB
1_24.txt AC 44 ms 15488 KB
1_25.txt AC 45 ms 15616 KB
1_26.txt AC 46 ms 15616 KB
1_27.txt AC 44 ms 15488 KB
1_28.txt AC 44 ms 15488 KB
1_29.txt AC 44 ms 15616 KB
1_30.txt AC 45 ms 15488 KB
1_31.txt AC 44 ms 15488 KB
1_32.txt AC 44 ms 15488 KB
1_33.txt AC 45 ms 15616 KB
1_34.txt AC 44 ms 15232 KB
1_35.txt AC 41 ms 13952 KB
1_36.txt AC 43 ms 14848 KB
1_37.txt AC 44 ms 15488 KB
1_38.txt AC 40 ms 13440 KB
1_39.txt AC 38 ms 13184 KB
1_40.txt AC 45 ms 15616 KB
1_41.txt AC 45 ms 15616 KB
1_42.txt AC 41 ms 14464 KB
1_43.txt AC 42 ms 14080 KB
1_44.txt AC 44 ms 15360 KB
1_45.txt AC 38 ms 12800 KB
1_46.txt AC 48 ms 15488 KB
1_47.txt AC 45 ms 15488 KB
1_48.txt AC 41 ms 13824 KB
1_49.txt AC 43 ms 14848 KB