# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
554981 |
2022-04-29T19:25:51 Z |
beaconmc |
Game (IOI14_game) |
C++14 |
|
0 ms |
212 KB |
#include <bits/stdc++.h>
using namespace std;
long long sussy[1501];
long long N = 0;
void initialize(int n){
for(int i=0; i<=n; i++){
sussy[i] = 0;
}
N = n;
}
int hasEdge(int u, int v){
sussy[u] += 1;
sussy[v] += 1;
if (sussy[u] == N-1){
return 1;
}else if (sussy[v] == N-1){
return 1;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |