Submission #422158

#TimeUsernameProblemLanguageResultExecution timeMemory
422158Dan4LifeVision Program (IOI19_vision)C++17
44 / 100
491 ms37472 KiB
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
void construct_network(int H, int W, int K) {
	set<pair<int,int> > S; S.clear();
	vector<int> v; v.clear();
	for(int i = 0; i < H; i++)
	{
		for(int j = 0; j < W; j++)
		{
			vector<int> w; w.clear();
			for(int k = i; k < H; k++)
			{
				for(int l = 0; l < W; l++)
				{
					if(abs(i-k)+abs(j-l)!=K or S.count({i*W+j, k*W+l})) continue;
					S.insert({i*W+j, k*W+l}), S.insert({k*W+l, i*W+j});
					w.push_back(k*W+l);
				}
			}
			if(w.empty())continue;
			int x = add_xor(w);
			vector<int> t; t.clear(); t.push_back(x), t.push_back(i*W+j);
			v.push_back(add_and(t));
		}
	}
	add_or(v);
}
#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...