| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 19039 | suhgyuho_william | Game (IOI14_game) | C++98 | 0 ms | 18780 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 <algorithm>
using namespace std;
int N;
int a[1510][1510];
void initialize(int n) {
N = n;
int i,j;
for(i=1; i<=N; i++){
for(j=1; j<=N; j++){
a[i][j] = -1;
}
}
}
int hasEdge(int u, int v) {
int i;
u++; v++;
for(i=1; i<=N; i++){
if(a[u][i] == 1){
if(a[v][i] == -1) return 0;
}
}
a[u][v] = a[v][u] = 1;
return 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... | ||||
