Submission #869173


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N,M;
set<int> E[101010];
ll sum;
int D[101010],RD,SP[101010];
int U,V;


int dfs(int cur,int pre,int type) {
	int ret=type+SP[cur];
	FORR(r,E[cur]) if(r!=pre) ret += dfs(r,cur,-type);
	sum += abs(ret);
	return ret;
}
void dfs2(int cur,int pre,int d) {
	D[cur]=d;
	FORR(r,E[cur]) if(r!=pre) {
		
		if(D[r]>=0) {
			if(RD==0) U=cur, V=r, RD=d+1-D[r];
		}
		else dfs2(r,cur,d+1);
	}
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M;
	FOR(i,M) {
		cin>>x>>y;
		E[x-1].insert(y-1);
		E[y-1].insert(x-1);
	}
	
	if(M==N-1) {
		x = dfs(0,-1,1);
		if(x!=0) sum=-1;
	}
	else {
		MINUS(D);
		dfs2(0,-1,0);
		E[U].erase(V);
		E[V].erase(U);
		
		if(RD%2==1) {
			x = dfs(U,-1,1);
			if(abs(x)%2==1) return _P("-1\n");
			sum = abs(x)/2;
			SP[U]-=x/2;
			SP[V]-=x/2;
			dfs(U,-1,1);
		}
		else {
			x = dfs(U,-1,1);
			ll tsum=sum;
			if(x) return _P("-1\n");
			
			ll L=-101010,R=101010;
			while(R-L>5) {
				int M1=(2*L+R)/3;
				int M2=(L+R*2)/3;
				sum=abs(M1);
				SP[U]=M1;
				SP[V]=-M1;
				dfs(U,-1,1);
				ll sum1=sum;
				sum=abs(M2);
				SP[U]=M2;
				SP[V]=-M2;
				dfs(U,-1,1);
				ll sum2=sum;
				
				if(sum1<sum2) R=M2;
				if(sum1>sum2) L=M1;
				if(sum1==sum2) L=M1,R=M2;
			}
			for(x=L;x<=R;x++) {
				sum=abs(x);
				SP[U]=x;
				SP[V]=-x;
				dfs(U,-1,1);
				tsum=min(tsum,sum);
			}
			sum=tsum;
		}
		
	}
	cout<<sum<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}

Submission Info

Submission Time
Task F - Namori
User kmjp
Language C++14 (GCC 5.4.1)
Score 2200
Code Size 2131 Byte
Status AC
Exec Time 1202 ms
Memory 20992 KB

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 11 ms 4992 KB
0_01.txt AC 11 ms 4992 KB
0_02.txt AC 14 ms 5376 KB
0_03.txt AC 12 ms 5376 KB
1_00.txt AC 11 ms 4992 KB
1_01.txt AC 136 ms 20352 KB
1_02.txt AC 132 ms 16128 KB
1_03.txt AC 132 ms 14336 KB
1_04.txt AC 125 ms 17152 KB
1_05.txt AC 117 ms 16896 KB
1_06.txt AC 109 ms 16896 KB
1_07.txt AC 134 ms 16128 KB
1_08.txt AC 111 ms 17408 KB
1_09.txt AC 114 ms 14336 KB
1_10.txt AC 131 ms 14336 KB
1_11.txt AC 104 ms 14336 KB
1_12.txt AC 100 ms 14336 KB
1_13.txt AC 129 ms 14848 KB
1_14.txt AC 109 ms 14464 KB
1_15.txt AC 106 ms 14336 KB
1_16.txt AC 124 ms 14336 KB
1_17.txt AC 112 ms 14336 KB
2_00.txt AC 12 ms 5376 KB
2_01.txt AC 1202 ms 20992 KB
2_02.txt AC 574 ms 17920 KB
2_03.txt AC 393 ms 14720 KB
2_04.txt AC 949 ms 17920 KB
2_05.txt AC 986 ms 17920 KB
2_06.txt AC 1072 ms 17920 KB
2_07.txt AC 985 ms 17920 KB
2_08.txt AC 1077 ms 17920 KB
2_09.txt AC 672 ms 14848 KB
2_10.txt AC 385 ms 14848 KB
2_11.txt AC 673 ms 14848 KB
2_12.txt AC 629 ms 14848 KB
2_13.txt AC 122 ms 17536 KB
2_14.txt AC 144 ms 15104 KB
2_15.txt AC 773 ms 14848 KB
2_16.txt AC 143 ms 14848 KB
2_17.txt AC 755 ms 14848 KB
2_18.txt AC 12 ms 5376 KB
2_19.txt AC 150 ms 17920 KB
2_20.txt AC 141 ms 14720 KB
2_21.txt AC 1181 ms 20992 KB
2_22.txt AC 136 ms 17920 KB
2_23.txt AC 139 ms 17920 KB
2_24.txt AC 193 ms 17920 KB
2_25.txt AC 173 ms 17920 KB
2_26.txt AC 137 ms 17920 KB
2_27.txt AC 118 ms 14848 KB
2_28.txt AC 162 ms 14848 KB
2_29.txt AC 144 ms 14848 KB
2_30.txt AC 118 ms 14848 KB
2_31.txt AC 149 ms 16896 KB
2_32.txt AC 128 ms 14976 KB
2_33.txt AC 124 ms 14848 KB
2_34.txt AC 140 ms 14848 KB
2_35.txt AC 140 ms 14848 KB
2_36.txt AC 549 ms 14720 KB
2_37.txt AC 528 ms 14720 KB
2_38.txt AC 570 ms 14720 KB
2_39.txt AC 569 ms 14720 KB
2_40.txt AC 570 ms 14720 KB
2_41.txt AC 581 ms 14720 KB
2_42.txt AC 588 ms 14720 KB
2_43.txt AC 554 ms 14720 KB