oj.uz

답안 #1071529

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1071529 2024-08-23T08:21:47 Z LittleOrange Sky Walking (IOI19_walk) C++17
10 / 100
 1349 ms 154196 KB 
#include "walk.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll big = 1e18;
const ll lim = 1e9;
struct pos{
	ll x,y;
	bool operator<(const pos &o) const{
		return x!=o.x?x<o.x:y<o.y;
	}
	bool operator==(const pos &o) const{
		return x==o.x&&y==o.y;
	}
	bool operator!=(const pos &o) const{
		return x!=o.x||y!=o.y;
	}
};
struct line{
	ll i,v;
	bool operator<(const line &o) const{
		return v>o.v;
	}
};
struct obj{
	ll l,r,y;
	bool operator<(const obj &o) const{
		return l<o.l;
	}
};
struct nod{
	ll l,r,lv,rv;
	nod operator+(const nod &o) const{
		return {l,o.r,min(lv,o.lv+o.l-l),min(rv+o.r-r,o.rv)};
	}
};
struct segtree{
	ll n;
	vector<nod> a;
	vector<ll> xs;
	segtree(const vector<ll> &XS):n(XS.size()),a(XS.size()*4),xs(XS){
		//cerr << "size=" << n << "\n";
		init(1,0,n-1);
	}
	void init(ll i, ll l, ll r){
		if (l==r) a[i] = {xs[l],xs[l],big,big};
		else{
			ll m = l+r>>1;
			init(i<<1,l,m);
			init(i<<1|1,m+1,r);
			a[i] = a[i<<1]+a[i<<1|1];
		}
	}
	void mod(ll i, ll l, ll r, ll x, ll v){
		if (l==r) a[i].lv = a[i].rv = v;
		else{
			ll m = l+r>>1;
			if (x<=m) mod(i<<1,l,m,x,v);
			else mod(i<<1|1,m+1,r,x,v);
			a[i] = a[i<<1]+a[i<<1|1];
		}
	}
	void mod(ll x, ll v){
		ll idx = lower_bound(xs.begin(),xs.end(),x)-xs.begin();
		mod(1,0,n-1,idx,v);
	}
	nod get(ll i, ll l, ll r, ll ql, ll qr){
		if (ql<=l&&r<=qr) return a[i];
		else{
			ll m = l+r>>1;
			if(qr<=m) return get(i<<1,l,m,ql,qr);
			else if(ql>m) return get(i<<1|1,m+1,r,ql,qr);
			else return get(i<<1,l,m,ql,qr)+get(i<<1|1,m+1,r,ql,qr);
		}
	}
	ll qry(ll x){
		ll idx = lower_bound(xs.begin(),xs.end(),x)-xs.begin();
		return min(get(1,0,n-1,0,idx).rv,get(1,0,n-1,idx,n-1).lv);
	}
};
long long min_distance(std::vector<int> x, std::vector<int> h, std::vector<int> l, std::vector<int> r, std::vector<int> y, int s, int g) {
	ll n = x.size();
	ll m = y.size();
	if (s==0&&g==n-1){
		//cerr << "special fork\n";
		deque<obj> bs;
		for(ll i = 0;i<m;i++){
			bs.push_back({x[l[i]],x[r[i]],y[i]});
		}
		sort(bs.begin(),bs.end());
		//cerr << "cp1\n";
		vector<ll> ys(1,0);
		for(ll i = 0;i<n;i++) ys.push_back(h[i]);
		for(ll i = 0;i<m;i++) ys.push_back(y[i]);
		//cerr << "cp2\n";
		sort(ys.begin(),ys.end());
		ys.erase(unique(ys.begin(),ys.end()),ys.end());
		//cerr << "cp3\n";
		//cerr << ys.size() << "\n";
		segtree t(ys);
		//cerr << "cp4\n";
		t.mod(0,0);
		deque<pair<ll,ll>> exp;
		//cerr << "cp5\n";
		exp.push_back({x[0],0});
		ll ans = big;
		//cerr << "cp6\n";
		for(ll i : x){
			vector<pair<ll,ll>> upd;
			while(bs.size()&&bs.front().l<=i){
				obj o = bs.front();bs.pop_front();
				ll val = t.qry(o.y);
				upd.push_back({o.y,val});
				exp.push_back({o.r,o.y});
			}
			if (i==x.back()){
				ll ans = t.qry(0)+x.back()-x.front();
				if (ans>=big) ans = -1;
				return ans;
			}
			while(exp.size()&&exp.front().first<=i){
				auto o = exp.front();exp.pop_front();
				t.mod(o.second,big);
			}
			for(auto o : upd){
				t.mod(o.first,o.second);
			}
		}
	}
	vector<pos> ps;
	for(ll i = 0;i<n;i++) ps.push_back({x[i],0});
	{
		vector<pair<ll,ll>> builds,bridges;
		for(ll i = 0;i<n;i++) builds.push_back({h[i],i});
		for(ll i = 0;i<m;i++) bridges.push_back({y[i],i});
		sort(builds.begin(),builds.end());
		sort(bridges.rbegin(),bridges.rend());
		set<ll> s;
		for(auto [yy,i] : bridges){
			while(builds.size()&&(builds.back().first)>=yy){
				s.insert(builds.back().second);
				////cerr << "add build " << builds.back().second << "\n";
				builds.pop_back();
			}
			for(auto it = s.lower_bound(l[i]);it!=s.end()&&(*it)<=r[i];it++){
				////cerr << "add " << x[*it] << ", " << y[i] << "\n";
				ps.push_back({x[*it],y[i]});
			}
		}
	}
	/*for(ll i = 0;i<m;i++){
		for(ll j = l[i];j<=r[i];j++){
			if (h[j]>=y[i]){
				ps.push_back({x[j],y[i]});
			}
		}
	}*/
	sort(ps.begin(),ps.end());
	ps.erase(unique(ps.begin(),ps.end()),ps.end());
	auto gp = [&](pos p){
		return lower_bound(ps.begin(),ps.end(),p)-ps.begin();
	};
	ll c = ps.size();
	vector<vector<line>> con(c);
	for(ll i = 1;i<c;i++){
		if (ps[i-1].x==ps[i].x){
			ll d = ps[i].y-ps[i-1].y;
			con[i-1].push_back({i,d});
			con[i].push_back({i-1,d});
		}
	}
	{
		vector<pair<ll,ll>> builds,bridges;
		for(ll i = 0;i<n;i++) builds.push_back({h[i],i});
		for(ll i = 0;i<m;i++) bridges.push_back({y[i],i});
		sort(builds.begin(),builds.end());
		sort(bridges.rbegin(),bridges.rend());
		set<ll> s;
		for(auto [yy,i] : bridges){
			vector<ll> v;
			while(builds.size()&&(builds.back().first)>=yy){
				s.insert(builds.back().second);
				////cerr << "add build " << builds.back().second << "\n";
				builds.pop_back();
			}
			for(auto it = s.lower_bound(l[i]);it!=s.end()&&(*it)<=r[i];it++){
				////cerr << "add " << x[*it] << ", " << y[i] << "\n";
				v.push_back(gp({x[*it],y[i]}));
			}
			for(ll j = 1;j<v.size();j++){
				ll d = ps[v[j]].x-ps[v[j-1]].x;
				con[v[j-1]].push_back({v[j],d});
				con[v[j]].push_back({v[j-1],d});
			}
		}
	}
	/*for(ll i = 0;i<m;i++){
		vector<ll> v;
		for(ll j = l[i];j<=r[i];j++){
			if (h[j]>=y[i]){
				v.push_back(gp({x[j],y[i]}));
			}
		}
		for(ll j = 1;j<v.size();j++){
			ll d = ps[v[j]].x-ps[v[j-1]].x;
			con[v[j-1]].push_back({v[j],d});
			con[v[j]].push_back({v[j-1],d});
		}
	}*/
	ll start = gp({x[s],0});
	ll goal = gp({x[g],0});
	vector<ll> dis(c,big);
	priority_queue<line> q;
	q.push({start,0});
	while(q.size()){
		auto [i,v] = q.top();q.pop();
		if(dis[i]<=v) continue;
		dis[i] = v;
		for(auto [j,w] : con[i]){
			q.push({j,v+w});
		}
	}
	ll ans = dis[goal];
	if (ans>=big) ans = -1;
	return ans;
}

Compilation message

walk.cpp: In member function 'void segtree::init(ll, ll, ll)':
walk.cpp:48:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   48 |    ll m = l+r>>1;
      |           ~^~
walk.cpp: In member function 'void segtree::mod(ll, ll, ll, ll, ll)':
walk.cpp:57:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   57 |    ll m = l+r>>1;
      |           ~^~
walk.cpp: In member function 'nod segtree::get(ll, ll, ll, ll, ll)':
walk.cpp:70:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   70 |    ll m = l+r>>1;
      |           ~^~
walk.cpp: In function 'long long int min_distance(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, int, int)':
walk.cpp:106:6: warning: unused variable 'ans' [-Wunused-variable]
  106 |   ll ans = big;
      |      ^~~
walk.cpp:190:18: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  190 |    for(ll j = 1;j<v.size();j++){
      |                 ~^~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 868 ms 100152 KB Output is correct
4 Correct 910 ms 113532 KB Output is correct
5 Correct 560 ms 100320 KB Output is correct
6 Correct 473 ms 90820 KB Output is correct
7 Correct 551 ms 99956 KB Output is correct
8 Correct 1115 ms 126944 KB Output is correct
9 Correct 686 ms 97404 KB Output is correct
10 Correct 1349 ms 154196 KB Output is correct
11 Correct 453 ms 58644 KB Output is correct
12 Correct 145 ms 35008 KB Output is correct
13 Correct 153 ms 35024 KB Output is correct
14 Correct 234 ms 44172 KB Output is correct
15 Correct 245 ms 42200 KB Output is correct
16 Correct 250 ms 45064 KB Output is correct
17 Correct 255 ms 41940 KB Output is correct
18 Correct 107 ms 24512 KB Output is correct
19 Correct 7 ms 2364 KB Output is correct
20 Correct 79 ms 23508 KB Output is correct
21 Correct 47 ms 8388 KB Output is correct
22 Incorrect 48 ms 8900 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 20 ms 3544 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 20 ms 3544 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 868 ms 100152 KB Output is correct
21 Correct 910 ms 113532 KB Output is correct
22 Correct 560 ms 100320 KB Output is correct
23 Correct 473 ms 90820 KB Output is correct
24 Correct 551 ms 99956 KB Output is correct
25 Correct 1115 ms 126944 KB Output is correct
26 Correct 686 ms 97404 KB Output is correct
27 Correct 1349 ms 154196 KB Output is correct
28 Correct 453 ms 58644 KB Output is correct
29 Correct 145 ms 35008 KB Output is correct
30 Correct 153 ms 35024 KB Output is correct
31 Correct 234 ms 44172 KB Output is correct
32 Correct 245 ms 42200 KB Output is correct
33 Correct 250 ms 45064 KB Output is correct
34 Correct 255 ms 41940 KB Output is correct
35 Correct 107 ms 24512 KB Output is correct
36 Correct 7 ms 2364 KB Output is correct
37 Correct 79 ms 23508 KB Output is correct
38 Correct 47 ms 8388 KB Output is correct
39 Incorrect 48 ms 8900 KB Output isn't correct
40 Halted 0 ms 0 KB -