Submission #872003


Source Code Expand

#include<bits/stdc++.h>
#define N 100100
using namespace std;
vector<int> g[N];
int deg[N],val[N],tv[N];
int id[N],cnt;
bool del[N];
int main(){
	long long ans=0;
	int n,m,x,y;
	scanf("%d%d",&n,&m);
	for(int i=0;i<m;i++){
		scanf("%d%d",&x,&y);
		g[x].push_back(y);
		g[y].push_back(x);
		deg[x]++;
		deg[y]++;
	}
	queue<int> q;
	for(int i=1;i<=n;i++){
		if(deg[i]==1) q.push(i);
		val[i]=1;
	}
	while(!q.empty()){
		int u=q.front();
		q.pop();
		if(deg[u]!=1){
			continue;
		}
		del[u]=true;
		ans+=abs(val[u]);
		for(int i=0;i<g[u].size();i++){
			int v=g[u][i];
			if(del[v]) continue;
			val[v]-=val[u];
			if(--deg[v]==1) q.push(v);
		}
	}
	for(int i=1;i<=n;i++){
		if(!del[i]){
			while(1){
				del[i]=true;
				id[cnt++]=i;
				int nxt=-1;
				for(int j=0;j<g[i].size();j++){
					if(del[g[i][j]]) continue;
					nxt=g[i][j];
					break;
				}
				if(nxt<0) break;
				i=nxt;
			}
			break;
		}
	}
	if(cnt==1){
		if(val[id[0]]) puts("-1");
		else printf("%lld\n",ans);
	}
	else if(cnt&1){
		long long tmp=0;
		for(int i=0;i<cnt;i++){
			tmp+=val[id[i]];
		}
		if(tmp&1) puts("-1");
		else{
			tmp>>=1;
			for(int i=1;i<cnt;i+=2){
				tmp-=val[id[i]];
			}
			for(int i=0;i<cnt;i++){
				ans+=abs(tmp);
				tmp=val[id[i]]-tmp;
			}
			printf("%lld\n",ans);
		}
	}
	else{
		long long tmp=0;
		for(int i=0;i<cnt;i++){
			if(i&1) tv[i]=-tmp;
			else tv[i]=tmp;
			tmp=val[id[i]]-tmp;
		}
		if(tmp) puts("-1");
		else{
			sort(tv,tv+cnt);
			for(int i=0;i<cnt-1-i;i++){
				ans+=tv[cnt-1-i]-tv[i];
			}
			printf("%lld\n",ans);
		}
	}
	return 0;
}

Submission Info

Submission Time
Task F - Namori
User aaaaajack
Language C++14 (GCC 5.4.1)
Score 2200
Code Size 1644 Byte
Status AC
Exec Time 92 ms
Memory 7424 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:11: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:13: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 Subtask1 All
Score / Max Score 0 / 0 1500 / 1500 700 / 700
Status
AC × 4
AC × 20
AC × 66
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
Subtask1 0_00.txt, 0_01.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
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.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, 2_00.txt, 2_01.txt, 2_02.txt, 2_03.txt, 2_04.txt, 2_05.txt, 2_06.txt, 2_07.txt, 2_08.txt, 2_09.txt, 2_10.txt, 2_11.txt, 2_12.txt, 2_13.txt, 2_14.txt, 2_15.txt, 2_16.txt, 2_17.txt, 2_18.txt, 2_19.txt, 2_20.txt, 2_21.txt, 2_22.txt, 2_23.txt, 2_24.txt, 2_25.txt, 2_26.txt, 2_27.txt, 2_28.txt, 2_29.txt, 2_30.txt, 2_31.txt, 2_32.txt, 2_33.txt, 2_34.txt, 2_35.txt, 2_36.txt, 2_37.txt, 2_38.txt, 2_39.txt, 2_40.txt, 2_41.txt, 2_42.txt, 2_43.txt
Case Name Status Exec Time Memory
0_00.txt AC 8 ms 2560 KB
0_01.txt AC 8 ms 2560 KB
0_02.txt AC 8 ms 2560 KB
0_03.txt AC 8 ms 2560 KB
1_00.txt AC 8 ms 2560 KB
1_01.txt AC 81 ms 6656 KB
1_02.txt AC 73 ms 7040 KB
1_03.txt AC 65 ms 7416 KB
1_04.txt AC 82 ms 6912 KB
1_05.txt AC 83 ms 6784 KB
1_06.txt AC 84 ms 6784 KB
1_07.txt AC 80 ms 6912 KB
1_08.txt AC 80 ms 6784 KB
1_09.txt AC 74 ms 7296 KB
1_10.txt AC 77 ms 7040 KB
1_11.txt AC 80 ms 6912 KB
1_12.txt AC 81 ms 6784 KB
1_13.txt AC 83 ms 6784 KB
1_14.txt AC 88 ms 6784 KB
1_15.txt AC 83 ms 6784 KB
1_16.txt AC 84 ms 6784 KB
1_17.txt AC 83 ms 6784 KB
2_00.txt AC 8 ms 2560 KB
2_01.txt AC 85 ms 7424 KB
2_02.txt AC 74 ms 7424 KB
2_03.txt AC 64 ms 7416 KB
2_04.txt AC 88 ms 7296 KB
2_05.txt AC 86 ms 7168 KB
2_06.txt AC 87 ms 7168 KB
2_07.txt AC 84 ms 7296 KB
2_08.txt AC 83 ms 7168 KB
2_09.txt AC 77 ms 7168 KB
2_10.txt AC 79 ms 7040 KB
2_11.txt AC 82 ms 6912 KB
2_12.txt AC 83 ms 6784 KB
2_13.txt AC 83 ms 7168 KB
2_14.txt AC 87 ms 6868 KB
2_15.txt AC 82 ms 6784 KB
2_16.txt AC 81 ms 6784 KB
2_17.txt AC 84 ms 6784 KB
2_18.txt AC 9 ms 2560 KB
2_19.txt AC 74 ms 7164 KB
2_20.txt AC 64 ms 7416 KB
2_21.txt AC 82 ms 7424 KB
2_22.txt AC 80 ms 7168 KB
2_23.txt AC 85 ms 7168 KB
2_24.txt AC 81 ms 6912 KB
2_25.txt AC 79 ms 7296 KB
2_26.txt AC 81 ms 7040 KB
2_27.txt AC 80 ms 7296 KB
2_28.txt AC 87 ms 7040 KB
2_29.txt AC 87 ms 7040 KB
2_30.txt AC 86 ms 6784 KB
2_31.txt AC 92 ms 6912 KB
2_32.txt AC 85 ms 6784 KB
2_33.txt AC 82 ms 6784 KB
2_34.txt AC 82 ms 6784 KB
2_35.txt AC 83 ms 6784 KB
2_36.txt AC 68 ms 7416 KB
2_37.txt AC 63 ms 7416 KB
2_38.txt AC 62 ms 7416 KB
2_39.txt AC 63 ms 7416 KB
2_40.txt AC 63 ms 7416 KB
2_41.txt AC 65 ms 7416 KB
2_42.txt AC 66 ms 7416 KB
2_43.txt AC 63 ms 7416 KB