oj.uz

Submission #533860

# Submission time Handle Problem Language Result Execution time Memory
533860 2022-03-07T12:51:22 Z jamezzz Vision Program (IOI19_vision) C++17
26 / 100
 11 ms 1228 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
 
#define pf printf
#define pb push_back
 
vector<int> qry,qry2;
int l[405],r[405];
 
int add_and(int a,int b){
	vector<int> v{a,b};
	return add_and(v);
}
 
int add_or(int a,int b){
	vector<int> v{a,b};
	return add_or(v);
}
 
void construct_network(int H,int W,int K){
	for(int i=0;i<H+W-1;++i){
		for(int h=0;h<H;++h){
			if(h+W-1<i||h>i)continue;
			qry.pb(h*W+(i-h));
		}
		l[i]=add_xor(qry);
		qry.clear();
	}
	for(int i=0;i<H+W-1;++i){//h-w=i-(W-1)
		for(int h=0;h<H;++h){
			if(h-i>0||h-i<=-W)continue;
			qry.pb(h*W+(h-i+W-1));
		}
		r[i]=add_xor(qry);
		qry.clear();
	}
	
	int la,lb,lc,ra,rb,rc;
	for(int i=0;i<H+W-1;++i)qry.pb(l[i]);
	lc=add_not(add_or(qry));
	qry.clear();
	for(int i=0;i<H+W-2;++i){
		for(int j=i+1;j<=min(H+W-2,i+K);++j)qry.pb(l[j]);
		qry2.pb(add_and(l[i],add_or(qry)));
		qry.clear();
	}
	la=add_or(qry2);
	qry2.clear();
	if(K!=1){
		for(int i=0;i<H+W-2;++i){
			for(int j=i+1;j<=min(H+W-2,i+K-1);++j)qry.pb(l[j]);
			qry2.pb(add_and(l[i],add_or(qry)));
			qry.clear();
		}
		lb=add_or(qry2);
		qry2.clear();
	}
	else lb=lc;
	
	for(int i=0;i<H+W-1;++i)qry.pb(r[i]);
	rc=add_not(add_or(qry));
	qry.clear();
	for(int i=0;i<H+W-2;++i){
		for(int j=i+1;j<=min(H+W-2,i+K);++j)qry.pb(r[j]);
		qry2.pb(add_and(r[i],add_or(qry)));
		qry.clear();
	}
	ra=add_or(qry2);
	qry2.clear();
	if(K!=1){
		for(int i=0;i<H+W-2;++i){
			for(int j=i+1;j<=min(H+W-2,i+K-1);++j)qry.pb(r[j]);
			qry2.pb(add_and(r[i],add_or(qry)));
			qry.clear();
		}
		rb=add_or(qry2);
		qry2.clear();
	}
	else rb=rc;
	
	add_and(add_and(add_or(la,lc),add_or(ra,rc)),add_or(add_not(lb),add_not(rb)));
	//add_or(add_and(la,add_not(lb)),add_and(ra,add_not(rb)));
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 304 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Incorrect 1 ms 204 KB on inputs (0, 1), (1, 0), expected 0, but computed 1
10 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 304 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Incorrect 1 ms 204 KB on inputs (0, 1), (1, 0), expected 0, but computed 1
10 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 304 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Incorrect 1 ms 204 KB on inputs (0, 1), (1, 0), expected 0, but computed 1
10 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 304 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Incorrect 1 ms 204 KB on inputs (0, 1), (1, 0), expected 0, but computed 1
10 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 9 ms 844 KB Output is correct
3 Correct 7 ms 852 KB Output is correct
4 Correct 11 ms 1072 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 5 ms 716 KB Output is correct
7 Correct 7 ms 972 KB Output is correct
8 Correct 8 ms 972 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 4 ms 588 KB Output is correct
11 Correct 7 ms 892 KB Output is correct
12 Correct 7 ms 880 KB Output is correct
13 Correct 7 ms 972 KB Output is correct
14 Correct 8 ms 972 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 4 ms 716 KB Output is correct
17 Correct 7 ms 844 KB Output is correct
18 Correct 6 ms 844 KB Output is correct
19 Correct 8 ms 972 KB Output is correct
20 Correct 8 ms 972 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 276 KB Output is correct
4 Incorrect 3 ms 460 KB on inputs (0, 0), (15, 15), expected 0, but computed 1
5 Halted 0 ms 0 KB -

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1208 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 4 ms 716 KB Output is correct
8 Correct 5 ms 716 KB Output is correct
9 Correct 10 ms 1228 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 304 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Incorrect 1 ms 204 KB on inputs (0, 1), (1, 0), expected 0, but computed 1
10 Halted 0 ms 0 KB -