# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
30458 |
2017-07-23T11:37:38 Z |
osmanorhan |
Game (IOI14_game) |
C++14 |
|
0 ms |
9912 KB |
#include "game.h"
int n;
int rem[1520];
void initialize(int n) {
for(int i=0;i<n;i++)
rem[i] = i+1;
}
int hasEdge(int u, int v) {
return ((--rem[u] < --rem[v])? rem[u]:rem[v]) == 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
9912 KB |
Output is correct |
2 |
Correct |
0 ms |
9912 KB |
Output is correct |
3 |
Correct |
0 ms |
9912 KB |
Output is correct |
4 |
Correct |
0 ms |
9912 KB |
Output is correct |
5 |
Incorrect |
0 ms |
9912 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
9912 KB |
Output is correct |
2 |
Correct |
0 ms |
9912 KB |
Output is correct |
3 |
Correct |
0 ms |
9912 KB |
Output is correct |
4 |
Correct |
0 ms |
9912 KB |
Output is correct |
5 |
Incorrect |
0 ms |
9912 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
9912 KB |
Output is correct |
2 |
Correct |
0 ms |
9912 KB |
Output is correct |
3 |
Correct |
0 ms |
9912 KB |
Output is correct |
4 |
Correct |
0 ms |
9912 KB |
Output is correct |
5 |
Incorrect |
0 ms |
9912 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |