# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
128381 | SoSooding | Game (IOI14_game) | C++17 | 392 ms | 16504 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.
#include "game.h"
int max(int a, int b){
if(a > b)
return a;
return b;
}
const int N = 1501;
int deg[N];
void initialize(int n) {
for(int i = 0;i < n;i++)deg[i] = 0;
}
int hasEdge(int u, int v) {
int mx = max(u, v);
deg[mx]++;
if(deg[mx] == mx)
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... |