| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 292293 | kevinyang | Game (IOI14_game) | C++14 | 405 ms | 16404 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//ioi14p3
#include <bits/stdc++.h>
using namespace std;
int len;
void initialize(int n){
len = n;
}
vector<int>freq(2005);
int hasEdge(int u, int v){
int edge = max(u,v);
freq[edge]++;
if(freq[edge]==edge){
return 1;
}
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
