#include "game.h"
const int MN = 1501;
int N;
int mat[MN][MN];
int ct[MN];
void initialize(int n) {
N = n;
for (int i=0; i<N; ++i) {
for (int j=0; j<N; ++j) {
mat[i][j] = -1;
}
ct[i] = 0;
mat[i][i] = 1;
}
}
int hasEdge(int u, int v) {
if (mat[u][v] != -1) return mat[u][v];
++ct[u];
++ct[v];
mat[u][v] = ct[u] == N-1 || ct[v] == N-1;
return mat[u][v];
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
384 KB |
Output is correct |
3 |
Correct |
0 ms |
384 KB |
Output is correct |
4 |
Incorrect |
0 ms |
384 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
384 KB |
Output is correct |
4 |
Incorrect |
0 ms |
384 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
384 KB |
Output is correct |
3 |
Correct |
0 ms |
384 KB |
Output is correct |
4 |
Incorrect |
0 ms |
384 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |