oj.uz

답안 #417562

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
417562 2021-06-04T00:16:09 Z Kevin_Zhang_TW Vision Program (IOI19_vision) C++17
100 / 100
 17 ms 1860 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
#include "vision.h"

const int MAX_N = 300010;

vector<int> operator + (vector<int> a, vector<int> b) { a.insert(end(a), AI(b)); return a; }

void construct_network(int H, int W, int K) {

	auto to_id = [&](int i, int j) {
		return i * W + j;
	};
	auto valid = [&](int i, int j) {
		return i >= 0 && i < H && j >= 0 && j < W;
	};


	vector<int> bits;
	{
		vector<int> f(H), pf(H), suf(H);
		for (int i = 0;i < H;++i) {
			vector<int> qp;
			for (int j = 0;j < W;++j)
				qp.pb(to_id(i, j));
			f[i] = add_or(qp);
		}
		for (int i = 0;i+1 < H;++i) {
			pf[i] = f[i];
			if (i) pf[i] = add_or({pf[i-1], pf[i]});
		}
		for (int i = H-1;i > 0;--i) {
			suf[i] = f[i];
			if (i+1 < H) suf[i] = add_or({suf[i+1], suf[i]});
		}
		for (int i = 0;i+1 < H;++i)
			bits.pb(add_and({pf[i], suf[i+1]}));
	}
	{
		vector<int> f(W), pf(W), suf(W);
		for (int i = 0;i < W;++i) {
			vector<int> qp;
			for (int j = 0;j < H;++j)
				qp.pb(to_id(j, i));
			f[i] = add_or(qp);
		}
		for (int i = 0;i+1 < W;++i) {
			pf[i] = f[i];
			if (i) pf[i] = add_or({pf[i-1], pf[i]});
		}
		for (int i = W-1;i > 0;--i) {
			suf[i] = f[i];
			if (i+1 < W) suf[i] = add_or({suf[i+1], suf[i]});
		}
		for (int i = 0;i+1 < W;++i)
			bits.pb(add_and({pf[i], suf[i+1]}));
	}
					
	int mxv = bits.size(), wid = __lg(mxv) + 1;
	int zero = add_xor({0, 0}), one = add_not(zero);

	vector<int> a(wid, zero), b(wid, zero);

	for (int i = 0;i < wid;++i)
		if (K>>i&1) b[i] = one;

	for (int i : bits) {
		for (int j = 0;j < wid;++j) {
			int ret = add_xor({i, a[j]});
			i = add_and({i, a[j]});
			a[j] = ret;
		}
	}

	vector<int> res;
	for (int i = 0;i < wid;++i)
		res.pb(add_xor({a[i], b[i]}));

	int x = add_or(res);
	add_not(x);

}

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:28:7: warning: variable 'valid' set but not used [-Wunused-but-set-variable]
   28 |  auto valid = [&](int i, int j) {
      |       ^~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
12.0 / 12.0

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

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 288 KB Output is correct
3 Correct 3 ms 588 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 3 ms 588 KB Output is correct
7 Correct 3 ms 548 KB Output is correct
8 Correct 4 ms 588 KB Output is correct
9 Correct 4 ms 588 KB Output is correct
10 Correct 4 ms 588 KB Output is correct
11 Correct 4 ms 588 KB Output is correct
12 Correct 4 ms 588 KB Output is correct
13 Correct 3 ms 588 KB Output is correct
14 Correct 4 ms 716 KB Output is correct
15 Correct 3 ms 516 KB Output is correct
16 Correct 3 ms 588 KB Output is correct
17 Correct 3 ms 588 KB Output is correct
18 Correct 3 ms 588 KB Output is correct
19 Correct 3 ms 588 KB Output is correct
20 Correct 9 ms 1096 KB Output is correct
21 Correct 9 ms 1132 KB Output is correct
22 Correct 9 ms 1096 KB Output is correct
23 Correct 9 ms 1096 KB Output is correct
24 Correct 9 ms 1092 KB Output is correct
25 Correct 9 ms 1180 KB Output is correct
26 Correct 9 ms 1096 KB Output is correct
27 Correct 14 ms 1692 KB Output is correct
28 Correct 14 ms 1712 KB Output is correct
29 Correct 15 ms 1688 KB Output is correct
30 Correct 15 ms 1732 KB Output is correct
31 Correct 15 ms 1732 KB Output is correct
32 Correct 1 ms 292 KB Output is correct
33 Correct 1 ms 204 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 1720 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 3 ms 588 KB Output is correct
4 Correct 4 ms 588 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 3 ms 588 KB Output is correct
7 Correct 9 ms 1096 KB Output is correct
8 Correct 9 ms 1096 KB Output is correct
9 Correct 15 ms 1732 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 292 KB Output is correct

Subtask #8
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 288 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 288 KB Output is correct
28 Correct 1 ms 292 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 5 ms 768 KB Output is correct
39 Correct 2 ms 332 KB Output is correct
40 Correct 2 ms 332 KB Output is correct
41 Correct 3 ms 588 KB Output is correct
42 Correct 3 ms 588 KB Output is correct
43 Correct 5 ms 716 KB Output is correct
44 Correct 5 ms 672 KB Output is correct
45 Correct 5 ms 716 KB Output is correct
46 Correct 5 ms 672 KB Output is correct
47 Correct 5 ms 716 KB Output is correct
48 Correct 3 ms 588 KB Output is correct
49 Correct 3 ms 548 KB Output is correct
50 Correct 3 ms 588 KB Output is correct
51 Correct 3 ms 588 KB Output is correct
52 Correct 3 ms 588 KB Output is correct
53 Correct 3 ms 588 KB Output is correct
54 Correct 3 ms 552 KB Output is correct
55 Correct 3 ms 588 KB Output is correct
56 Correct 3 ms 588 KB Output is correct
57 Correct 3 ms 588 KB Output is correct
58 Correct 3 ms 588 KB Output is correct
59 Correct 3 ms 588 KB Output is correct
60 Correct 3 ms 588 KB Output is correct
61 Correct 3 ms 716 KB Output is correct
62 Correct 3 ms 588 KB Output is correct
63 Correct 3 ms 532 KB Output is correct
64 Correct 3 ms 680 KB Output is correct
65 Correct 3 ms 588 KB Output is correct
66 Correct 3 ms 548 KB Output is correct
67 Correct 3 ms 588 KB Output is correct
68 Correct 0 ms 204 KB Output is correct
69 Correct 1 ms 204 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 1 ms 288 KB Output is correct
72 Correct 3 ms 588 KB Output is correct
73 Correct 3 ms 588 KB Output is correct
74 Correct 3 ms 588 KB Output is correct
75 Correct 3 ms 588 KB Output is correct
76 Correct 3 ms 548 KB Output is correct
77 Correct 4 ms 588 KB Output is correct
78 Correct 4 ms 588 KB Output is correct
79 Correct 4 ms 588 KB Output is correct
80 Correct 4 ms 588 KB Output is correct
81 Correct 4 ms 588 KB Output is correct
82 Correct 3 ms 588 KB Output is correct
83 Correct 4 ms 716 KB Output is correct
84 Correct 3 ms 516 KB Output is correct
85 Correct 3 ms 588 KB Output is correct
86 Correct 3 ms 588 KB Output is correct
87 Correct 3 ms 588 KB Output is correct
88 Correct 3 ms 588 KB Output is correct
89 Correct 9 ms 1096 KB Output is correct
90 Correct 9 ms 1132 KB Output is correct
91 Correct 9 ms 1096 KB Output is correct
92 Correct 9 ms 1096 KB Output is correct
93 Correct 9 ms 1092 KB Output is correct
94 Correct 9 ms 1180 KB Output is correct
95 Correct 9 ms 1096 KB Output is correct
96 Correct 14 ms 1692 KB Output is correct
97 Correct 14 ms 1712 KB Output is correct
98 Correct 15 ms 1688 KB Output is correct
99 Correct 15 ms 1732 KB Output is correct
100 Correct 15 ms 1732 KB Output is correct
101 Correct 1 ms 292 KB Output is correct
102 Correct 1 ms 204 KB Output is correct
103 Correct 15 ms 1720 KB Output is correct
104 Correct 1 ms 204 KB Output is correct
105 Correct 3 ms 588 KB Output is correct
106 Correct 4 ms 588 KB Output is correct
107 Correct 3 ms 588 KB Output is correct
108 Correct 3 ms 588 KB Output is correct
109 Correct 9 ms 1096 KB Output is correct
110 Correct 9 ms 1096 KB Output is correct
111 Correct 15 ms 1732 KB Output is correct
112 Correct 1 ms 204 KB Output is correct
113 Correct 1 ms 292 KB Output is correct
114 Correct 15 ms 1652 KB Output is correct
115 Correct 3 ms 588 KB Output is correct
116 Correct 3 ms 588 KB Output is correct
117 Correct 9 ms 1096 KB Output is correct
118 Correct 9 ms 1172 KB Output is correct
119 Correct 14 ms 1656 KB Output is correct
120 Correct 14 ms 1732 KB Output is correct
121 Correct 15 ms 1860 KB Output is correct
122 Correct 15 ms 1748 KB Output is correct
123 Correct 17 ms 1716 KB Output is correct
124 Correct 14 ms 1732 KB Output is correct
125 Correct 14 ms 1668 KB Output is correct
126 Correct 14 ms 1672 KB Output is correct
127 Correct 14 ms 1748 KB Output is correct
128 Correct 15 ms 1744 KB Output is correct