# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
504072 |
2022-01-09T16:01:23 Z |
Newtech66 |
Game (IOI14_game) |
C++17 |
|
1 ms |
300 KB |
#include<bits/stdc++.h>
using namespace std;
int n;
vector<set<int> > g;
void initialize(int N)
{
n=N;
g.resize(n);
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
if(i==j) continue;
g[i].insert(j);
}
}
}
int hasEdge(int u,int v)
{
if(g[u].size()==1)
{
g[u].erase(v);
g[v].erase(u);
return 1;
}else
{
g[u].erase(v);
g[v].erase(u);
return 0;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
300 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
300 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |