oj.uz

Submission #599273

# Submission time Handle Problem Language Result Execution time Memory
599273 2022-07-19T12:16:09 Z FatihSolak Vision Program (IOI19_vision) C++17
47 / 100
 16 ms 1392 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
int h,w,k;
int get_pos(int x,int y){
	return x*w + y;
}
void construct_network(int H, int W, int K) {
	h = H;
	w = W;
	k = K;
	map<int,int> row,col;
	int cnt = h*w;
	add_not(0);
	cnt++;
	add_or({0,cnt-1});
	int pos_1 = cnt++;
	for(int i = 0;i<h;i++){
		vector<int> v;
		for(int j = 0;j<w;j++){
			v.push_back(get_pos(i,j));
		}
		add_or(v);
		row[i] = cnt++;
	}
	for(int i = 0;i<w;i++){
		vector<int> v;
		for(int j = 0;j<h;j++){
			v.push_back(get_pos(j,i));
		}
		add_or(v);
		col[i] = cnt++;
	}
	map<int,int> row_dif,col_dif;
	for(int i = h-1;i>0;i--){
		vector<int> candidates;
		set<int> s;
		for(int j = 0;j<h;j++){
			if(j + i < h){
				s.insert(j);
			}
		}
		while(s.size()){
			int last = 0;
			vector<int> ask1;
			vector<int> ask2;
			vector<int> nums;
			while(1){
				if(s.lower_bound(last) == s.end())break;
				int num = *s.lower_bound(last);
				s.erase(num);
				nums.push_back(num);
				ask1.push_back(row[num]);
				ask2.push_back(row[num + i]);
				last = num + 2*i;
			}
			if(nums.size() > 2){
				add_or(ask1);
				int ps1 = cnt++;
				add_or(ask2);
				int ps2 = cnt++;
				add_and({ps1,ps2});
				candidates.push_back(cnt++);
			}
			else{
				for(auto u:nums){
					vector<int> ask1;
					int num = u;
					ask1.push_back(row[num]);
					ask1.push_back(row[num + i]);
					add_and(ask1);
					candidates.push_back(cnt++);
				}
			}
		}
		add_or(candidates);
		int now = cnt++;
		if(i != h-1){
			candidates.clear();
			for(int j = i + 1;j<h;j++){
				candidates.push_back(row_dif[j]);
			}
			add_or(candidates);
			int highers = cnt++;
			add_not(highers);
			int not_highers = cnt++;
			candidates = {now,not_highers};
			add_and(candidates);
			row_dif[i] = cnt++;
		}
		else{
			row_dif[i] = now;
		}
	}
	vector<int> tmp;
	for(int i = 1;i<h;i++){
		tmp.push_back(row_dif[i]);
	}
	if(h > 1){
		add_or(tmp);
		int ps = cnt++;
		add_not({ps});
		row_dif[0] = cnt++;
	}
	else{
		add_or({pos_1});
		row_dif[0] = cnt++;
	}
	
	for(int i = w-1;i>0;i--){
		vector<int> candidates;
		set<int> s;
		for(int j = 0;j<w;j++){
			if(j + i < w){
				s.insert(j);
			}
		}
		while(s.size()){
			int last = 0;
			vector<int> ask1;
			vector<int> ask2;
			vector<int> nums;
			while(1){
				if(s.lower_bound(last) == s.end())break;
				int num = *s.lower_bound(last);
				s.erase(num);
				nums.push_back(num);
				ask1.push_back(col[num]);
				ask2.push_back(col[num + i]);
				last = num + 2*i;
			}
			if(nums.size() > 2){
				add_or(ask1);
				int ps1 = cnt++;
				add_or(ask2);
				int ps2 = cnt++;
				add_and({ps1,ps2});
				candidates.push_back(cnt++);
			}
			else{
				for(auto u:nums){
					vector<int> ask1;
					int num = u;
					ask1.push_back(col[num]);
					ask1.push_back(col[num + i]);
					add_and(ask1);
					candidates.push_back(cnt++);
				}
			}
		}
		add_or(candidates);
		int now = cnt++;
		if(i != w-1){
			candidates.clear();
			for(int j = i + 1;j<w;j++){
				candidates.push_back(col_dif[j]);
			}
			add_or(candidates);
			int highers = cnt++;
			add_not(highers);
			int not_highers = cnt++;
			candidates = {now,not_highers};
			add_and(candidates);
			col_dif[i] = cnt++;
		}
		else{
			col_dif[i] = now;
		}
	}
	tmp.clear();
	for(int i = 1;i<w;i++){
		tmp.push_back(col_dif[i]);
	}
	if(w > 1){
		add_or(tmp);
		int ps = cnt++;
		add_not({ps});
		col_dif[0] = cnt++;
	}
	else{
		add_or({pos_1});
		col_dif[0] = cnt++;
	}

	vector<int> candidates;
	for(int i = 0;i<=min(h-1,k);i++){
		if(0 <= k-i && k-i < w){
			add_and({row_dif[i],col_dif[k-i]});
			candidates.push_back(cnt++);
		}
	}
	add_or(candidates);
	int answer = cnt++;
}

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:193:6: warning: unused variable 'answer' [-Wunused-variable]
  193 |  int answer = cnt++;
      |      ^~~~~~

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 0 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 1 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 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 1 ms 224 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 0 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 1 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 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 1 ms 224 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 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 0 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 1 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 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 1 ms 224 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 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 2 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 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 2 ms 340 KB Output is correct
35 Correct 2 ms 340 KB Output is correct
36 Correct 2 ms 340 KB Output is correct
37 Correct 2 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 0 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 1 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 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 1 ms 224 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 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 2 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 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 2 ms 340 KB Output is correct
35 Correct 2 ms 340 KB Output is correct
36 Correct 2 ms 340 KB Output is correct
37 Correct 2 ms 340 KB Output is correct
38 Correct 16 ms 1392 KB Output is correct
39 Correct 6 ms 724 KB Output is correct
40 Correct 8 ms 724 KB Output is correct
41 Correct 9 ms 964 KB Output is correct
42 Correct 8 ms 976 KB Output is correct
43 Correct 12 ms 1348 KB Output is correct
44 Correct 13 ms 1392 KB Output is correct
45 Correct 12 ms 1356 KB Output is correct
46 Correct 12 ms 1356 KB Output is correct
47 Correct 13 ms 1356 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 1088 KB WA in grader: Too many instructions
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 7 ms 848 KB Output is correct
4 Correct 6 ms 768 KB Output is correct
5 Correct 6 ms 848 KB Output is correct
6 Correct 6 ms 788 KB Output is correct
7 Correct 7 ms 816 KB Output is correct
8 Correct 14 ms 1260 KB Output is correct
9 Correct 12 ms 1288 KB Output is correct
10 Correct 12 ms 1356 KB Output is correct
11 Correct 12 ms 1340 KB Output is correct
12 Correct 12 ms 1304 KB Output is correct
13 Incorrect 6 ms 1168 KB WA in grader: Too many instructions
14 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 1360 KB WA in grader: Too many instructions
2 Halted 0 ms 0 KB -

Subtask #8
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 0 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 1 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 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 1 ms 224 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 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 2 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 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 2 ms 340 KB Output is correct
35 Correct 2 ms 340 KB Output is correct
36 Correct 2 ms 340 KB Output is correct
37 Correct 2 ms 340 KB Output is correct
38 Correct 16 ms 1392 KB Output is correct
39 Correct 6 ms 724 KB Output is correct
40 Correct 8 ms 724 KB Output is correct
41 Correct 9 ms 964 KB Output is correct
42 Correct 8 ms 976 KB Output is correct
43 Correct 12 ms 1348 KB Output is correct
44 Correct 13 ms 1392 KB Output is correct
45 Correct 12 ms 1356 KB Output is correct
46 Correct 12 ms 1356 KB Output is correct
47 Correct 13 ms 1356 KB Output is correct
48 Incorrect 7 ms 1088 KB WA in grader: Too many instructions
49 Halted 0 ms 0 KB -