oj.uz

답안 #31713

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
31713 2017-09-01T10:46:33 Z top34051 게임 (IOI14_game) C++14
0 / 100
 0 ms 19656 KB 
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
#define maxn 1505

int n;
int edge[maxn][maxn];

void initialize(int N) {
    int i,x;
    n = N;
    for(i=0;i<n-1;i++) {
        do {
            x = rand()%n;
        }while(x==i || edge[i][x]);
//        printf("edge %d %d\n",x,i);
        edge[i][x] = edge[x][i] = 1;
    }
}

int hasEdge(int u, int v) {
    return edge[u][v];
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 19656 KB Output is correct
2 Correct 0 ms 19656 KB Output is correct
3 Correct 0 ms 19656 KB Output is correct
4 Correct 0 ms 19656 KB Output is correct
5 Correct 0 ms 19656 KB Output is correct
6 Correct 0 ms 19656 KB Output is correct
7 Correct 0 ms 19656 KB Output is correct
8 Correct 0 ms 19656 KB Output is correct
9 Incorrect 0 ms 19656 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 19656 KB Output is correct
2 Correct 0 ms 19656 KB Output is correct
3 Correct 0 ms 19656 KB Output is correct
4 Correct 0 ms 19656 KB Output is correct
5 Correct 0 ms 19656 KB Output is correct
6 Correct 0 ms 19656 KB Output is correct
7 Correct 0 ms 19656 KB Output is correct
8 Correct 0 ms 19656 KB Output is correct
9 Incorrect 0 ms 19656 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 58.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 19656 KB Output is correct
2 Correct 0 ms 19656 KB Output is correct
3 Correct 0 ms 19656 KB Output is correct
4 Correct 0 ms 19656 KB Output is correct
5 Correct 0 ms 19656 KB Output is correct
6 Correct 0 ms 19656 KB Output is correct
7 Correct 0 ms 19656 KB Output is correct
8 Correct 0 ms 19656 KB Output is correct
9 Incorrect 0 ms 19656 KB Output isn't correct
10 Halted 0 ms 0 KB -