Submission #1357525

---

Source Code Expand

#include<stdio.h>
#include<assert.h>
#include<vector>
#include<string.h>
#include<algorithm>
#include<memory.h>
#include<cmath>
#include<string>
#include<iostream>
#include<set>
#include<unordered_set>
#include<map>
#include<queue>
#include<functional>
#include<list>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double, double> pdd;
typedef tuple<int,int,int> t3;

const int MX = 400005;
const int MM = 1000000007;

int N, M, a, b;

vector<pii> G[MX];
int vst[MX], t, low[MX], cnt[MX];
int ans[MX];

vector<int> X;

void dfs(int x, int p = 0){
	vst[x] = ++t; low[x] = t;
	for(pii e : G[x]){
		int c = e.first, d = e.second;
		if( c == p );
		else if( vst[c] ){
			cnt[x]++;
			low[c] = min(low[c], vst[c]);
		}
		else{
			dfs(c, x);
			cnt[x] += cnt[c] + 2;
			low[x] = min(low[x], low[c]);
			if( vst[x] < low[c] && cnt[c] % 2 == 0 ) X.push_back(d);
		}
	}
}

int main()
{
	scanf("%d", &N);
	for(int i = 1; i <= 2*N+1; i++){
		ans[i] = 0;
		scanf("%d%d", &a, &b);
		G[a*2].emplace_back(b*2|1, i);
		G[b*2|1].emplace_back(a*2, i);
	}
	int p = 0;
	for(int i = 1; i <= 4*N+3; i++){
		X.clear();
		if( vst[i] == 0 ){
			dfs(i); cnt[i] /= 2;
			if( cnt[i]%2 == 1){
				p++;
				for(int c : X) ans[c] = 1;
			}
		}
	}
	if( p >= 2 ) for(int i = 1; i <= 2*N+1; i++) ans[i] = 0;
	else if( p == 0 ) for(int i = 1; i <= 2*N+1; i++) ans[i] = 1;
	for(int i = 1; i <= 2*N+1; i++) printf("%s\n", ans[i]? "OK":"NG");
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:56:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
                 ^
./Main.cpp:59:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a, &b);
                        ^

Judge Result