oj.uz

답안 #248640

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
248640 2020-07-13T00:28:41 Z ChrisT Vision Program (IOI19_vision) C++17
100 / 100
 40 ms 3864 KB 
#include<bits/stdc++.h>
#include "vision.h"
using namespace std;
using pii = pair<int,int>;
using ll = long long;
using pll = pair<ll,ll>;
using pli = pair<ll,int>;
using pil = pair<int,ll>;
using ld = long double;
using ui = unsigned int;
using ull = unsigned long long;
using ui128 = __uint128_t;
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define lc ind<<1
#define rc ind<<1|1
const int MN = 1e5 + 2, LOG = 21, INF = 1e8;
int cur;
int _add_not (int n) {cur++; return add_not(n);}
int _add_and (vector<int> ns) {cur++; return add_and(ns);}
int _add_or (vector<int> ns) {cur++; return add_or(ns);}
int _add_xor (vector<int> ns) {cur++; return add_xor(ns);}
int check_k (int n, int m, int k) {
	vector<pii> check;
	int pbase = -1, sbase = -1;
	for (int nx = 2; nx + k <= n + m; nx++) {
		vector<int> on;
		for (int x = max(1,nx - m); x <= min(n,nx-1); x++) {
			int y = nx - x;
			on.push_back((x - 1) * m + y - 1);
		}
		if (~pbase) {on.push_back(cur-1); _add_or(on);}
		else pbase = _add_or(on);
	}
	for (int nx = n + m; nx - k >= 2; nx--) {
		vector<int> on;
		for (int x = max(1,nx-m); x <= min(n,nx-1); x++) {
			int y = nx - x;
			on.push_back((x-1) * m + y - 1);
		}
		if (~sbase) {on.push_back(cur-1); _add_or(on);}
		else sbase = _add_or(on);
		check.emplace_back(cur-1,pbase + nx - k - 2);
	}
	pbase = sbase = -1;
	for (int ny = 1 - n; ny + k <= m - 1; ny++) {
		vector<int> on; 
		for (int x = max(1,1 - ny); x <= min(n, m - ny); x++) {
			int y = ny + x;
			on.push_back((x-1) * m + y - 1);
		}
		if (~pbase) {on.push_back(cur-1); _add_or(on);}
		else pbase = _add_or(on);
	}
	for (int ny = m-1; ny - k >= 1 - n; ny--) {
		vector<int> on;
		for (int x = max(1,1 - ny); x <= min(n,m - ny); x++) {
			int y = ny + x;
			on.push_back((x-1) * m + y - 1);
		}
		if (~sbase) {on.push_back(cur-1); _add_or(on);}
		else sbase = _add_or(on);
		check.emplace_back(cur - 1, pbase + ny - k + n - 1);
	}
	int start = cur;
	for (pii p : check) _add_and({p.first,p.second});
	vector<int> go;
	for (int i = start; i < cur; i++) go.push_back(i);
	assert(go.size());
	return _add_or(go);
}
void construct_network (int n, int m, int k) { //(x,y) -> (x+y,x-y)
	cur = n * m;
	if (n + m - 2 == k) check_k(n,m,k);
	else _add_and({check_k(n,m,k),_add_not(check_k(n,m,k+1))});
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 1 ms 396 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 1 ms 256 KB Output is correct
26 Correct 0 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 1 ms 396 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 1 ms 256 KB Output is correct
26 Correct 0 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 0 ms 384 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 1 ms 396 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 1 ms 256 KB Output is correct
26 Correct 0 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 0 ms 384 KB Output is correct
38 Correct 9 ms 1024 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 6 ms 768 KB Output is correct
42 Correct 0 ms 256 KB Output is correct
43 Correct 11 ms 1280 KB Output is correct
44 Correct 9 ms 1024 KB Output is correct
45 Correct 6 ms 768 KB Output is correct
46 Correct 2 ms 512 KB Output is correct
47 Correct 1 ms 256 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 4 ms 640 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 12 ms 896 KB Output is correct
9 Correct 6 ms 768 KB Output is correct
10 Correct 4 ms 640 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 21 ms 2108 KB Output is correct
21 Correct 15 ms 1664 KB Output is correct
22 Correct 6 ms 768 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 22 ms 2040 KB Output is correct
25 Correct 10 ms 1152 KB Output is correct
26 Correct 0 ms 256 KB Output is correct
27 Correct 37 ms 3828 KB Output is correct
28 Correct 35 ms 3320 KB Output is correct
29 Correct 20 ms 2116 KB Output is correct
30 Correct 6 ms 768 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 0 ms 256 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 3864 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 4 ms 640 KB Output is correct
4 Correct 7 ms 896 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 21 ms 2084 KB Output is correct
8 Correct 20 ms 2048 KB Output is correct
9 Correct 38 ms 3828 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct

Subtask #8
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 1 ms 396 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 1 ms 256 KB Output is correct
26 Correct 0 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 0 ms 384 KB Output is correct
38 Correct 9 ms 1024 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 6 ms 768 KB Output is correct
42 Correct 0 ms 256 KB Output is correct
43 Correct 11 ms 1280 KB Output is correct
44 Correct 9 ms 1024 KB Output is correct
45 Correct 6 ms 768 KB Output is correct
46 Correct 2 ms 512 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Correct 2 ms 512 KB Output is correct
49 Correct 1 ms 384 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 0 ms 256 KB Output is correct
52 Correct 2 ms 512 KB Output is correct
53 Correct 2 ms 512 KB Output is correct
54 Correct 1 ms 384 KB Output is correct
55 Correct 0 ms 256 KB Output is correct
56 Correct 2 ms 512 KB Output is correct
57 Correct 2 ms 512 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 0 ms 256 KB Output is correct
62 Correct 2 ms 512 KB Output is correct
63 Correct 2 ms 512 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 1 ms 384 KB Output is correct
67 Correct 0 ms 256 KB Output is correct
68 Correct 0 ms 256 KB Output is correct
69 Correct 0 ms 256 KB Output is correct
70 Correct 0 ms 256 KB Output is correct
71 Correct 0 ms 256 KB Output is correct
72 Correct 4 ms 640 KB Output is correct
73 Correct 3 ms 640 KB Output is correct
74 Correct 2 ms 512 KB Output is correct
75 Correct 1 ms 384 KB Output is correct
76 Correct 0 ms 256 KB Output is correct
77 Correct 12 ms 896 KB Output is correct
78 Correct 6 ms 768 KB Output is correct
79 Correct 4 ms 640 KB Output is correct
80 Correct 2 ms 384 KB Output is correct
81 Correct 0 ms 256 KB Output is correct
82 Correct 2 ms 512 KB Output is correct
83 Correct 2 ms 512 KB Output is correct
84 Correct 1 ms 384 KB Output is correct
85 Correct 0 ms 256 KB Output is correct
86 Correct 2 ms 512 KB Output is correct
87 Correct 1 ms 384 KB Output is correct
88 Correct 0 ms 256 KB Output is correct
89 Correct 21 ms 2108 KB Output is correct
90 Correct 15 ms 1664 KB Output is correct
91 Correct 6 ms 768 KB Output is correct
92 Correct 0 ms 256 KB Output is correct
93 Correct 22 ms 2040 KB Output is correct
94 Correct 10 ms 1152 KB Output is correct
95 Correct 0 ms 256 KB Output is correct
96 Correct 37 ms 3828 KB Output is correct
97 Correct 35 ms 3320 KB Output is correct
98 Correct 20 ms 2116 KB Output is correct
99 Correct 6 ms 768 KB Output is correct
100 Correct 0 ms 256 KB Output is correct
101 Correct 0 ms 256 KB Output is correct
102 Correct 0 ms 256 KB Output is correct
103 Correct 40 ms 3864 KB Output is correct
104 Correct 0 ms 256 KB Output is correct
105 Correct 4 ms 640 KB Output is correct
106 Correct 7 ms 896 KB Output is correct
107 Correct 2 ms 512 KB Output is correct
108 Correct 2 ms 512 KB Output is correct
109 Correct 21 ms 2084 KB Output is correct
110 Correct 20 ms 2048 KB Output is correct
111 Correct 38 ms 3828 KB Output is correct
112 Correct 0 ms 256 KB Output is correct
113 Correct 0 ms 256 KB Output is correct
114 Correct 32 ms 3320 KB Output is correct
115 Correct 1 ms 256 KB Output is correct
116 Correct 2 ms 512 KB Output is correct
117 Correct 2 ms 512 KB Output is correct
118 Correct 19 ms 2020 KB Output is correct
119 Correct 18 ms 2048 KB Output is correct
120 Correct 20 ms 2048 KB Output is correct
121 Correct 19 ms 2040 KB Output is correct
122 Correct 19 ms 2048 KB Output is correct
123 Correct 38 ms 3828 KB Output is correct
124 Correct 32 ms 3320 KB Output is correct
125 Correct 19 ms 2168 KB Output is correct
126 Correct 19 ms 2176 KB Output is correct
127 Correct 6 ms 768 KB Output is correct
128 Correct 0 ms 256 KB Output is correct