Submission #738952

#	Time	Username	Problem	Language	Result	Execution time	Memory
738952		1ne	Game (IOI14_game)	C++14	0 / 100	1 ms	212 KiB

game

#include "game.h"
#include <bits/stdc++.h>
using namespace std;
vector<int>res;
struct DSU{
	vector<int>parent,sz;
	DSU(int n){
		parent.resize(n);
		sz.resize(n,1);
		iota(parent.begin(),parent.end(),0);
	}
	int findsets(int v){
		if (v == parent[v]){
			return v;
		}
		parent[v] = findsets(parent[v]);
		return parent[v];
	}
	bool unionset(int u,int v){
		u = findsets(u);
		v = findsets(v);
		if (u == v){
			return false;
		}
		if (sz[v] > sz[u]){
			swap(u,v);
		}
		parent[v] = u;
		sz[u]+=sz[v];
		return true;
	};
};
DSU st(1501);
void initialize(int n) {
	res.resize(n,n - 1);
}

int hasEdge(int u, int v) {
	 if (st.findsets(u) == st.findsets(v))return 1;
	 if ((res[u] == 1 && res[v] >= 1) || (res[v] == 1 && res[u] >= 1)){
	 	st.unionset(u,v);     
	 	res[u]--;
	 	res[v]--;
	 }
	 return st.findsets(u) == st.findsets(v);
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 27
• Subtask 3: 0 / 58