Submission #1026106

#	Time	Username	Problem	Language	Result	Execution time	Memory
1026106		HD1	Vision Program (IOI19_vision)	C++14	44 / 100	142 ms	2896 KiB

vision

#include "vision.h"
#include<bits/stdc++.h>
#define sz(x) ll(x.size())
#define all(x) x.begin(),x.end()
#define pb push_back
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
const ll MAX=1e6;
//ii mobs[10]={{1,1},{-1,-1},{1,-1},{-1,1},{0,1},{1,0},{-1, 0},{0, -1}};
int n, m, k;
int dist(int a, int b, int i, int j){
	return abs(a-i)+abs(b-j);
}
vector<int>s, p, q;
void look(int a, int b){
	for(int i=0; i<n; i++){
		for(int j=0; j<m; j++){
			if(dist(a,b,i,j)==k){
				q.pb(i*m+j);
			}
		}
	}
	if(sz(q)<=0) return;
	p.pb(add_or(q));
	p.pb(a*m+b);
	s.pb(add_and(p));
	//1cout<<sz(s)<<' '<<sz(p)<<' '<<sz(q)<<'\n';
	p.clear();
	q.clear();
	return;
}
void construct_network(int H, int W, int K){
	n=H;
	m=W;
	k=K;
	for(int i=0; i<H; i++){
		for(int j=0; j<W; j++){
			look(i,j);
		}
	}
	add_or(s);
	return;
}

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