제출 #1154478

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1154478		Pacybwoah	Vision Program (IOI19_vision)	C++20	33 / 100	9 ms	1980 KiB

vision

#include "vision.h"
#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<cassert>
using namespace std;
// i * W + j
void construct_network(int h, int w, int k) {
	vector<int> ask;
	vector<pair<int, int>> poss;
	auto get = [&](int i, int j){
		return i * w + j;
	};
	for(int i = 0; i < h; i++){
		for(int j = 0; j < w; j++){
			for(int r = 0; r < h; r++){
				int left = k - abs(i - r);
				if(left < 0) continue;
				if(j - left >= 0){
					int a = get(i, j), b = get(r, j - left);
					if(a < b) poss.emplace_back(a, b);
				}
				if(j + left < w){
					int a = get(i, j), b = get(r, j + left);
					if(a < b) poss.emplace_back(a, b);
				}
			}
		}
	}
	sort(poss.begin(), poss.end());
	unique(poss.begin(), poss.end());
	int now;
	assert((int)poss.size() > 0);
	for(auto &[a, b]: poss){
		ask = {a, b};
		now = add_and(ask);
	}
	vector<int>().swap(ask);
	for(int i = h * w; i <= now; i++) ask.push_back(i);
	add_or(ask);
	return;
}
// g++ -std=c++17 -Wall -Wextra -Wshadow -fsanitize=undefined -fsanitize=address -o run grader.cpp vision.cpp

• Subtask 1: 10 / 10
• Subtask 2: 11 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 15
• Subtask 5: 12 / 12
• Subtask 6: 0 / 8
• Subtask 7: 0 / 14
• Subtask 8: 0 / 19