oj.uz

Submission #926899

# Submission time Handle Problem Language Result Execution time Memory
926899 2024-02-14T04:02:09 Z Nurislam Game (IOI14_game) C++14
0 / 100
 0 ms 348 KB 
#include<bits/stdc++.h>
using namespace std;
const int N = 1600;
set<long long> g[N];
void initialize(int n) {
	for(long long i = n-1; i >= 0; i--){
		for(long long j = 0; j < i; j++){
			g[i].insert(j);
			g[j].insert(i);
		}
	}
}
 
int hasEdge(int u, int v) {
	if(g[u].size() == 1 || g[v].size() == 1)return 1;
	g[u].erase(v);
	g[v].erase(u);
	return 0;
}

Subtask #1
0 / 15.0

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

Subtask #2
0 / 27.0

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

Subtask #3
0 / 58.0

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