Submission #1351873

#TimeUsernameProblemLanguageResultExecution timeMemory
1351873vahagngVision Program (IOI19_vision)C++20
33 / 100
1101 ms266044 KiB
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

void construct_network(int H, int W, int K) {
	vector<int>res;
	set<pair<int, int>> used;
	for (int i = 0; i < H; i++) {
		for (int j = 0; j < W; j++) {
			for (int z = 0; z < H; z++) {
				for (int k = 0; k < W; k++) {
					if (used.count({ i * W + j, z * W + k })) continue;
					used.insert({ i * W + j, z * W + k });
					used.insert({ z * W + k, i * W + j });
					if (abs(i - z) + abs(k - j) == K) {
						res.push_back(add_and({ i * W + j, z * W + k }));
					}
				}
			}
		}
	}
	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...