제출 #1071156

#제출 시각아이디문제언어결과실행 시간메모리
1071156Gromp15Vision Program (IOI19_vision)C++17
44 / 100
146 ms3020 KiB
#include "vision.h"
#include <bits/stdc++.h>
#define ll long long
#define ar array
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
using namespace std;
template<typename T> bool ckmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; }
template<typename T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }

void construct_network(int H, int W, int K) {
	vector<int> res;
	for (int i = 0; i < H; i++) {
		for (int j = 0; j < W; j++) {
			vector<int> cur;
			for (int k = 0; k < H; k++) {
				for (int l = 0; l < W; l++) {
					if (abs(k - i) + abs(j - l) == K) {
						cur.emplace_back(k*W+l);
					}
				}
			}
			if (cur.size()) {
				int idx = add_or(cur);
				res.emplace_back(add_and({i*W+j, idx}));
			}
		}
	}
	add_or(res);
}
#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...