# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
528558 | | Pau | Game (IOI14_game) | C++11 | | 329 ms | 16372 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"
#include <bits/stdc++.h>
using namespace std;
int a[1501];
void initialize(int n) {
for(int i = 1; i <= 1500; i++) a[i] = 0;
}
int hasEdge(int u, int v) {
a[max(u,v)]++;
if(a[max(u,v)] == max(u,v)) 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... |