# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
31708 |
2017-09-01T09:09:53 Z |
top34051 |
Game (IOI14_game) |
C++14 |
|
0 ms |
10808 KB |
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
#define maxn 1505
int n;
int cnt[maxn];
void initialize(int N) {
n = N;
memset(cnt,0,sizeof(cnt));
}
int hasEdge(int u, int v) {
cnt[u]++; cnt[v]++;
if(cnt[u]==n-1 || cnt[v]==n-1) return 1;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
10808 KB |
Output is correct |
2 |
Correct |
0 ms |
10808 KB |
Output is correct |
3 |
Correct |
0 ms |
10808 KB |
Output is correct |
4 |
Incorrect |
0 ms |
10808 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
10808 KB |
Output is correct |
2 |
Correct |
0 ms |
10808 KB |
Output is correct |
3 |
Correct |
0 ms |
10808 KB |
Output is correct |
4 |
Incorrect |
0 ms |
10808 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
10808 KB |
Output is correct |
2 |
Correct |
0 ms |
10808 KB |
Output is correct |
3 |
Correct |
0 ms |
10808 KB |
Output is correct |
4 |
Incorrect |
0 ms |
10808 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |