제출 #1219559

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

vision

#include "vision.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i,a,b) for(ll i = a;i < b;i++)
#define ii pair<ll,ll>
#define F first
#define S second
#define pb push_back
int n,m;
int box(int i,int j){
	return i * m + j;
}
void construct_network(int H, int W, int K) {
	n = H;
	m = W;
	vector<ll>ex;
	vector<int>a;
	f(i,0,n){
		a.clear();	
		f(j,0,m){
			a.pb(box(i,j));
		}
		if(i){
			a.pb(ex.back());
		}
		ex.pb(add_xor(a));
	}
	f(j,0,m){	
		a.clear();
		f(i,0,n){
			a.pb(box(i,j));
		}
		if(j){
			a.pb(ex.back());
		}
		ex.pb(add_xor(a));
	}
	vector<int>v;
	v.pb(ex.back());
	ll zero = add_or(v);
	vector<ll>num;
	f(k,0,10){
		v.clear();
		v.pb(zero);
		num.pb(add_or(v));
	}
	for(auto x:ex){
		num.back() = x;
		f(i,0,9){
			v.clear();
			v.pb(num[i]);
			v.pb(num.back());
			ll neo = add_xor(v);
			num.back() = add_and(v);
			num[i] = neo;
		}
	}
	ll ans = add_not(zero);
	f(i,0,9){
		if(K & (1<<i)){
			v.clear();
			v.pb(ans);
			v.pb(num[i]);
			ans = add_and(v);
		}
		else{
			ll res = add_not(num[i]);
			v.clear();
			v.pb(ans);
			v.pb(res);
			ans = add_and(v);
		}
	}
}

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