Submission #592510

#TimeUsernameProblemLanguageResultExecution timeMemory
592510LucppVision Program (IOI19_vision)C++17
52 / 100
5 ms596 KiB
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

void construct_network(int H, int W, int K) {
	vector<int> todo;
	for(int i = 0; i < H; i++){
		for(int j = 0; j < W; j++){
			vector<int> v;
			for(int a = 0; a < H; a++){
				for(int b = 0; b < W; b++){
					if(abs(a-i)+abs(b-j) == K) v.push_back(a*W+b);
				}
			}
			if(v.empty()) continue;
			int x = add_or(v);
			int y = add_and({x, i*W+j});
			todo.push_back(y);
			if(H > 1 && W > 1 && (H > 30 || W > 30)) break;
		}
		if(H > 1 && W > 1 && (H > 30 || W > 30)) break;
	}
	add_or(todo);
}
#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...