# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
19044 | suhgyuho_william | Game (IOI14_game) | C++98 | 601 ms | 31280 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>
#include <vector>
using namespace std;
int N;
int a[1510][1510];
vector<int> edge[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;
}
while(!edge[i].empty()) edge[i].pop_back();
edge[i].push_back(i);
}
}
int hasEdge(int u, int v) {
int i,j;
int v1,v2;
int t1,t2;
u++; v++;
t1 = edge[u].size(); t2 = edge[v].size();
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |