Submission #1157279


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define LL long long
#define FOE(i, s, t) for (int i = s; i <= t; i++)

#define K 200001

int n;
vector<int> nxt[K];

int m;

int dfs[K], sig, eve, bip, bi, col[K];

void DFS(int u, int co){
        dfs[u] = 1;
        col[u] = co;
        for (int i = 0; i < nxt[u].size(); i++) if (!dfs[nxt[u][i]])
                DFS(nxt[u][i], 1 - co);
        else if (col[nxt[u][i]] == col[u]) bip = 0;
}

int main(){
        scanf("%d%d", &n, &m);
        FOE(i, 1, m){
                int c, d; scanf("%d%d", &c, &d);
                nxt[c].push_back(d);
                nxt[d].push_back(c);
        }

        FOE(i, 1, n) if (!dfs[i]){
                bip = 1;
                DFS(i, 0);
                if (nxt[i].size() == 0) sig++; else if (bip) bi++; else eve++;
        }

        long long ret = 0;

      //  printf("%d %d %d\n", sig, eve, bi);

        // 1: same sig com
        // 2: sig - eve
        //
    //    printf("%lld\n", ret);
        ret = ret + (long long)sig * n * 2 - sig;
   //     printf("%lld\n", ret);

        // 3: sig - sig, same
        ret = ret + eve;
        ret = ret + bi * 2;



        // 4: sig - sig, diff
   //     printf("MID %lld\n", ret);
        ret = ret + (long long) eve * (eve - 1) * 2;
        ret = ret + (long long) bi * (bi - 1) * 4;
        ret = ret + (long long) eve * bi * 2;

     //   printf("%lld\n", ret);

        printf("%lld\n", ret);

}

Submission Info

Submission Time
Task C - Squared Graph
User Theogry
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1512 Byte
Status WA
Exec Time 81 ms
Memory 12672 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:26:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &n, &m);
                              ^
./Main.cpp:28:48: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
                 int c, d; scanf("%d%d", &c, &d);
                                                ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 800
Status
AC × 2
AC × 7
WA × 25
Set Name Test Cases
Sample sample1.txt, sample2.txt
All sample1.txt, sample2.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt
Case Name Status Exec Time Memory
in1.txt WA 3 ms 4992 KB
in10.txt WA 3 ms 5760 KB
in11.txt WA 3 ms 4992 KB
in12.txt WA 20 ms 8832 KB
in13.txt WA 20 ms 8832 KB
in14.txt WA 36 ms 8832 KB
in15.txt WA 6 ms 6016 KB
in16.txt WA 27 ms 7296 KB
in17.txt WA 22 ms 8320 KB
in18.txt WA 53 ms 9856 KB
in19.txt WA 42 ms 9728 KB
in2.txt WA 3 ms 4992 KB
in20.txt WA 39 ms 9728 KB
in21.txt WA 76 ms 12672 KB
in22.txt AC 50 ms 8320 KB
in23.txt AC 38 ms 7168 KB
in24.txt WA 4 ms 5760 KB
in25.txt WA 79 ms 12672 KB
in26.txt WA 3 ms 4992 KB
in27.txt WA 3 ms 4992 KB
in28.txt WA 81 ms 12672 KB
in3.txt WA 3 ms 4992 KB
in4.txt AC 3 ms 4992 KB
in5.txt WA 49 ms 8448 KB
in6.txt WA 5 ms 6016 KB
in7.txt WA 5 ms 5888 KB
in8.txt WA 9 ms 6528 KB
in9.txt WA 23 ms 7680 KB
sample1.txt AC 3 ms 4992 KB
sample2.txt AC 3 ms 4992 KB