Submission #955066

#	Time	Username	Problem	Language	Result	Execution time	Memory
955066		8pete8	Vision Program (IOI19_vision)	C++17	32 / 100	3 ms	860 KiB

vision

#include "vision.h"
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include <cassert>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric> //gcd(a,b)
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-loops")
using namespace std;
void construct_network(int h, int w, int k){
	vector<int>ans;
	auto valid=[&](int a,int b){
		if(a<0||b<0||a>=h||b>=w)return false;
		return true;
	};
	auto get=[&](int a,int b){return a*w+b;};
	auto dist=[&](int a,int b,int x,int y){return abs(a-x)+abs(b-y);};
	auto getdiag=[&](int a,int b,int x,int y,vector<int>&v,int mode){
		while(dist(a,b,x,y)==k){
			if(valid(a,b))v.pb(get(a,b));
			if(mode)a--,b--;
			else a++,b--;
		}
	};
	for(int i=0;i<30;i++)for(int j=0;j<30;j++){
		if(!valid(i,j))continue;;
		vector<int>v;
		getdiag(i+k,j,i,j,v,1);
		getdiag(i-k,j,i,j,v,0);
		if(!v.empty()){
			int x=add_or(v);
			ans.pb(add_and({get(i,j),x}));
		}
	}
	add_or(ans);
	return;
}/*
int32_t main(){
	int a,b,k;cin>>a>>b>>k;
	construct_network(a,b,k);
}*/

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