Submission #403655

#	Time	Username	Problem	Language	Result	Execution time	Memory
403655		errorgorn	레이저 센서 (KOI16_laser)	C++17	0 / 100	82 ms	1268 KiB

laser

//雪花飄飄北風嘯嘯
//天地一片蒼茫

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl

#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

int n;
ii arr[1005];
ii brr[2005];

const int s=420,t=421;
const int BUF=105;

int cost[425][425];
int cap[425][425];

int dist(int i,int j){
	return abs(arr[i].fi-brr[j].fi)+abs(arr[i].se-brr[j].se);
}

ll w[425];
int p[425];
bool inq[425];
queue<int> q;

void SPFA(int i,int j){
	memset(w,63,sizeof(w));
	w[i]=0;
	
	inq[i]=true,q.push(i);
	
	while (!q.empty()){
		int node=q.front();
		q.pop();
		inq[node]=false;
		
		rep(x,0,425) if (cap[node][x]>0 && w[x]>w[node]+cost[node][x]){
			w[x]=w[node]+cost[node][x];
			p[x]=node;
			
			if (!inq[x]){
				inq[x]=true,q.push(x);
			}
		}
	}
}

vector<int> ans[105];

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	
	cin>>n;
	rep(x,0,n) cin>>arr[x].fi>>arr[x].se;
	rep(x,0,2*n) cin>>brr[x].fi>>brr[x].se;
	
	rep(x,0,n){
		rep(y,0,2*n){
			cost[x][y+2*BUF]=cost[x+BUF][y+2*BUF]=dist(x,y);
			cost[y+2*BUF][x]=cost[y+2*BUF][x+BUF]=-dist(x,y);
			
			cap[x][y+2*BUF]=cap[x+BUF][y+2*BUF]=1;
		}
	}
	
	rep(x,0,n) cap[s][x]=cap[s][x+BUF]=1;
	rep(y,0,2*n) cap[y+2*BUF][t]=1;
	
	while (true){
		SPFA(s,t);
		
		//cout<<w[t]<<endl;
		if (w[t]>1e12) break;
		
		vector<int> v={t};
		
		while (v.back()!=s){
			v.pub(p[v.back()]);
		}
		
		reverse(all(v));
		
		//the cap is definitely 1
		rep(x,0,sz(v)-1){
			cap[v[x]][v[x+1]]--;
			cap[v[x+1]][v[x]]++;
		}
	}
	
	rep(x,0,n){
		rep(y,0,2*n){
			if (cap[x][y+2*BUF]==0) ans[x].pub(y);
			if (cap[x+BUF][y+2*BUF]==0) ans[x].pub(y);
		}
	}
	
	rep(x,0,n){
		cout<<ans[x][0]+1<<" "<<ans[x][1]+1<<endl;
	}
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 19
• Subtask 3: 0 / 33
• Subtask 4: 0 / 34