Submission #302652

#	Time	Username	Problem	Language	Result	Execution time	Memory
302652		dCoding	Game (IOI14_game)	C++17	0 / 100	1 ms	384 KiB

game

#include <bits/stdc++.h>
#include "game.h"
using namespace std;
#define F first
#define S second

const int MAXN = 1505;
int coredge[MAXN], deg[MAXN];
set<pair<int, int>> s;
int n;


void initialize(int _n) {
	n = _n;
	for(int i=0;i<n;i++) s.insert({deg[i], i});
}

int hasEdge(int u, int v) {
	++coredge[u]; ++coredge[v];
	int topnode = s.begin()->S;
	if(u != topnode && v != topnode) {
		s.erase({deg[u],u});
		s.erase({deg[v],v});
		++deg[u]; ++deg[v];
		s.insert({deg[u],u});
		s.insert({deg[v],v});
		return 1;
	} else {
		if((u == topnode && coredge[u] == n-1) || (v == topnode && coredge[v] == n-1)) {
			s.erase({deg[u],u});
			s.erase({deg[v],v});
			++deg[u]; ++deg[v];
			s.insert({deg[u],u});
			s.insert({deg[v],v});
			return 1;
		} else {
			return 0;
		}
	}
}

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