Submission #1206670

#	Time	Username	Problem	Language	Result	Execution time	Memory
1206670		thelegendary08	Sky Walking (IOI19_walk)	C++17	10 / 100	4097 ms	46772 KiB

walk

#include "walk.h"
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define mp make_pair
#define f0r(i,n) for(int i = 0; i<n; i++)
#define FOR(i, k, n) for(int i =k; i<n; i++)
#define vi vector<int>
#define pii pair<int,int>
#define vvi vector<vector<int>>
#define vb vector<bool>
#define vpii vector<pii>
#define mii map<int,int>
#define dout(x) cout<<x<<' '<<#x<<endl;
#define vout(x) for(auto u : x)cout<<u<<' '; cout<<endl;
#define out(x) cout<<x<<endl;
#define out2(x,y) cout<<x<<' '<<y<<endl;
using namespace std;
const int mxn = 1e5 + 5;
vector<vpii>adj(mxn * 15);
int min_distance(vector<signed> x, vector<signed> h, vector<signed> l, vector<signed> r, vector<signed> y, signed s, signed g) {
	//encode a position as h * n + i
	int n = x.size();
	int m = l.size();
	
	vvi pts(m);
	vector<pair<int,pair<pii,int>>>edges;
	f0r(i,m){
		edges.pb(mp(y[i], mp(mp(l[i], r[i]),i)));
	}
	sort(edges.rbegin(), edges.rend());
	set<int>active;
	vector<pair<int, pii>> nodes;
	f0r(i,n){
		nodes.pb(mp(h[i], mp(x[i], i)));
	}
	sort(nodes.rbegin(), nodes.rend());
	int p1 = 0;
	int p2 = 0;
	while(p1 < m){
		if(p2 == n){
			auto it = lower_bound(active.begin(), active.end(), edges[p1].second.first.first);
			int d = edges[p1].second.second;
			while(it != active.end() && *it <= edges[p1].second.first.second){
				pts[d].pb(*it);
				it++;
			}
			p1++;
		}
		else{
			if(edges[p1].first > nodes[p2].first){
				//compute edge
				auto it = lower_bound(active.begin(), active.end(), edges[p1].second.first.first);
				int d = edges[p1].second.second;
				while(it != active.end() && *it <= edges[p1].second.first.second){
					pts[d].pb(*it);
					it++;
				}
				p1++;
			}
			else{
				active.insert(nodes[p2].second.second);
				p2++;
			}
		}
	}
	f0r(i,m){
		sort(pts[i].begin(), pts[i].end());
	}
	
	
	
	vector<vpii> ints(n);
	int cnt = n;
	f0r(i,m){
		for(int k = 0; k<pts[i].size(); k++){
			int j = pts[i][k];
			ints[j].pb(mp(y[i], cnt));
			cnt++;
			if(k > 0){
				int j = pts[i][k-1];
				int j2 = pts[i][k];
				adj[cnt-1].pb(mp(cnt-2, x[j2] - x[j]));
				adj[cnt-2].pb(mp(cnt-1, x[j2] - x[j]));
			}
		}
		/*
		for(int k = 0; k<pts[i].size()-1; k++){
			int j = pts[i][k];
			int j2 = pts[i][k+1];
			adj[y[i] * n + j].pb(mp(y[i] * n + j2, x[j2] - x[j]));
			adj[y[i] * n + j2].pb(mp(y[i] * n + j, x[j2] - x[j]));
		}
		*/
	}
	f0r(i,n){
		ints[i].pb(mp(0, i));
	}
	f0r(i,n){
		sort(ints[i].begin(), ints[i].end());
	}
	f0r(i,n){
		f0r(j, ints[i].size() - 1){
			int h1 = ints[i][j].first;
			int h2 = ints[i][j+1].first;
			adj[ints[i][j].second].pb(mp(ints[i][j+1].second, h2-h1));
			adj[ints[i][j+1].second].pb(mp(ints[i][j].second, h2-h1));
		}
	}
	
	mii dist;
	dist[s] = 0;
	priority_queue<pii>q;
	q.push(mp(0,s));
	while(!q.empty()){
		int node = q.top().second;
		q.pop();
		for(auto u : adj[node]){
			int b = u.first;
			int w = u.second;
			if(!dist.count(b) || dist[b] > dist[node] + w){
				dist[b] = dist[node] + w;
				q.push(mp(-dist[b], b));
			}
		}
	}
	/*
	out(dist[n + 1]);
	out(dist[6 * n + 1]);
	out(dist[6 * n + 2]);
	out(dist[7*n+2]);
	out(dist[7*n+6]);
	out(dist[5*n+6]);
	out(dist[5*n+5]);
	*/
	if(!dist.count(g))return -1;
	else return dist[g];
	
	
	return 1;
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 14
• Subtask 3: 0 / 15
• Subtask 4: 0 / 18
• Subtask 5: 0 / 43