oj.uz

Submission #827564

# Submission time Handle Problem Language Result Execution time Memory
827564 2023-08-16T14:46:42 Z ttamx Vision Program (IOI19_vision) C++14
10 / 100
 11 ms 1488 KB 
#include "vision.h"
#include<bits/stdc++.h>

using namespace std;

void construct_network(int H, int W, int K) {
	vector<int> h(H),w(W);
	for(int i=0;i<H;i++){
		vector<int> res;
		for(int j=0;j<W;j++)res.emplace_back(i*W+j);
		h[i]=add_or(res);
	}
	for(int i=0;i<W;i++){
		vector<int> res;
		for(int j=0;j<H;j++)res.emplace_back(j*W+i);
		w[i]=add_or(res);
	}
	int sameh=add_xor(h);
	int samew=add_xor(w);
	int ONE=add_or(h);
	int ZERO=add_not(ONE);
	int prevh=ZERO;
	vector<int> formerh(H),latterh(H);
	for(int i=0;i<H;i++){
		formerh[i]=add_and({h[i],add_not(prevh)});
		latterh[i]=add_and({h[i],add_or({prevh,sameh})});
		prevh=add_or({prevh,h[i]});
	}
	int prevw=ZERO;
	vector<int> formerw(H),latterw(H);
	for(int i=0;i<W;i++){
		formerw[i]=add_and({w[i],add_not(prevw)});
		latterw[i]=add_and({w[i],add_or({prevw,samew})});
		prevw=add_or({prevw,w[i]});
	}
	vector<int> num1h(8,ZERO),num2h(8,ZERO);
	for(int i=0;i<8;i++){
		vector<int> res1,res2;
		for(int j=0;j<H;j++){
			if(j>>i&1){
				res1.emplace_back(formerh[j]);
				res2.emplace_back(latterh[j]);
			}
		}
		if(res1.empty())continue;
		num1h[i]=add_or(res1);
		num2h[i]=add_or(res2);
	}
	vector<int> num1w(8,ZERO),num2w(8,ZERO);
	for(int i=0;i<8;i++){
		vector<int> res1,res2;
		for(int j=0;j<W;j++){
			if(j>>i&1){
				res1.emplace_back(formerw[j]);
				res2.emplace_back(latterw[j]);
			}
		}
		if(res1.empty())continue;
		num1w[i]=add_or(res1);
		num2w[i]=add_or(res2);
	}
	auto adder=[&](vector<int> a,vector<int> b){
		vector<int> res;
		int carry=ZERO;
		for(int i=0;i<8;i++){
			int axorb=add_xor({a[i],b[i]});
			int sum=add_xor({axorb,carry});
			carry=add_or({add_and({axorb,carry}),add_and({a[i],b[i]})});
			res.emplace_back(sum);
		}
		res.emplace_back(carry);
		return res;
	};
	auto sum1=adder(num1h,num1w);
	auto sum2=adder(num2h,num2w);
	auto compare=[&](vector<int> a,int k){
		vector<int> res[2];
		for(int i=0;i<9;i++)res[k>>i&1].emplace_back(a[i]);
		res[1].emplace_back(add_not(add_or(res[0])));
		return add_and(res[1]);
	};
	vector<int> res;
	for(int i=K;i<=H+W-2;i++){
		int j=i-K;
		res.emplace_back(add_and({compare(sum1,j),compare(sum2,i)}));
	}
	add_or(res);
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 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 1 ms 212 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 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 212 KB Output is correct

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 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 1 ms 212 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 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 212 KB Output is correct
19 Runtime error 1 ms 340 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 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 1 ms 212 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 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 212 KB Output is correct
19 Runtime error 1 ms 340 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 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 1 ms 212 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 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 212 KB Output is correct
19 Runtime error 1 ms 340 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 6
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 1 ms 212 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Runtime error 1 ms 852 KB Execution killed with signal 6
9 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1488 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Runtime error 1 ms 852 KB Execution killed with signal 6
5 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 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 1 ms 212 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 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 212 KB Output is correct
19 Runtime error 1 ms 340 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -