제출 #1330143

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1330143		enzy	Vision Program (IOI19_vision)	C++20	12 / 100	1 ms	1216 KiB

vision

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

bool in(int x, int y, int H, int W){
	return 0<=x&&x<H&&0<=y&&y<W;
}

void construct_network(int H, int W, int K){
	vector<int>ret;
	for(int j=0;j<H*W;j++){
		int x=j/W, y=j%W;
		for(int i=-H;i<=H;i++){
			int nx=x+i, ny=y+(K-i);
			if(j<nx*W+ny&&in(nx,ny,H,W)) ret.push_back(add_and({j,nx*W+ny}));
			nx=x-i, ny=y+(K-i);
			if(j<nx*W+ny&&in(nx,ny,H,W)) ret.push_back(add_and({j,nx*W+ny}));
			nx=x+i, ny=y-(K-i);
			if(j<nx*W+ny&&in(nx,ny,H,W)) ret.push_back(add_and({j,nx*W+ny}));
			nx=x-i, ny=y-(K-i);
			if(j<nx*W+ny&&in(nx,ny,H,W)) ret.push_back(add_and({j,nx*W+ny}));
		}
	}
	int ult=add_or(ret);
}

• 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