제출 #954841

#제출 시각아이디문제언어결과실행 시간메모리
954841Trisanu_DasVision Program (IOI19_vision)C++17
52 / 100
4 ms604 KiB
#include "vision.h"
#include "bits/stdc++.h"
using namespace std;
int row , col;
pair<int ,int>cmp , comp;
vector<int>num , opt , erg;
pair<int , int> transf(int x){
	return {x % col , x / col};
}
void construct_network(int H, int W , int K) {
	row = H;
	col = W;
	int menge = row * col , pl = menge;
 	for(int i = 0 ; i < menge ; i++){
		cmp = transf(i);
		for(int j = i + 1 ; j < menge ; j++){
			comp = transf(j);
			if(abs(cmp.first - comp.first) + abs(cmp.second - comp.second) == K) opt.push_back(j);
		}
		if(opt.size()){
			add_or(opt);
			pl++;
			add_and({i , pl - 1});
			num.push_back(pl);
			pl++;
		}
		opt.clear();
		if(menge > 900) break;
	}
	add_or(num);
}
#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...