제출 #1195267

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

vision

#include "vision.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
using namespace std;
int h, w, k;


int ctn(pair<int,int> coords) {
	return coords.ff + h * coords.ss;
}


bool isoob(pair<int,int> coords) {
	if (coords.ff < 0 || coords.ss < 0 || coords.ff >= w || coords.ss >= h) {
		return true;
	}
	return false;
}


void construct_network(int H, int W, int K) {
	h = H; w = W; k = K;
	pair<int,int> curpixel;
	vector<int> Ns, finalNs;
	int insnum = 0;
	for (int i=0;i<w;i++) {
		for (int j=0;j<h;j++) {
			curpixel.ff = i; curpixel.ss = j;
			Ns.clear();
			

			if (!isoob(mp(curpixel.ff, curpixel.ss - k))) {Ns.pb(ctn(mp(curpixel.ff, curpixel.ss - k)));}
			if (!isoob(mp(curpixel.ff, curpixel.ss + k))) {Ns.pb(ctn(mp(curpixel.ff, curpixel.ss + k)));}
			if (!isoob(mp(curpixel.ff - k, curpixel.ss))) {Ns.pb(ctn(mp(curpixel.ff - k, curpixel.ss)));}
			if (!isoob(mp(curpixel.ff + k, curpixel.ss))) {Ns.pb(ctn(mp(curpixel.ff + k, curpixel.ss)));}
			for (int i=1;i<k-1;i++) {
				if (!isoob(mp(curpixel.ff - i, curpixel.ss - k + i))) {Ns.pb(ctn(mp(curpixel.ff - i, curpixel.ss - k + i)));}
				if (!isoob(mp(curpixel.ff + i, curpixel.ss - k + i))) {Ns.pb(ctn(mp(curpixel.ff + i, curpixel.ss - k + i)));}
				if (!isoob(mp(curpixel.ff - i, curpixel.ss + k - i))) {Ns.pb(ctn(mp(curpixel.ff - i, curpixel.ss + k - i)));}
				if (!isoob(mp(curpixel.ff + i, curpixel.ss + k - i))) {Ns.pb(ctn(mp(curpixel.ff + i, curpixel.ss + k - i)));}
			}
			if (Ns.size() == 0) continue;
			insnum = add_or(Ns);
			Ns.clear(); Ns.pb(ctn(curpixel));
			add_or(Ns);


			Ns.clear();
			Ns.pb(insnum); 
			Ns.pb(insnum + 1);
			finalNs.pb(add_and(Ns));
		}
	}


	if (finalNs.size() == 0) {
		finalNs.pb(0); finalNs.pb(1); finalNs.pb(2);
		add_and(finalNs);
	} else {
		add_or(finalNs);
	}
}

• 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