제출 #502523

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
502523		PoPularPlusPlus	Vision Program (IOI19_vision)	C++17	33 / 100	2 ms	1096 KiB

vision

#include <bits/stdc++.h>
#include "vision.h"
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

void construct_network(int n , int m , int k){
	vector<int> v;
	int cur = n * m;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			for(int a = 0; a <= k; a++){
				if(a + i < n && j + k - a < m){
					v.pb(cur);
					vector<int> tp = {i * m + j , ((i + a) * m) + j + k - a};
					add_and(tp);
					cur++;
				}
				if(a + i < n && j - k + a >= 0){
					v.pb(cur);
					vector<int> tp = {i * m + j , ((i + a) * m) + j - k + a};
					add_and(tp);
					cur++;
				}
				if(-a + i >= 0 && j + k - a < m){
					v.pb(cur);
					vector<int> tp = {i * m + j , ((i - a) * m) + j + k - a};
					add_and(tp);
					cur++;
				}
			}
		}
	}
	add_or(v);
}

/*

void solve(){
	
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
//freopen("dec.in", "r", stdin);
//freopen("dec.out", "w", stdout);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}
*/

• 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