Submission #1058059

#TimeUsernameProblemLanguageResultExecution timeMemory
1058059UnforgettableplVision Program (IOI19_vision)C++17
44 / 100
116 ms2352 KiB
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

void construct_network(int H, int W, int K) {
	vector<int> cultprits;
	int lig = H*W;
	for(int i=0;i<H;i++) {
		for(int j=0;j<W;j++) {
			vector<int> subcurprits;
			for(int k=i;k<H;k++) {
				for(int l=(k==i?j:0);l<W;l++) {
					if(abs(i-k)+abs(j-l)!=K)continue;
					subcurprits.emplace_back(k*W+l);
				}
			}
			if(subcurprits.empty())continue;
			add_or(subcurprits);
			add_and({i*W+j,lig++});
			cultprits.emplace_back(lig++);
		}
	}
	add_or(cultprits);
}
#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...