제출 #1206691

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

vision

#include "vision.h"
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define f0r(i,n) for(int i = 0; i<n; i++)
#define FOR(i, k, n) for(int i =k; i<n; i++)
#define vi vector<int>
#define pii pair<int,int>
#define vvi vector<vector<int>>
#define vb vector<bool>
#define vpii vector<pii>
#define mii map<int,int>
#define dout(x) cout<<x<<' '<<#x<<endl;
#define vout(x) for(auto u : x)cout<<u<<' '; cout<<endl;
#define out(x) cout<<x<<endl;
#define out2(x,y) cout<<x<<' '<<y<<endl;
using namespace std;

void construct_network(int H, int W, int K) {
	vi dexes;
	f0r(i, H){
		f0r(j, W){
			f0r(k, H){
				f0r(l, W){
					if(abs(i - k) + abs(j - l) == K && i * W + j < k * W + l){
						vi quer;
						quer.pb(i*W+j);
						quer.pb(k*W+l);
						int a = add_and(quer);
						dexes.pb(a);
					}
				}
			}
		}
	}
	add_or(dexes);
	/*
	std::vector<int> Ns;
	Ns = {0, 1};
	int a = add_and(Ns);
	Ns = {0, a};
	int b = add_or(Ns);
	Ns = {0, 1, b};
	int c = add_xor(Ns);
	add_not(c);
	*/
}

• 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