# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
31709 |
2017-09-01T09:21:45 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) {
if(cnt[u]<n-2 && cnt[v]<n-2) {
cnt[u]++; cnt[v]++;
return 0;
}
return 1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
10808 KB |
Output is correct |
2 |
Incorrect |
0 ms |
10808 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
10808 KB |
Output is correct |
2 |
Incorrect |
0 ms |
10808 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
10808 KB |
Output is correct |
2 |
Incorrect |
0 ms |
10808 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |