oj.uz

Submission #823461

# Submission time Handle Problem Language Result Execution time Memory
823461 2023-08-12T14:25:28 Z I_Love_EliskaM_ Sky Walking (IOI19_walk) C++17
57 / 100
 1541 ms 229940 KB 
#include "walk.h"
#include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0; i<n; ++i)
#define pb push_back
using ll = long long;
const ll inf = 1e18;
#define pi pair<ll,ll>
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()

#define int ll
const int sz=1<<30;
struct sgt {
	sgt *L, *R; int s;
	sgt() {
		L=R=NULL; s=inf;
	}
	void set(int l, int r, int i, int x) {
		if (r-l==1) {
			s=x; return;
		}
		int m=(l+r)>>1;
		if (i<m) {
			if (!L) L=new sgt();
			L->set(l,m,i,x);
		} else {
			if (!R) R=new sgt();
			R->set(m,r,i,x);
		}
		s = min(L?L->s:inf, R?R->s:inf);
	}
	void set(int i, int x) {
		set(0,sz,i,x);
	}
	int query(int l, int r, int lx, int rx) {
		if (rx<=l || r<=lx) return inf;
		if (lx<=l && r<=rx) return s;
		int m=(l+r)>>1;
		int lq=L?L->query(l,m,lx,rx):inf;
		int rq=R?R->query(m,r,lx,rx):inf;
		return min(lq,rq);
	}
	int query(int l, int r) {
		return query(0,sz,l,r);
	}
};

const int N=1e5+55;
vector<pi> adj[10*N];
ll d[10*N];

map<int,int> c[N]; int _z=0; const int Z=1e9+5;
int ind(int x, int y) {
	if (c[x].count(y)) return c[x][y];
	return c[x][y]=_z++;
}
#undef int

ll p12(vector<int>x, vector<int>h, vector<int>l, vector<int>r, vector<int>y, int s, int g) {
	int n=x.size(), m=l.size();
	
	vector<vector<int>> g1(n);
	vector<vector<int>> g2(m);
	g1[s].pb(0);
	g1[g].pb(0);

	vector<pi> v;
	forn(i,n) v.pb({h[i],i});
	forn(i,m) v.pb({y[i],-i-1});
	sort(rall(v));

	set<int> st; 
	for(auto&z:v) {
		int y=z.f, i=z.s;
		if (i>=0) {
			st.insert(i); continue;
		}
		i*=-1; --i;
		auto it=st.upper_bound(l[i]);
		vector<int> v;
		while (1) {
			int j=*it;
			v.pb(j);
			if (j==r[i]) break;
			++it;
		}
		if (v.size() > 10 && max(n,m)>50) return -2;
		g1[l[i]].pb(y);
		int last=l[i];
		for(auto&j:v) {
			adj[ind(last,y)].pb({ind(j,y),x[j]-x[last]});
			adj[ind(j,y)].pb({ind(last,y),x[j]-x[last]});
			g1[j].pb(y);
			last=j;
		}
	}

	forn(i,n) {
		sort(all(g1[i]));
		int sz=g1[i].size();
		forn(j,sz-1) {
			adj[ind(i,g1[i][j])].pb({ind(i,g1[i][j+1]),g1[i][j+1]-g1[i][j]});
			adj[ind(i,g1[i][j+1])].pb({ind(i,g1[i][j]),g1[i][j+1]-g1[i][j]});
		}
	}

	forn(i,_z) d[i]=inf;
	priority_queue<pair<ll,ll>> q; q.push({0,ind(s,0)});

	while(q.size()) {
		auto it=q.top(); q.pop();
		ll di=-it.f, u=it.s;
		if (d[u]<=di) continue;
		d[u]=di;
		//assert(adj[u].size()<=4);
		for(auto&e:adj[u]) {
			int v=e.f, w=e.s;
			if (d[v]!=inf) continue;
			q.push({-di-w,v});
		}
	}

	if (d[ind(g,0)]==inf) return -1;
	return d[ind(g,0)];
}

ll min_distance(vector<int>x, vector<int>h, vector<int>l, vector<int>r, vector<int>y, int s, int g) {
	int n=x.size(), m=l.size();

	if (s!=0 || g!=n-1) return p12(x,h,l,r,y,s,g);
	
	#define int ll

	sgt st;
	forn(i,n) st.set(i,-h[i]);

	sgt bottom, top;
	bottom.set(0,0);
	top.set(0,0);
	vector<vector<int>> del(n);
	vector<vector<pi>> add(n);
	del[0].pb(0);
	add[n-1].pb({0,inf});
	forn(i,m) {
		add[l[i]].pb({y[i],-st.query(l[i],r[i]+1)});
		del[r[i]].pb(y[i]);
	}
	forn(i,n) {
		vector<pi> toset;
		for(auto&it:add[i]) {
			int y=it.f, z=it.s;
			int f = bottom.query(0,y+1);
			int s = top.query(y,z+1);
			if (min(f,s)==inf) continue;
			f+=y; s-=y;
			int x=min(f,s);
			toset.pb({y,x});
		}
		for(auto&y:del[i]) {
			bottom.set(y,inf);
			top.set(y,inf);
		}
		for(auto&x:toset) {
			bottom.set(x.f,x.s-x.f);
			top.set(x.f,x.s+x.f);
		}
	}
	if (top.s==inf) return -1;
	int f = top.s+x[n-1]-x[0];
	return f;

	#undef int
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 28500 KB Output is correct
2 Correct 13 ms 28500 KB Output is correct
3 Correct 12 ms 28500 KB Output is correct
4 Correct 16 ms 28508 KB Output is correct
5 Correct 18 ms 28524 KB Output is correct
6 Correct 14 ms 28576 KB Output is correct
7 Correct 18 ms 28616 KB Output is correct
8 Correct 13 ms 28500 KB Output is correct
9 Correct 14 ms 28508 KB Output is correct
10 Correct 19 ms 28628 KB Output is correct
11 Correct 14 ms 28532 KB Output is correct
12 Correct 16 ms 28512 KB Output is correct
13 Correct 14 ms 28500 KB Output is correct
14 Correct 14 ms 28464 KB Output is correct
15 Correct 16 ms 28476 KB Output is correct
16 Correct 13 ms 28500 KB Output is correct
17 Correct 13 ms 28544 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 28500 KB Output is correct
2 Correct 14 ms 28500 KB Output is correct
3 Correct 1008 ms 165992 KB Output is correct
4 Correct 850 ms 172780 KB Output is correct
5 Correct 547 ms 153320 KB Output is correct
6 Correct 478 ms 138088 KB Output is correct
7 Correct 539 ms 153340 KB Output is correct
8 Correct 1541 ms 204628 KB Output is correct
9 Correct 654 ms 151816 KB Output is correct
10 Correct 1367 ms 229940 KB Output is correct
11 Correct 456 ms 100932 KB Output is correct
12 Correct 400 ms 132372 KB Output is correct
13 Correct 393 ms 132364 KB Output is correct
14 Correct 223 ms 74496 KB Output is correct
15 Correct 256 ms 76260 KB Output is correct
16 Correct 286 ms 77224 KB Output is correct
17 Correct 323 ms 75976 KB Output is correct
18 Correct 173 ms 59820 KB Output is correct
19 Correct 19 ms 30800 KB Output is correct
20 Correct 98 ms 51956 KB Output is correct
21 Correct 215 ms 45352 KB Output is correct
22 Correct 217 ms 49576 KB Output is correct
23 Correct 265 ms 57740 KB Output is correct
24 Correct 245 ms 49224 KB Output is correct
25 Correct 207 ms 46980 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 32976 KB Output is correct
2 Correct 402 ms 123688 KB Output is correct
3 Correct 425 ms 110580 KB Output is correct
4 Correct 455 ms 134356 KB Output is correct
5 Correct 498 ms 135548 KB Output is correct
6 Correct 499 ms 137472 KB Output is correct
7 Correct 232 ms 90272 KB Output is correct
8 Correct 441 ms 128456 KB Output is correct
9 Correct 518 ms 132896 KB Output is correct
10 Correct 211 ms 54344 KB Output is correct
11 Correct 44 ms 34768 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 32976 KB Output is correct
2 Correct 402 ms 123688 KB Output is correct
3 Correct 425 ms 110580 KB Output is correct
4 Correct 455 ms 134356 KB Output is correct
5 Correct 498 ms 135548 KB Output is correct
6 Correct 499 ms 137472 KB Output is correct
7 Correct 232 ms 90272 KB Output is correct
8 Correct 441 ms 128456 KB Output is correct
9 Correct 518 ms 132896 KB Output is correct
10 Correct 211 ms 54344 KB Output is correct
11 Correct 44 ms 34768 KB Output is correct
12 Correct 370 ms 118316 KB Output is correct
13 Correct 416 ms 130936 KB Output is correct
14 Correct 484 ms 130172 KB Output is correct
15 Correct 315 ms 81004 KB Output is correct
16 Correct 366 ms 80116 KB Output is correct
17 Correct 362 ms 80364 KB Output is correct
18 Correct 301 ms 80916 KB Output is correct
19 Correct 313 ms 80084 KB Output is correct
20 Correct 277 ms 89468 KB Output is correct
21 Correct 60 ms 42244 KB Output is correct
22 Correct 298 ms 109840 KB Output is correct
23 Correct 286 ms 111244 KB Output is correct
24 Correct 269 ms 117068 KB Output is correct
25 Correct 334 ms 120968 KB Output is correct
26 Correct 271 ms 129136 KB Output is correct
27 Correct 522 ms 130752 KB Output is correct
28 Correct 344 ms 134380 KB Output is correct
29 Correct 510 ms 128732 KB Output is correct
30 Correct 228 ms 90364 KB Output is correct
31 Correct 496 ms 132992 KB Output is correct
32 Correct 192 ms 49808 KB Output is correct
33 Correct 219 ms 51884 KB Output is correct
34 Correct 197 ms 54700 KB Output is correct
35 Correct 302 ms 67536 KB Output is correct
36 Correct 219 ms 63952 KB Output is correct
37 Correct 180 ms 45240 KB Output is correct
38 Correct 211 ms 49640 KB Output is correct
39 Correct 265 ms 57740 KB Output is correct
40 Correct 240 ms 49224 KB Output is correct
41 Correct 224 ms 47000 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 28500 KB Output is correct
2 Correct 13 ms 28500 KB Output is correct
3 Correct 12 ms 28500 KB Output is correct
4 Correct 16 ms 28508 KB Output is correct
5 Correct 18 ms 28524 KB Output is correct
6 Correct 14 ms 28576 KB Output is correct
7 Correct 18 ms 28616 KB Output is correct
8 Correct 13 ms 28500 KB Output is correct
9 Correct 14 ms 28508 KB Output is correct
10 Correct 19 ms 28628 KB Output is correct
11 Correct 14 ms 28532 KB Output is correct
12 Correct 16 ms 28512 KB Output is correct
13 Correct 14 ms 28500 KB Output is correct
14 Correct 14 ms 28464 KB Output is correct
15 Correct 16 ms 28476 KB Output is correct
16 Correct 13 ms 28500 KB Output is correct
17 Correct 13 ms 28544 KB Output is correct
18 Correct 13 ms 28500 KB Output is correct
19 Correct 14 ms 28500 KB Output is correct
20 Correct 1008 ms 165992 KB Output is correct
21 Correct 850 ms 172780 KB Output is correct
22 Correct 547 ms 153320 KB Output is correct
23 Correct 478 ms 138088 KB Output is correct
24 Correct 539 ms 153340 KB Output is correct
25 Correct 1541 ms 204628 KB Output is correct
26 Correct 654 ms 151816 KB Output is correct
27 Correct 1367 ms 229940 KB Output is correct
28 Correct 456 ms 100932 KB Output is correct
29 Correct 400 ms 132372 KB Output is correct
30 Correct 393 ms 132364 KB Output is correct
31 Correct 223 ms 74496 KB Output is correct
32 Correct 256 ms 76260 KB Output is correct
33 Correct 286 ms 77224 KB Output is correct
34 Correct 323 ms 75976 KB Output is correct
35 Correct 173 ms 59820 KB Output is correct
36 Correct 19 ms 30800 KB Output is correct
37 Correct 98 ms 51956 KB Output is correct
38 Correct 215 ms 45352 KB Output is correct
39 Correct 217 ms 49576 KB Output is correct
40 Correct 265 ms 57740 KB Output is correct
41 Correct 245 ms 49224 KB Output is correct
42 Correct 207 ms 46980 KB Output is correct
43 Correct 71 ms 32976 KB Output is correct
44 Correct 402 ms 123688 KB Output is correct
45 Correct 425 ms 110580 KB Output is correct
46 Correct 455 ms 134356 KB Output is correct
47 Correct 498 ms 135548 KB Output is correct
48 Correct 499 ms 137472 KB Output is correct
49 Correct 232 ms 90272 KB Output is correct
50 Correct 441 ms 128456 KB Output is correct
51 Correct 518 ms 132896 KB Output is correct
52 Correct 211 ms 54344 KB Output is correct
53 Correct 44 ms 34768 KB Output is correct
54 Correct 370 ms 118316 KB Output is correct
55 Correct 416 ms 130936 KB Output is correct
56 Correct 484 ms 130172 KB Output is correct
57 Correct 315 ms 81004 KB Output is correct
58 Correct 366 ms 80116 KB Output is correct
59 Correct 362 ms 80364 KB Output is correct
60 Correct 301 ms 80916 KB Output is correct
61 Correct 313 ms 80084 KB Output is correct
62 Correct 277 ms 89468 KB Output is correct
63 Correct 60 ms 42244 KB Output is correct
64 Correct 298 ms 109840 KB Output is correct
65 Correct 286 ms 111244 KB Output is correct
66 Correct 269 ms 117068 KB Output is correct
67 Correct 334 ms 120968 KB Output is correct
68 Correct 271 ms 129136 KB Output is correct
69 Correct 522 ms 130752 KB Output is correct
70 Correct 344 ms 134380 KB Output is correct
71 Correct 510 ms 128732 KB Output is correct
72 Correct 228 ms 90364 KB Output is correct
73 Correct 496 ms 132992 KB Output is correct
74 Correct 192 ms 49808 KB Output is correct
75 Correct 219 ms 51884 KB Output is correct
76 Correct 197 ms 54700 KB Output is correct
77 Correct 302 ms 67536 KB Output is correct
78 Correct 219 ms 63952 KB Output is correct
79 Correct 180 ms 45240 KB Output is correct
80 Correct 211 ms 49640 KB Output is correct
81 Correct 265 ms 57740 KB Output is correct
82 Correct 240 ms 49224 KB Output is correct
83 Correct 224 ms 47000 KB Output is correct
84 Incorrect 25 ms 32852 KB Output isn't correct
85 Halted 0 ms 0 KB -