Submission #2379472


Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#define int LL
using namespace std;
typedef long long LL;
const int N=1e6;
int n,m,vis[N+10],head[N+10],tot;
LL cnt1=0,cnt2=0,cnt3=0;
struct data {
    int next,num;
}edge[N+10];
void Add(int u,int v) {
    edge[++tot].next=head[u];
    edge[tot].num=v;
    head[u]=tot;
}
int dfs(int x,int k) {
    if (vis[x]!=-1&&vis[x]!=k) return 0;
    if (vis[x]!=-1) return 1;
    vis[x]=k;
    for (int i=head[x];i!=-1;i=edge[i].next) {
	int kx=edge[i].num;
	int nowk=dfs(kx,k^1);
	if (nowk==0) return 0;
    }
    return 1;
}
main() {
    memset(head,-1,sizeof(head));
    scanf("%lld%lld",&n,&m);
    for (int i=1;i<=m;i++) {
	int u,v;
	scanf("%lld%lld",&u,&v);
	Add(u,v);
	Add(v,u);
    }
    memset(vis,-1,sizeof(vis));
    for (int i=1;i<=n;i++) {
	if (vis[i]!=-1) continue;
	if (head[i]==-1) {
	    cnt3++;
	    continue;
	}
	int k=dfs(i,1);
	if (k==0) cnt1++;
	else cnt2++;
    }
    LL ans=(LL)n*n-(n-cnt3)*(n-cnt3);
    ans+=cnt1*cnt1+cnt1*cnt2*2+cnt2*cnt2*2;
    printf("%lld\n",ans);
    return 0;
}

Submission Info

Submission Time
Task C - Squared Graph
User codefestival
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1130 Byte
Status WA
Exec Time 49 ms
Memory 25344 KB

Compile Error

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

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 800
Status
AC × 2
AC × 12
WA × 20
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 AC 5 ms 17152 KB
in10.txt AC 6 ms 17152 KB
in11.txt AC 5 ms 17152 KB
in12.txt AC 16 ms 18688 KB
in13.txt AC 16 ms 18688 KB
in14.txt AC 26 ms 21248 KB
in15.txt WA 7 ms 17536 KB
in16.txt WA 21 ms 21248 KB
in17.txt WA 18 ms 18816 KB
in18.txt WA 35 ms 23296 KB
in19.txt WA 28 ms 21248 KB
in2.txt WA 5 ms 17152 KB
in20.txt WA 29 ms 21248 KB
in21.txt WA 49 ms 25344 KB
in22.txt WA 38 ms 25344 KB
in23.txt WA 35 ms 25344 KB
in24.txt AC 6 ms 17152 KB
in25.txt WA 47 ms 25344 KB
in26.txt WA 5 ms 17152 KB
in27.txt WA 5 ms 17152 KB
in28.txt WA 48 ms 25344 KB
in3.txt WA 5 ms 17152 KB
in4.txt WA 5 ms 17280 KB
in5.txt WA 37 ms 23296 KB
in6.txt AC 7 ms 17280 KB
in7.txt WA 7 ms 17408 KB
in8.txt WA 9 ms 17792 KB
in9.txt WA 17 ms 19072 KB
sample1.txt AC 5 ms 17152 KB
sample2.txt AC 5 ms 17152 KB