# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
461273 |
2021-08-09T16:16:35 Z |
Khizri |
Game (IOI14_game) |
C++17 |
|
1 ms |
216 KB |
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
const int mxn=1500+5;
int d[mxn],cnt[mxn];
void initialize(int N) {
for(int i=0;i<N;i++){
cnt[i]=N-1;
}
}
int hasEdge(int u, int v) {
if(u>v){
swap(u,v);
}
cnt[u]--;
cnt[v]--;
if(cnt[u]==0){
return 1;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
216 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |