Submission #1233780

#TimeUsernameProblemLanguageResultExecution timeMemory
1233780gry3125Vision Program (IOI19_vision)C++20
0 / 100
71 ms960 KiB
#include "vision.h"

using namespace std;

void construct_network(int h, int w, int k) {
	int insfi = 1000000000, insla = 0;
	for (int i = 0; i < h; i++) {
		for (int j = 0; j < w; j++) {
			for (int i2 = 0; i2 < h; i2++) {
				for (int j2 = 0; j2 < w; j2++) {
					if (abs(i-i2)+abs(j-j2) == k) {
						int val = add_and({i*w+j, i2*w+j});
						insfi = min(val, insfi);
						insla = max(val, insla);
					}
				}
			}
		}
	}
	vector<int> a;
	for (int i = insfi; i <= insla; i++) {
		a.push_back(i);
	}
	int val = add_or(a);
}
#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...