Submission #1677941


Source Code Expand

#include<cstdio>
#include<algorithm>
#define fo(i,a,b) for(i=a;i<=b;i++)
using namespace std;
typedef long long ll;
const int maxn=100000+10;
int fa[maxn],co[maxn];
bool bz[maxn],pd[maxn];
int i,j,k,l,r,t,n,m,cnt;
ll ans;
int getfa(int x){
	if (!fa[x]) return x;
	int t=getfa(fa[x]);
	co[x]^=co[fa[x]];
	return fa[x]=t;
}
int main(){
	scanf("%d%d",&n,&m);
	fo(i,1,m){
		scanf("%d%d",&j,&k);
		bz[j]=1;bz[k]=1;
		l=getfa(j);r=getfa(k);
		if (l<r){
			swap(l,r);
			swap(j,k);
		}
		if (l==r&&co[j]==co[k]) pd[l]=1;
		if (l==r) continue;
		pd[r]|=pd[l];
		fa[l]=r;
		co[l]=co[j]^co[k]^1;
	}
	fo(i,1,n)
		if (!bz[i]) cnt++;
	ans=(ll)cnt*(n-cnt)*2+(ll)cnt*cnt;
	cnt=0;
	fo(i,1,n)
		if (bz[i]&&!fa[i]) cnt++;
	ans+=(ll)cnt*cnt;
	cnt=0;
	fo(i,1,n)
		if (bz[i]&&fa[i]){
			k=getfa(i);
			if (!pd[k]&&co[i]!=co[k]) cnt++;
		}
	fo(i,1,n)
		if (bz[i]&&!fa[i]&&!pd[i]) ans+=(ll)cnt;
	printf("%lld\n",ans);
}

Submission Info

Submission Time
Task C - Squared Graph
User werkeytom
Language C++14 (GCC 5.4.1)
Score 0
Code Size 944 Byte
Status WA
Exec Time 42 ms
Memory 1152 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:18:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
                     ^
./Main.cpp:20:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&j,&k);
                      ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 800
Status
AC × 2
AC × 17
WA × 15
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 1 ms 128 KB
in10.txt AC 1 ms 128 KB
in11.txt AC 1 ms 128 KB
in12.txt AC 11 ms 1152 KB
in13.txt AC 11 ms 1152 KB
in14.txt AC 21 ms 1152 KB
in15.txt WA 3 ms 1152 KB
in16.txt WA 17 ms 1152 KB
in17.txt WA 13 ms 1152 KB
in18.txt WA 30 ms 1152 KB
in19.txt WA 23 ms 1152 KB
in2.txt WA 1 ms 128 KB
in20.txt WA 23 ms 1152 KB
in21.txt WA 42 ms 1152 KB
in22.txt AC 34 ms 384 KB
in23.txt AC 31 ms 128 KB
in24.txt AC 2 ms 1024 KB
in25.txt WA 42 ms 1152 KB
in26.txt AC 1 ms 128 KB
in27.txt WA 1 ms 128 KB
in28.txt WA 41 ms 1152 KB
in3.txt AC 1 ms 128 KB
in4.txt AC 1 ms 128 KB
in5.txt WA 35 ms 1152 KB
in6.txt WA 3 ms 1152 KB
in7.txt AC 3 ms 1152 KB
in8.txt WA 5 ms 1152 KB
in9.txt AC 14 ms 1152 KB
sample1.txt AC 1 ms 128 KB
sample2.txt AC 1 ms 128 KB