제출 #429330

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
429330		Pbezz	Vision Program (IOI19_vision)	C++14	12 / 100	2 ms	1096 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
typedef pair<ll,ll>pii;

const ll MAXN = 9500;
const ll INF = 1e9+7;

void construct_network(int H, int W, int K){
vector<int>Ns,fina;
	int d,x,y,a,i,cur,cur1;

	if(H==1){
 
	for(i=0;i+K<W;i++){
	Ns = {i,i+K};
	d = add_and(Ns);
	fina.pb(d);
	}
 
	add_or(fina);
 return;
	}else if(W==1){
 
	for(i=0;i+K<H;i++){
	Ns = {i,i+K};
	d = add_and(Ns);
	fina.pb(d);
	}
 
	add_or(fina);
 return;
}
 
	for(x=0;x<H;x++){
	for(y=0;y<W;y++){
	cur = x*W + y;
	for(i=0;i<=K;i++){
 	a = K-i+x;
	if(i+y>=W||a>=H)continue;


	cur1 = a*W + i+y;
 
	Ns = {cur,cur1};
	d = add_and(Ns);
	fina.pb(d);
 
	if(y-i<0||a>=H)continue;

	cur1 = a*W + y-i;

	Ns = {cur,cur1};
	d = add_and(Ns);
	fina.pb(d);

}

	}
}


 
	add_or(fina);
 
 

}

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