# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
123893 |
2019-07-02T08:50:49 Z |
turbat |
Game (IOI14_game) |
C++14 |
|
2 ms |
376 KB |
#include <bits/stdc++.h>
#include "game.h"
using namespace std;
int cnt, n, c[1505], d[1505];
void initialize(int n) {:: n = n;}
int hasEdge(int u, int v) {
c[u]++, c[v]++;
if (d[u] || d[v]) return 1;
if (c[u] == n - 2) d[u] = 1, cnt++;
if (c[v] == n - 2) d[v] = 1, cnt++;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
256 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Incorrect |
2 ms |
372 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |