oj.uz

Submission #19039

# Submission time Handle Problem Language Result Execution time Memory
19039 2016-02-17T09:15:55 Z suhgyuho_william Game (IOI14_game) C++
0 / 100
 0 ms 18780 KB 
#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;
}

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 18780 KB Output is correct
2 Incorrect 0 ms 18780 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 18780 KB Output is correct
2 Incorrect 0 ms 18780 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 18780 KB Output is correct
2 Incorrect 0 ms 18780 KB Output isn't correct
3 Halted 0 ms 0 KB -