| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1339250 | po_rag526 | Game (IOI14_game) | C++17 | 0 ms | 344 KiB |
#include<bits/stdc++.h>
using namespace std;
int n;
map<int,int>m;
void initialize(int N){
n=N;
}
int hasEdge(int u,int v){
m[u]++;
m[v]++;
return max(m[u],m[v])==n-1;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
