# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
641979 |
2022-09-18T06:11:27 Z |
meoww |
Game (IOI14_game) |
C++14 |
|
1 ms |
308 KB |
#include <bits/stdc++.h>
#include "game.h"
using namespace std;
int nn;
map<pair<int,int>,int> con;
map<int,int> cnt;
void initialize(int n) {
nn=n;
}
int hasEdge(int u, int v) {
if (v>u) swap(u,v);
cnt[u]++; cnt[v]++;
if (cnt[u]==nn-1 || cnt[v]==nn-1) {
con[{u,v}]=1;
}
return con[{u,v}];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
304 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
244 KB |
Output is correct |
3 |
Correct |
1 ms |
308 KB |
Output is correct |
4 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Incorrect |
1 ms |
304 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |