oj.uz

Submission #823404

# Submission time Handle Problem Language Result Execution time Memory
823404 2023-08-12T13:22:30 Z I_Love_EliskaM_ Sky Walking (IOI19_walk) C++17
39 / 100
 1606 ms 229880 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 = 4e18;
#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;
		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();

	auto z = p12(x,h,l,r,y,s,g);
	if (z!=-2) return z;
	
	#define int ll

	sgt bottom, top;
	bottom.set(0,0);
	top.set(0,0);
	vector<vector<int>> add(n), del(n);
	del[0].pb(0);
	add[n-1].pb(0);
	forn(i,m) {
		add[l[i]].pb(y[i]);
		del[r[i]].pb(y[i]);
	}
	forn(i,n) {
		vector<pi> toset;
		for(auto&y:add[i]) {
			int f = bottom.query(0,y+1);
			int s = top.query(y,h[i]+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;
	ll a = x[n-1];
	ll b = x[0];
	a-=b;
	int f = top.s+a;
	return f;

	#undef int
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28500 KB Output is correct
2 Correct 16 ms 28472 KB Output is correct
3 Correct 18 ms 28500 KB Output is correct
4 Correct 15 ms 28468 KB Output is correct
5 Correct 15 ms 28640 KB Output is correct
6 Correct 17 ms 28564 KB Output is correct
7 Correct 15 ms 28500 KB Output is correct
8 Correct 15 ms 28512 KB Output is correct
9 Correct 15 ms 28500 KB Output is correct
10 Correct 16 ms 28668 KB Output is correct
11 Correct 15 ms 28532 KB Output is correct
12 Correct 15 ms 28540 KB Output is correct
13 Correct 15 ms 28532 KB Output is correct
14 Correct 15 ms 28500 KB Output is correct
15 Correct 15 ms 28412 KB Output is correct
16 Correct 15 ms 28460 KB Output is correct
17 Correct 16 ms 28628 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 28492 KB Output is correct
2 Correct 15 ms 28444 KB Output is correct
3 Correct 1173 ms 166152 KB Output is correct
4 Correct 958 ms 172820 KB Output is correct
5 Correct 605 ms 153424 KB Output is correct
6 Correct 525 ms 138212 KB Output is correct
7 Correct 626 ms 153440 KB Output is correct
8 Correct 1606 ms 204676 KB Output is correct
9 Correct 755 ms 151964 KB Output is correct
10 Correct 1434 ms 229880 KB Output is correct
11 Correct 529 ms 101048 KB Output is correct
12 Correct 328 ms 75056 KB Output is correct
13 Correct 1183 ms 203868 KB Output is correct
14 Correct 229 ms 74428 KB Output is correct
15 Correct 298 ms 76216 KB Output is correct
16 Correct 271 ms 77320 KB Output is correct
17 Correct 273 ms 75988 KB Output is correct
18 Correct 353 ms 87392 KB Output is correct
19 Correct 21 ms 30836 KB Output is correct
20 Correct 97 ms 51908 KB Output is correct
21 Correct 267 ms 73408 KB Output is correct
22 Correct 281 ms 75084 KB Output is correct
23 Correct 281 ms 89800 KB Output is correct
24 Correct 260 ms 75828 KB Output is correct
25 Correct 279 ms 75508 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 47132 KB Output is correct
2 Correct 408 ms 122636 KB Output is correct
3 Correct 402 ms 108860 KB Output is correct
4 Correct 522 ms 127508 KB Output is correct
5 Correct 498 ms 128432 KB Output is correct
6 Correct 546 ms 130608 KB Output is correct
7 Correct 231 ms 84004 KB Output is correct
8 Correct 304 ms 75028 KB Output is correct
9 Correct 476 ms 126548 KB Output is correct
10 Correct 197 ms 47720 KB Output is correct
11 Correct 37 ms 33940 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 47132 KB Output is correct
2 Correct 408 ms 122636 KB Output is correct
3 Correct 402 ms 108860 KB Output is correct
4 Correct 522 ms 127508 KB Output is correct
5 Correct 498 ms 128432 KB Output is correct
6 Correct 546 ms 130608 KB Output is correct
7 Correct 231 ms 84004 KB Output is correct
8 Correct 304 ms 75028 KB Output is correct
9 Correct 476 ms 126548 KB Output is correct
10 Correct 197 ms 47720 KB Output is correct
11 Correct 37 ms 33940 KB Output is correct
12 Correct 412 ms 116716 KB Output is correct
13 Correct 479 ms 124060 KB Output is correct
14 Correct 494 ms 123056 KB Output is correct
15 Correct 365 ms 83876 KB Output is correct
16 Correct 294 ms 73100 KB Output is correct
17 Correct 315 ms 73088 KB Output is correct
18 Correct 423 ms 83856 KB Output is correct
19 Correct 308 ms 73252 KB Output is correct
20 Correct 247 ms 83132 KB Output is correct
21 Correct 48 ms 36032 KB Output is correct
22 Correct 315 ms 103204 KB Output is correct
23 Correct 296 ms 104388 KB Output is correct
24 Correct 427 ms 118604 KB Output is correct
25 Correct 312 ms 114184 KB Output is correct
26 Incorrect 292 ms 74568 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28500 KB Output is correct
2 Correct 16 ms 28472 KB Output is correct
3 Correct 18 ms 28500 KB Output is correct
4 Correct 15 ms 28468 KB Output is correct
5 Correct 15 ms 28640 KB Output is correct
6 Correct 17 ms 28564 KB Output is correct
7 Correct 15 ms 28500 KB Output is correct
8 Correct 15 ms 28512 KB Output is correct
9 Correct 15 ms 28500 KB Output is correct
10 Correct 16 ms 28668 KB Output is correct
11 Correct 15 ms 28532 KB Output is correct
12 Correct 15 ms 28540 KB Output is correct
13 Correct 15 ms 28532 KB Output is correct
14 Correct 15 ms 28500 KB Output is correct
15 Correct 15 ms 28412 KB Output is correct
16 Correct 15 ms 28460 KB Output is correct
17 Correct 16 ms 28628 KB Output is correct
18 Correct 16 ms 28492 KB Output is correct
19 Correct 15 ms 28444 KB Output is correct
20 Correct 1173 ms 166152 KB Output is correct
21 Correct 958 ms 172820 KB Output is correct
22 Correct 605 ms 153424 KB Output is correct
23 Correct 525 ms 138212 KB Output is correct
24 Correct 626 ms 153440 KB Output is correct
25 Correct 1606 ms 204676 KB Output is correct
26 Correct 755 ms 151964 KB Output is correct
27 Correct 1434 ms 229880 KB Output is correct
28 Correct 529 ms 101048 KB Output is correct
29 Correct 328 ms 75056 KB Output is correct
30 Correct 1183 ms 203868 KB Output is correct
31 Correct 229 ms 74428 KB Output is correct
32 Correct 298 ms 76216 KB Output is correct
33 Correct 271 ms 77320 KB Output is correct
34 Correct 273 ms 75988 KB Output is correct
35 Correct 353 ms 87392 KB Output is correct
36 Correct 21 ms 30836 KB Output is correct
37 Correct 97 ms 51908 KB Output is correct
38 Correct 267 ms 73408 KB Output is correct
39 Correct 281 ms 75084 KB Output is correct
40 Correct 281 ms 89800 KB Output is correct
41 Correct 260 ms 75828 KB Output is correct
42 Correct 279 ms 75508 KB Output is correct
43 Correct 104 ms 47132 KB Output is correct
44 Correct 408 ms 122636 KB Output is correct
45 Correct 402 ms 108860 KB Output is correct
46 Correct 522 ms 127508 KB Output is correct
47 Correct 498 ms 128432 KB Output is correct
48 Correct 546 ms 130608 KB Output is correct
49 Correct 231 ms 84004 KB Output is correct
50 Correct 304 ms 75028 KB Output is correct
51 Correct 476 ms 126548 KB Output is correct
52 Correct 197 ms 47720 KB Output is correct
53 Correct 37 ms 33940 KB Output is correct
54 Correct 412 ms 116716 KB Output is correct
55 Correct 479 ms 124060 KB Output is correct
56 Correct 494 ms 123056 KB Output is correct
57 Correct 365 ms 83876 KB Output is correct
58 Correct 294 ms 73100 KB Output is correct
59 Correct 315 ms 73088 KB Output is correct
60 Correct 423 ms 83856 KB Output is correct
61 Correct 308 ms 73252 KB Output is correct
62 Correct 247 ms 83132 KB Output is correct
63 Correct 48 ms 36032 KB Output is correct
64 Correct 315 ms 103204 KB Output is correct
65 Correct 296 ms 104388 KB Output is correct
66 Correct 427 ms 118604 KB Output is correct
67 Correct 312 ms 114184 KB Output is correct
68 Incorrect 292 ms 74568 KB Output isn't correct
69 Halted 0 ms 0 KB -