public class vision {
public void construct_network(int H, int W, int K) {
int commands = 0;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
for (int k = i; k < H; k++) {
int remaining = K - k + i;
if (remaining >= 0 && j + remaining < W) {
int[] command = {i * W + j, k * W + j + remaining};
grader.add_and(command);
commands++;
}
}
}
}
int[] command = new int[commands];
for (int i = H * W, j = 0; j < commands; i++, j++) command[j] = i;
grader.add_or(command);
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
81 ms |
10336 KB |
Output is correct |
2 |
Correct |
83 ms |
10304 KB |
Output is correct |
3 |
Correct |
88 ms |
10192 KB |
Output is correct |
4 |
Correct |
79 ms |
10104 KB |
Output is correct |
5 |
Correct |
78 ms |
10232 KB |
Output is correct |
6 |
Incorrect |
80 ms |
10344 KB |
on inputs (0, 1), (1, 0), expected 1, but computed 0 |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
81 ms |
10336 KB |
Output is correct |
2 |
Correct |
83 ms |
10304 KB |
Output is correct |
3 |
Correct |
88 ms |
10192 KB |
Output is correct |
4 |
Correct |
79 ms |
10104 KB |
Output is correct |
5 |
Correct |
78 ms |
10232 KB |
Output is correct |
6 |
Incorrect |
80 ms |
10344 KB |
on inputs (0, 1), (1, 0), expected 1, but computed 0 |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
81 ms |
10336 KB |
Output is correct |
2 |
Correct |
83 ms |
10304 KB |
Output is correct |
3 |
Correct |
88 ms |
10192 KB |
Output is correct |
4 |
Correct |
79 ms |
10104 KB |
Output is correct |
5 |
Correct |
78 ms |
10232 KB |
Output is correct |
6 |
Incorrect |
80 ms |
10344 KB |
on inputs (0, 1), (1, 0), expected 1, but computed 0 |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
81 ms |
10336 KB |
Output is correct |
2 |
Correct |
83 ms |
10304 KB |
Output is correct |
3 |
Correct |
88 ms |
10192 KB |
Output is correct |
4 |
Correct |
79 ms |
10104 KB |
Output is correct |
5 |
Correct |
78 ms |
10232 KB |
Output is correct |
6 |
Incorrect |
80 ms |
10344 KB |
on inputs (0, 1), (1, 0), expected 1, but computed 0 |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
85 ms |
10336 KB |
Output is correct |
2 |
Correct |
84 ms |
10232 KB |
Output is correct |
3 |
Correct |
88 ms |
10156 KB |
Output is correct |
4 |
Correct |
86 ms |
10420 KB |
Output is correct |
5 |
Correct |
88 ms |
10488 KB |
Output is correct |
6 |
Correct |
88 ms |
10224 KB |
Output is correct |
7 |
Correct |
93 ms |
10312 KB |
Output is correct |
8 |
Correct |
79 ms |
10068 KB |
Output is correct |
9 |
Correct |
97 ms |
10340 KB |
Output is correct |
10 |
Correct |
95 ms |
10192 KB |
Output is correct |
11 |
Correct |
79 ms |
10328 KB |
Output is correct |
12 |
Correct |
83 ms |
10232 KB |
Output is correct |
13 |
Correct |
81 ms |
10232 KB |
Output is correct |
14 |
Correct |
81 ms |
10228 KB |
Output is correct |
15 |
Correct |
87 ms |
10048 KB |
Output is correct |
16 |
Correct |
90 ms |
10424 KB |
Output is correct |
17 |
Correct |
95 ms |
10232 KB |
Output is correct |
18 |
Correct |
91 ms |
10236 KB |
Output is correct |
19 |
Correct |
81 ms |
9988 KB |
Output is correct |
20 |
Correct |
81 ms |
10228 KB |
Output is correct |
21 |
Correct |
78 ms |
10124 KB |
Output is correct |
22 |
Correct |
81 ms |
10528 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
78 ms |
10340 KB |
Output is correct |
2 |
Correct |
79 ms |
10104 KB |
Output is correct |
3 |
Correct |
156 ms |
14116 KB |
Output is correct |
4 |
Incorrect |
101 ms |
11840 KB |
WA in grader: Too many instructions |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
107 ms |
12608 KB |
WA in grader: Too many instructions |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
81 ms |
10336 KB |
Output is correct |
2 |
Correct |
83 ms |
10304 KB |
Output is correct |
3 |
Correct |
88 ms |
10192 KB |
Output is correct |
4 |
Correct |
79 ms |
10104 KB |
Output is correct |
5 |
Correct |
78 ms |
10232 KB |
Output is correct |
6 |
Incorrect |
80 ms |
10344 KB |
on inputs (0, 1), (1, 0), expected 1, but computed 0 |
7 |
Halted |
0 ms |
0 KB |
- |