Submission #602766

#TimeUsernameProblemLanguageResultExecution timeMemory
602766misteg168Vision Program (IOI19_vision)C++17
0 / 100
1 ms976 KiB
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int dist(ll a, ll b,int W){
	return abs(a%W-b%W) + abs(a/W-b/W);
}

void construct_network(int H, int W, int K) {
	vector<int> Ns;
	ll it = 0;
	for(int i = 0; i < W*H; i++){
		if(add_not(i)) continue;
		for(int j = 0; j < W*H; j++){
			if(dist(i, j, W) == K) add_and({i, j}), it++;
		}
	}
	for(int i = H*W; i < H*W+it; i++) Ns.push_back(i);
	add_or(Ns);
	
}
#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...