oj.uz

Submission #602921

# Submission time Handle Problem Language Result Execution time Memory
602921 2022-07-23T12:42:24 Z alireza_kaviani Vision Program (IOI19_vision) C++17
100 / 100
 30 ms 3092 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

#define all(x)	(x).begin(), (x).end()
#define SZ(x)	int((x).size())
#define sep		' '

const int MOD = 1e9 + 7;
const int LOG = 9;

int n , m , k;
vector<int> all;

int count_bits(int x){
	int res = 0;
	while(x){
		res++;
		x /= 2;
	}
	return res;
}

vector<int> solve(int l , int r){
	vector<int> bits , nots;
	int lg = count_bits(r - l);
	for(int i = 0 ; i < lg ; i++){
		int sz = (1 << i);
		vector<int> ns;
		for(int j = l ; j <= r ; j++){
			vector<int> query;
			for(int k = j ; k <= r ; k++){
				if((k - j) & (1 << i)){
					query.push_back(k);
				}
			}
			if(SZ(query) == 0)	continue;
			int OR = add_or(query);
			query = {OR , j};
			ns.push_back(add_and(query));
		}
		bits.push_back(add_or(ns));
		nots.push_back(add_not(bits.back()));
	}
	vector<int> res;
	for(int i = 0 ; i < min((1 << lg) , k + 1) ; i++){
		vector<int> ns;
		for(int j = 0 ; j < lg ; j++){
			if(i & (1 << j)){
				ns.push_back(bits[j]);
			}
			else{
				ns.push_back(nots[j]);
			}
		}
		if(SZ(ns) == 0){
			res.push_back(add_or(all));
			continue;
		}
		res.push_back(add_and(ns));
	}
	return res;
}

void construct_network(int H, int W, int K) {
	n = H; m = W; k = K;
	int mn = MOD , mx = -MOD;
	for(int i = 0 ; i < n ; i++){
		vector<int> ns;
		for(int j = 0 ; j < m ; j++){
			ns.push_back(i * m + j);
			all.push_back(i * m + j);
		}
		int ind = add_or(ns);
		mn = min(mn , ind);
		mx = max(mx , ind);
	}
	vector<int> A = solve(mn , mx);
	mn = MOD, mx = -MOD;
	for(int i = 0 ; i < m ; i++){
		vector<int> ns;
		for(int j = 0 ; j < n ; j++){
			ns.push_back(j * m + i);
		}
		int ind = add_or(ns);
		mn = min(mn , ind);
		mx = max(mx , ind);
	}
	vector<int> B = solve(mn , mx);
	//assert(SZ(A) == k + 1);
	//assert(SZ(B) == k + 1);
	vector<int> ns;
	for(int i = 0 ; i < SZ(A) ; i++){
		for(int j = 0 ; j < SZ(B) ; j++){
			if(i + j != k)	continue;
			vector<int> query = {A[i] , B[j]};
			ns.push_back(add_and(query));
		}
	}
	add_or(ns);
}

Compilation message

vision.cpp: In function 'std::vector<int> solve(int, int)':
vision.cpp:28:7: warning: unused variable 'sz' [-Wunused-variable]
   28 |   int sz = (1 << i);
      |       ^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 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 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 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 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 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 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 7 ms 932 KB Output is correct
39 Correct 3 ms 468 KB Output is correct
40 Correct 3 ms 468 KB Output is correct
41 Correct 4 ms 596 KB Output is correct
42 Correct 4 ms 596 KB Output is correct
43 Correct 6 ms 988 KB Output is correct
44 Correct 6 ms 980 KB Output is correct
45 Correct 6 ms 1004 KB Output is correct
46 Correct 8 ms 980 KB Output is correct
47 Correct 6 ms 980 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1036 KB Output is correct
2 Correct 7 ms 980 KB Output is correct
3 Correct 7 ms 980 KB Output is correct
4 Correct 7 ms 980 KB Output is correct
5 Correct 8 ms 988 KB Output is correct
6 Correct 7 ms 980 KB Output is correct
7 Correct 8 ms 1008 KB Output is correct
8 Correct 8 ms 980 KB Output is correct
9 Correct 8 ms 948 KB Output is correct
10 Correct 8 ms 980 KB Output is correct
11 Correct 8 ms 984 KB Output is correct
12 Correct 8 ms 980 KB Output is correct
13 Correct 9 ms 996 KB Output is correct
14 Correct 10 ms 980 KB Output is correct
15 Correct 11 ms 928 KB Output is correct
16 Correct 10 ms 980 KB Output is correct
17 Correct 7 ms 980 KB Output is correct
18 Correct 8 ms 980 KB Output is correct
19 Correct 8 ms 980 KB Output is correct
20 Correct 8 ms 980 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 5 ms 596 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 4 ms 596 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 8 ms 888 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 9 ms 852 KB Output is correct
11 Correct 7 ms 852 KB Output is correct
12 Correct 6 ms 852 KB Output is correct
13 Correct 11 ms 1020 KB Output is correct
14 Correct 9 ms 988 KB Output is correct
15 Correct 10 ms 1036 KB Output is correct
16 Correct 7 ms 980 KB Output is correct
17 Correct 8 ms 932 KB Output is correct
18 Correct 8 ms 968 KB Output is correct
19 Correct 11 ms 1120 KB Output is correct
20 Correct 16 ms 1872 KB Output is correct
21 Correct 15 ms 1848 KB Output is correct
22 Correct 14 ms 1872 KB Output is correct
23 Correct 14 ms 1872 KB Output is correct
24 Correct 14 ms 1744 KB Output is correct
25 Correct 14 ms 1840 KB Output is correct
26 Correct 14 ms 1920 KB Output is correct
27 Correct 23 ms 2896 KB Output is correct
28 Correct 23 ms 2896 KB Output is correct
29 Correct 29 ms 2964 KB Output is correct
30 Correct 24 ms 3052 KB Output is correct
31 Correct 23 ms 2972 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 2960 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 580 KB Output is correct
4 Correct 6 ms 904 KB Output is correct
5 Correct 8 ms 1004 KB Output is correct
6 Correct 8 ms 992 KB Output is correct
7 Correct 15 ms 1872 KB Output is correct
8 Correct 13 ms 1744 KB Output is correct
9 Correct 22 ms 2888 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct

Subtask #8
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 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 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 7 ms 932 KB Output is correct
39 Correct 3 ms 468 KB Output is correct
40 Correct 3 ms 468 KB Output is correct
41 Correct 4 ms 596 KB Output is correct
42 Correct 4 ms 596 KB Output is correct
43 Correct 6 ms 988 KB Output is correct
44 Correct 6 ms 980 KB Output is correct
45 Correct 6 ms 1004 KB Output is correct
46 Correct 8 ms 980 KB Output is correct
47 Correct 6 ms 980 KB Output is correct
48 Correct 10 ms 1036 KB Output is correct
49 Correct 7 ms 980 KB Output is correct
50 Correct 7 ms 980 KB Output is correct
51 Correct 7 ms 980 KB Output is correct
52 Correct 8 ms 988 KB Output is correct
53 Correct 7 ms 980 KB Output is correct
54 Correct 8 ms 1008 KB Output is correct
55 Correct 8 ms 980 KB Output is correct
56 Correct 8 ms 948 KB Output is correct
57 Correct 8 ms 980 KB Output is correct
58 Correct 8 ms 984 KB Output is correct
59 Correct 8 ms 980 KB Output is correct
60 Correct 9 ms 996 KB Output is correct
61 Correct 10 ms 980 KB Output is correct
62 Correct 11 ms 928 KB Output is correct
63 Correct 10 ms 980 KB Output is correct
64 Correct 7 ms 980 KB Output is correct
65 Correct 8 ms 980 KB Output is correct
66 Correct 8 ms 980 KB Output is correct
67 Correct 8 ms 980 KB Output is correct
68 Correct 0 ms 212 KB Output is correct
69 Correct 0 ms 212 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 5 ms 596 KB Output is correct
73 Correct 3 ms 596 KB Output is correct
74 Correct 4 ms 596 KB Output is correct
75 Correct 3 ms 596 KB Output is correct
76 Correct 3 ms 596 KB Output is correct
77 Correct 8 ms 888 KB Output is correct
78 Correct 5 ms 852 KB Output is correct
79 Correct 9 ms 852 KB Output is correct
80 Correct 7 ms 852 KB Output is correct
81 Correct 6 ms 852 KB Output is correct
82 Correct 11 ms 1020 KB Output is correct
83 Correct 9 ms 988 KB Output is correct
84 Correct 10 ms 1036 KB Output is correct
85 Correct 7 ms 980 KB Output is correct
86 Correct 8 ms 932 KB Output is correct
87 Correct 8 ms 968 KB Output is correct
88 Correct 11 ms 1120 KB Output is correct
89 Correct 16 ms 1872 KB Output is correct
90 Correct 15 ms 1848 KB Output is correct
91 Correct 14 ms 1872 KB Output is correct
92 Correct 14 ms 1872 KB Output is correct
93 Correct 14 ms 1744 KB Output is correct
94 Correct 14 ms 1840 KB Output is correct
95 Correct 14 ms 1920 KB Output is correct
96 Correct 23 ms 2896 KB Output is correct
97 Correct 23 ms 2896 KB Output is correct
98 Correct 29 ms 2964 KB Output is correct
99 Correct 24 ms 3052 KB Output is correct
100 Correct 23 ms 2972 KB Output is correct
101 Correct 0 ms 212 KB Output is correct
102 Correct 0 ms 212 KB Output is correct
103 Correct 24 ms 2960 KB Output is correct
104 Correct 0 ms 212 KB Output is correct
105 Correct 3 ms 580 KB Output is correct
106 Correct 6 ms 904 KB Output is correct
107 Correct 8 ms 1004 KB Output is correct
108 Correct 8 ms 992 KB Output is correct
109 Correct 15 ms 1872 KB Output is correct
110 Correct 13 ms 1744 KB Output is correct
111 Correct 22 ms 2888 KB Output is correct
112 Correct 0 ms 212 KB Output is correct
113 Correct 0 ms 212 KB Output is correct
114 Correct 25 ms 2884 KB Output is correct
115 Correct 7 ms 980 KB Output is correct
116 Correct 7 ms 980 KB Output is correct
117 Correct 14 ms 1872 KB Output is correct
118 Correct 14 ms 1820 KB Output is correct
119 Correct 26 ms 2976 KB Output is correct
120 Correct 23 ms 2896 KB Output is correct
121 Correct 30 ms 2932 KB Output is correct
122 Correct 27 ms 2960 KB Output is correct
123 Correct 22 ms 2896 KB Output is correct
124 Correct 22 ms 3092 KB Output is correct
125 Correct 22 ms 3044 KB Output is correct
126 Correct 26 ms 3056 KB Output is correct
127 Correct 26 ms 2944 KB Output is correct
128 Correct 23 ms 3024 KB Output is correct