oj.uz

답안 #830278

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
830278 2023-08-19T02:16:16 Z pavement Vision Program (IOI19_vision) C++17
8 / 100
 594 ms 340 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

void construct_network(int H, int W, int K) {
	auto conv = [&](int r, int c) {
		return r * W + c;
	};
	int ins = 0;
	for (int i = 0; i < H; i++) {
		for (int j = 0; j < W; j++) {
			for (int k = i; k < H; k++) {
				for (int l = (i == k ? j : 0); l < W; l++) {
					if (max(i, j) == 0 && abs(i - k) + abs(j - l) == K) {
						add_and({conv(i, j), conv(k, l)});
						ins++;
					}
				}
			}
		}
	}
	vector<int> tmp(ins);
	iota(tmp.begin(), tmp.end(), H * W);
	add_or(tmp);
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 5 ms 300 KB Output is correct
5 Correct 5 ms 340 KB Output is correct
6 Correct 3 ms 212 KB Output is correct
7 Correct 3 ms 212 KB Output is correct
8 Correct 12 ms 292 KB Output is correct
9 Correct 12 ms 304 KB Output is correct
10 Correct 12 ms 300 KB Output is correct
11 Correct 20 ms 212 KB Output is correct
12 Correct 13 ms 292 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 139 ms 280 KB Output is correct
21 Correct 143 ms 284 KB Output is correct
22 Correct 138 ms 212 KB Output is correct
23 Correct 149 ms 288 KB Output is correct
24 Correct 131 ms 212 KB Output is correct
25 Correct 132 ms 212 KB Output is correct
26 Correct 131 ms 276 KB Output is correct
27 Correct 555 ms 212 KB Output is correct
28 Correct 556 ms 284 KB Output is correct
29 Correct 594 ms 288 KB Output is correct
30 Correct 525 ms 284 KB Output is correct
31 Correct 574 ms 288 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 559 ms 276 KB on inputs (80, 199), (81, 199), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -