oj.uz

Submission #349251

# Submission time Handle Problem Language Result Execution time Memory
349251 2021-01-17T09:11:07 Z David_M Game (IOI14_game) C++14
0 / 100
 1 ms 364 KB 
#include "game.h"
#include <algorithm>
#include <queue> 
using namespace std;

int a[1505], N;
bool b[1501][1501];
void initialize(int n){ N=n; for (int i=2; i<=n; i++)a[i]=1; }
int hasEdge(int u, int v){
	int e=0;
	if(a[u])swap(v, u);
	if(!a[u]){
		a[v]--;
		if(!a[v]) for (int i=1; i<=N; i++)a[i]+=(!b[v][i]&&(i!=v));
	}else b[v][u]=b[u][v]=1;
	
	return e;
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 58.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -