제출 #322065

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
322065		zaneyu	Vision Program (IOI19_vision)	C++14	0 / 100	1080 ms	25448 KiB

vision

/*input
200 200 199
0 0 199 198
-1
*/
#include "vision.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld double
#define pii pair<int,int>
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=1e6+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=(1e9+7);
const ll MOD2=1000002173;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
ll mult(ll a,ll b){
    return ((a%MOD)*(b%MOD))%MOD;
}
ll mypow(ll a,ll b,ll MOD){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
int h,w;
bool isin(int a,int b){
	if(a<0 or a>=h or b<0 or b>=w) return false;
	return true;
}
int dx[4]={1,-1,-1,1};
int dy[4]={1,1,-1,-1};
int to(int x,int y){
	return x*w+y;
}
vector<int> at[maxn];
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void construct_network(int H,int W, int k) {
	h=H,w=W;
	set<pii> v;
	map<pii,bool> vis;
	bool ok=0;
	while(!ok){
		int i=rng()%h,j=rng()%w;
		while(vis[{i,j}]) i=rng()%h,j=rng()%w;
		vis[{i,j}]=1;
		REP(z,k+1){
			REP(d,4){
				int a=i+z*dx[d],b=j+(k-z)*dy[d];
				if(isin(a,b)){
					//cout<<i<<' '<<j<<' '<<a<<' '<<b<<'\n';
					if(to(a,b)>to(i,j)){
						v.insert({to(i,j),to(a,b)});
						if(sz(v)==10000){
							z=k+1;
							ok=1;
							break;
						}
					}
					else{
						v.insert({to(a,b),to(i,j)});
						if(sz(v)==10000){
							z=k+1;
							ok=1;
							break;
						}
					}
				}
			}
		}
		
	}
	vector<int> qs;
	for(auto x:v){
		at[x.f].pb(x.s);
	}
	REP(i,h){
		REP(j,w){
			vector<int> ns=at[to(i,j)];
			if(!sz(ns)) continue;
			qs.pb(add_and({add_or(ns),to(i,j)}));
		}
	}
	add_or(qs);
}

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