Submission #612724

#TimeUsernameProblemLanguageResultExecution timeMemory
612724moreteVision Program (IOI19_vision)C++17
0 / 100
150 ms1832 KiB
#include<bits/stdc++.h>
using namespace std;
#include "vision.h"

int f(int i, int j, int W){
	return i*W + j;
}

void construct_network(int H, int W, int K) {
	int cap = 1; int last = 0;
	vector<int> final;
	for(int i = 0; i < H && cap < 10000; i++){
		for(int j = 0; j < W && cap < 10000; j++){
			vector<int> v;
			for(int k = 0; k < H && cap < 10000; k++){
				for(int l = 0; l < W && cap < 10000; l++){
					if(abs(i - k) + abs(j - l) == K){
						v.push_back(f(k, l, W));
					}
				}
			}

			last = add_or(v);
			final.push_back(add_and({f(i, j, W), last}));

		}
	}

	add_or(final);
}
#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...