# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
72430 |
2018-08-26T08:05:08 Z |
nvmdava |
Game (IOI14_game) |
C++17 |
|
3 ms |
608 KB |
#include <bits/stdc++.h>
using namespace std;
int a[1501];
int n;
void initialize(int n)
{
::n = n;
for(int i = 0; i < n; i++){
a[i] = n;
}
}
int hasEdge(int u, int v)
{
if(a[u] == 1 || a[v] == 1){
a[u] = 0;
a[v] = 0;
return 1;
}
a[u]--;
a[v]--;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
376 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
376 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
608 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |