제출 #229928

#제출 시각아이디문제언어결과실행 시간메모리
229928someone_aaVision Program (IOI19_vision)C++17
33 / 100
131 ms1148 KiB
#include "vision.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
using namespace std;

void construct_network(int H, int W, int K) {
	int index = H*W;
	vector<int>inds;
	for(int i=0;i<H;i++) {
		for(int j=0;j<W;j++) {
			for(int i2=0;i2<H;i2++) {
				for(int j2=0;j2<W;j2++) {
					if((i == i2 && j == j2) || (abs(i-i2)+ abs(j-j2) != K)) continue;
					//cout<<"Comparing "<<i<<", "<<j<<" with "<<i2<<", "<<j2<<endl;
					inds.pb(index);
					add_and({i*W+j, i2*W+j2});
					index++;
				}
			}
		}
	}

	add_or(inds);
	return;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...