oj.uz

Submission #1048787

# Submission time Handle Problem Language Result Execution time Memory
1048787 2024-08-08T09:33:08 Z noyancanturk Vision Program (IOI19_vision) C++17
8 / 100
 23 ms 2908 KB 
#include "vision.h"

#include <bits/stdc++.h>
using namespace std;

#define pb push_back

const int lim=210;

int pref1[lim],pref2[lim];
int p1(int l,int r){
	if(!l)return pref1[r];
	return add_xor({pref1[r],pref1[l-1]});
}
int p2(int l,int r){
	if(!l)return pref2[r];
	return add_xor({pref2[r],pref2[l-1]});
}

struct {
	int tree[4*lim];
	int P,VAL;
	int N;
	void init(int n){
		N=n;
	}
	void update(int l,int r,int node){
		if(l==r){
			tree[P]=VAL;
			return;
		}
		int mid=(l+r)>>1,child=node<<1;
		if(P<=mid)update(l,mid,child);
		else update(mid+1,r,child|1);
	}
	void update(int p,int val) {
		P=p,VAL=val;
		update(0,N-1,1);
	}
	int build(int l,int r,int node){
		if(l==r){
			return tree[node];
		}
		int mid=(l+r)>>1,child=node<<1;
		return tree[node]=add_or({build(l,mid,child),build(mid+1,r,child|1)});
	}
	void build(){
		build(0,N-1,1);
	}
	vector<int>need;
	int L,R;
	void query(int l,int r,int node){
		if(L<=l&&r<=R){
			need.pb(tree[node]);
			return;
		}
		if(r<L||R<l)return;
		int mid=(l+r)>>1,child=node<<1;
		query(l,mid,child),query(mid+1,r,child|1);
	}
	int query(int l,int r){
		L=l,R=r;
		need.clear();
		query(0,N-1,1);
		return add_or(need);
	}
}st1,st2;


void construct_network(int H, int W, int K) {
	#define tr(x,y) ((x)*W+(y))
	#define check(x,y) (0<=(x)&&(x)<H&&0<=(y)&&(y)<W)
	vector<int>sat1,sat2,sat3;
	int r1[H+W+1],r2[H+W+1];
	for(int i=0;i<H+W+1;i++){
		vector<int>kk,ll;
		for(int x=0;x<H+W+1;x++){
			if(check(x,x+i)){
				kk.pb(tr(x,x+i));
			}
			if(check(x,i-x)){
				ll.pb(tr(x,i-x));
			}
		}
		if(kk.size())r1[i]=add_or(kk);
		else r1[i]=-1;
		if(ll.size())r2[i]=add_or(ll);
		else r2[i]=-1;
	}
	for(int i=0;i+K<H+W+1;i++){
		if(r1[i]!=-1&&r1[i+K]!=-1)
			sat1.pb(add_and({r1[i],r1[i+K]}));
		if(r2[i]!=-1&&r2[i+K]!=-1)
			sat1.pb(add_and({r2[i],r2[i+K]}));
	}
	int xor1[H],or1[H];
	st1.init(H);
	for(int i=0;i<H;i++){
		vector<int>th;
		for(int j=0;j<W;j++){
			th.pb(tr(i,j));
		}
		xor1[i]=add_xor(th);
		if(i)pref1[i]=add_xor({xor1[i],pref1[i-1]});
		else pref1[i]=xor1[i];
		or1[i]=add_or(th);
		st1.update(i,or1[i]);
	}
	int xor2[W],or2[W];
	st2.init(W);
	for(int i=0;i<W;i++){
		vector<int>th;
		for(int j=0;j<H;j++){
			th.pb(tr(j,i));
		}
		xor2[i]=add_xor(th);
		if(i)pref2[i]=add_xor({xor2[i],pref2[i-1]});
		else pref2[i]=xor2[i];
		or2[i]=add_or(th);
		st2.update(i,or2[i]);
	}
	st1.build(),st2.build();
	for(int i=0;i<H;i++){
		int haveblack=st1.query(i,min(i+K,H-1));
		int haveboth=p1(i,min(i+K,H-1));
		sat2.pb(add_and({haveblack,add_not(haveboth)}));
	}
	for(int i=0;i<W;i++){
		int haveblack=st2.query(i,min(i+K,W-1));
		int haveboth=p2(i,min(i+K,W-1));
		sat3.pb(add_and({haveblack,add_not(haveboth)}));
	}
	//ending
	add_and({add_or(sat1),add_or(sat2),add_or(sat3)});
}

/*
void construct_network(int H, int W, int K) {
	std::vector<int> Ns;
	Ns = {0, 1};
	int a = add_and(Ns);
	Ns = {0, a};
	int b = add_or(Ns);
	Ns = {0, 1, b};
	int c = add_xor(Ns);
	add_not(c);
}
*/

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 604 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 2 ms 608 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 1 ms 620 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 5 ms 860 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 2 ms 856 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 6 ms 1628 KB Output is correct
21 Correct 6 ms 1628 KB Output is correct
22 Correct 6 ms 1640 KB Output is correct
23 Correct 6 ms 1628 KB Output is correct
24 Correct 6 ms 1696 KB Output is correct
25 Correct 9 ms 1628 KB Output is correct
26 Correct 7 ms 1628 KB Output is correct
27 Correct 11 ms 2776 KB Output is correct
28 Correct 11 ms 2776 KB Output is correct
29 Correct 23 ms 2644 KB Output is correct
30 Correct 11 ms 2652 KB Output is correct
31 Correct 18 ms 2804 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 2908 KB on inputs (43, 74), (167, 197), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -