Submission #1574633


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define up(i,j,n)		for(int i=j;i<=n;i++)
#define down(i,j,n)	for(int i=j;i>=n;i--)
#define cmax(a,b)		a=max(a,b)
#define cmin(a,b)		a=min(a,b)
#define Auto(i,node)	for(int i=LINK[node];i;i=e[i].next)

const int MAXN=2e5+5;
const int oo=0x3f3f3f3f;

int N,M,deg[MAXN],col[MAXN];
ll ans=0,a=0,b=0,c=0;
bool vis[MAXN],isbi=0;

namespace Graph{
	struct edge{
		int y,next;
	}e[MAXN<<1];
	int LINK[MAXN],len=0;
	inline void ins(int x,int y){
		e[++len].next=LINK[x];LINK[x]=len;
		e[len].y=y;
	}
	inline void Ins(int x,int y){
		ins(x,y);
		ins(y,x);
		deg[x]++;deg[y]++;
	}
	void DFS(int node){
		vis[node]=1;
		Auto(i,node){
			if(!vis[e[i].y]){
				col[e[i].y]=col[node]*-1;
				DFS(e[i].y);
			}else if(col[e[i].y]!=col[node]*-1)
				isbi=0;
		}
	}
}using namespace Graph;

int main(){
//	freopen("input.in","r",stdin);
	scanf("%d%d",&N,&M);
	up(i,1,M){
		int x,y;
		scanf("%d%d",&x,&y);
		Ins(x,y);
	}
	up(i,1,N)if(!vis[i]){
		if(!deg[i])a++;
		else{
			isbi=1;
			col[i]=1;
			DFS(i);
			if(isbi)c++;
			else b++;
		}
	}
	ans=a*(N-a)+(N-a)*a+a*a+b*b+b*c+c*b+c*c*2;;
	cout<<ans<<endl;
	return 0;
}

Submission Info

Submission Time
Task C - Squared Graph
User vjudge1
Language C++14 (GCC 5.4.1)
Score 800
Code Size 1167 Byte
Status AC
Exec Time 48 ms
Memory 6656 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:47: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:50:22: 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 800 / 800
Status
AC × 2
AC × 32
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 2 ms 2304 KB
in10.txt AC 1 ms 256 KB
in11.txt AC 2 ms 2304 KB
in12.txt AC 12 ms 4224 KB
in13.txt AC 12 ms 4224 KB
in14.txt AC 23 ms 4736 KB
in15.txt AC 4 ms 3584 KB
in16.txt AC 18 ms 4608 KB
in17.txt AC 14 ms 4608 KB
in18.txt AC 33 ms 5376 KB
in19.txt AC 26 ms 5504 KB
in2.txt AC 2 ms 2304 KB
in20.txt AC 26 ms 5632 KB
in21.txt AC 47 ms 6656 KB
in22.txt AC 39 ms 3968 KB
in23.txt AC 37 ms 3584 KB
in24.txt AC 2 ms 3456 KB
in25.txt AC 47 ms 6656 KB
in26.txt AC 2 ms 2304 KB
in27.txt AC 2 ms 2304 KB
in28.txt AC 48 ms 6656 KB
in3.txt AC 2 ms 2304 KB
in4.txt AC 2 ms 2304 KB
in5.txt AC 37 ms 4736 KB
in6.txt AC 3 ms 3584 KB
in7.txt AC 4 ms 3584 KB
in8.txt AC 6 ms 3712 KB
in9.txt AC 16 ms 4864 KB
sample1.txt AC 2 ms 2304 KB
sample2.txt AC 2 ms 2304 KB