# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
319390 |
2020-11-05T07:49:32 Z |
Nayna |
Game (IOI14_game) |
C++14 |
|
1 ms |
364 KB |
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
const int mxn = 2000;
int cnt[mxn];
void initialize(int n) {
for(int i = 1; i <= n; i++) cnt[i] = i;
}
int hasEdge(int u, int v) {
if(u>v) swap(u, v);
cnt[u]--;
if(!cnt[u]) return 1;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |