제출 #615874

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
615874		amunduzbaev	Vision Program (IOI19_vision)	C++17	8 / 100	1 ms	468 KiB

vision

#include "bits/stdc++.h"
using namespace std;
#include "vision.h"

#ifndef EVAL
#include "grader.cpp"
#endif

#define ar array

void construct_network(int n, int m, int k) {
	
	
	vector<ar<int, 2>> d;
	for(int i=0;i<=k;i++){
		d.push_back({-i, k-i});
		d.push_back({-i, i-k});
		d.push_back({i, k-i});
		d.push_back({i, i-k});
	}
	
	sort(d.begin(), d.end());
	d.erase(unique(d.begin(), d.end()), d.end());
	
	vector<vector<int>> used(n, vector<int>(m));
	vector<int> tot;
	for(int i=0;i<1;i++){
		for(int j=0;j<1;j++){
			used[i][j] = 1;
			vector<int> t;
			for(auto c : d){
				int x = i + c[0], y = j + c[1];
				if(0 <= x && x < n && 0 <= y && y < m && !used[x][y]){
					t.push_back(x * m + y);
				}
			}
			
			if(t.empty()) continue;
			int k = add_or(t);
			k = add_and({i * m + j, k});
			tot.push_back(k);
		}
	}
	
	//~ assert(!tot.empty());
	//~ add_or(tot);
}

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