제출 #1038774

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1038774		amirhoseinfar1385	Vision Program (IOI19_vision)	C++17	0 / 100	13 ms	2128 KiB

vision

#include "vision.h"
#include<bits/stdc++.h>
using namespace std;
int n,m;

int porsor(int l1,int l2,int r1,int r2){
	vector<int>por;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			if(i>=l1&&i<=l2&&j>=r1&&j<=r2){
				por.push_back(i*n+j);
			}
		}
	}
	return add_or(por);
}

int porsxor(int l1,int l2,int r1,int r2){
	vector<int>por;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			if(i>=l1&&i<=l2&&j>=r1&&j<=r2){
				por.push_back(i*n+j);
			}
		}
	}
	return add_xor(por);
}

void construct_network(int H, int W, int K) {
	n=H;
	m=W;
	std::vector<int> Ns;
	int low=-1,high=W-1,mid,l1,r1,l2,r2;
	while(high-low>1){
		mid=(high+low)>>1;
		int x=porsor(0,H-1,low+1,mid);
		if(x==1){
			high=mid;
		}else{
			low=mid;
		}
	}
	l1=high;
	low=-1,high=H-1;
	while(high-low>1){
		mid=(high+low)>>1;
		int x=porsor(low+1,mid,0,W-1);
		if(x==1){
			high=mid;
		}else{
			low=mid;
		}
	}
	r1=high;

	low=-1,high=W-1;
	while(high-low>1){
		mid=(high+low)>>1;
		int x=porsxor(0,H-1,low+1,mid);
		if(l1<=mid&&l1>=low+1){
			x^=1;
		}
		if(x==1){
			high=mid;
		}else{
			low=mid;
		}
	}
	l2=high;
	low=-1,high=H-1;
	while(high-low>1){
		mid=(high+low)>>1;
		int x=porsxor(low+1,mid,0,W-1);
		if(r1<=mid&&r1>=low+1){
			x^=1;
		}
		if(x==1){
			high=mid;
		}else{
			low=mid;
		}
	}
	r2=high;
	if(abs(r2-r1)+abs(l1-l2)==K){
		int x=add_not(0);
		if(x==0){
			add_or({0});
		}
	}else{
		int x=add_not(0);
		if(x==1){
			add_or({0});
		}
	}
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 15
• Subtask 5: 0 / 12
• Subtask 6: 0 / 8
• Subtask 7: 0 / 14
• Subtask 8: 0 / 19