Submission #1216787

#TimeUsernameProblemLanguageResultExecution timeMemory
1216787loiiii12358Vision Program (IOI19_vision)C++20
8 / 100
0 ms328 KiB
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

void construct_network(int H, int W, int K) {
	int tmp;
	vector<int> vec,ans;
	for(int i=0;i<1;i++){
		for(int j=0;j<1;j++){
			vec.clear();
			for(int k=max(0,i-K);k<min(H,i+K+1);k++){
				tmp=K-abs(k-i);
				if(j-tmp>=0){
					vec.push_back(k*W+j-tmp);
				}
				if(j+tmp<W){
					vec.push_back(k*W+j+tmp);
				}
			}
			if(!vec.empty()){
				tmp=add_or(vec);
				vec={tmp,i*W+j};
				ans.push_back(add_and(vec));
			}
		}
	}
	add_or(ans);
	// cout << 20000*16
}
#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...