제출 #1219533

#제출 시각아이디문제언어결과실행 시간메모리
1219533Theo830Vision Program (IOI19_vision)C++17
0 / 100
1 ms964 KiB
#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;
	ll l = H * W;
	f(i,0,n){
		f(j,0,m){
			f(u,0,K+1){
				ll x = i + u;
				ll y = j + K - u;
				if(x < n && y < m){
					vector<int>a;
					a.pb(box(i,j));
					a.pb(box(x,y));
					add_and(a);
				}
				y = j - (K-u);
				if(x < n && y >= 0){
					vector<int>a;
					a.pb(box(i,j));
					a.pb(box(x,y));
					add_and(a);
					l++;
				}
			}
		}
	}
	vector<int>a;
	f(i,H*W,l){
		a.pb(i);
	}
	add_or(a);
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...