oj.uz

Submission #1030526

# Submission time Handle Problem Language Result Execution time Memory
1030526 2024-07-22T06:27:20 Z vjudge1 Ancient Books (IOI17_books) C++17
100 / 100
 331 ms 41400 KB 
#include "books.h"
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rng(i,l,r) for(int i=(l); i<(r); i++)
#define all(x) x.begin(),x.end()
using ll=long long;
const int INF=INT_MAX>>1;

struct SegTree{

	using T=pair<int,int>;
	inline T op(T x,T y){
		return {min(x.first,y.first),max(x.second,y.second)};
	}
	inline T e(){
		return {INF,-INF};
	}

	vector<T> tree;
	int size;
	SegTree(int sz):size(sz){
		tree.resize(size*2,e());
	}
	inline T get(int pos){
		return tree[pos+size];
	}
	inline void set(int pos,T val){
		pos+=size;
		tree[pos]=val;
		pos>>=1;
		while(pos>=1){
			tree[pos]=op(tree[pos*2],tree[pos*2+1]);
			pos>>=1;
		}
	}
	T prod(int lf,int ri){
		lf+=size;
		ri+=size;
		T rl=e();
		T rr=e();
		while(lf<ri){
			if(lf&1){
				rl=op(rl,tree[lf]);
				lf++;
			}
			if(ri&1){
				ri--;
				rr=op(tree[ri],rr);
			}
			lf>>=1;
			ri>>=1;
		}
		return op(rl,rr);
	}
};

long long minimum_walk(std::vector<int> p, int s) {
	int n=p.size();
	vector<int> vis(n,-1);
	vector<pair<int,int>> wide;
	int cnt=0;
	ll ans=0;
	rep(i,n){
		if(vis[i]>=0)continue;
		if(p[i]==i&&i!=s)continue;
		int lf=i;
		int ri=i;
		int pos=i;
		while(vis[p[pos]]==-1){
			ans+=abs(pos-p[pos]);
			pos=p[pos];
			vis[pos]=cnt;
			lf=min(lf,pos);
			ri=max(ri,pos);
		}
		cnt++;
		wide.emplace_back(lf,ri);
	}
	int sl,sr;
	{
		vector<pair<int,int>> seg=wide;
		sort(all(seg));
		vector<pair<int,int>> re={seg[0]};
		rng(i,1,seg.size()){
			if(seg[i].first<=re.back().second){
				re.back().second=max(re.back().second,seg[i].second);
			}
			else{
				re.emplace_back(seg[i]);
			}
		}
		rep(i,re.size()-1){
			ans+=2*(re[i+1].first-re[i].second);
		}
		for(auto i:re){
			if(i.first<=s&&s<=i.second){
				sl=i.first;
				sr=i.second;
				break;
			}
		}
	}
	vector<int> dist(cnt,INF);
	dist[vis[s]]=0;
	SegTree seg(n);
	rng(i,sl,sr+1){
		if(vis[i]!=-1){
			seg.set(i,{i,i});
		}
	}
	priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;
	pq.push({0,vis[s]});
	while(!pq.empty()){
		int dis,pos;
		tie(dis,pos)=pq.top();
		pq.pop();
		if(dist[pos]!=dis)continue;
		int lf,ri;
		tie(lf,ri)=wide[pos];
		while(true){
			int nxt=seg.prod(lf+1,ri).first;
			if(nxt>n)break;
			seg.set(nxt,seg.e());
			if(dist[vis[nxt]]>dis){
				dist[vis[nxt]]=dis;
				pq.push({dist[vis[nxt]],vis[nxt]});
			}
		}
		int nxt;
		nxt=seg.prod(0,lf).second;
		if(0<=nxt){
			if(dist[vis[nxt]]>dis+abs(nxt-lf)){
				dist[vis[nxt]]=dis+abs(nxt-lf);
				pq.push({dist[vis[nxt]],vis[nxt]});
			}
		}
		nxt=seg.prod(ri+1,n).first;
		if(nxt<n){
			if(dist[vis[nxt]]>dis+abs(nxt-ri)){
				dist[vis[nxt]]=dis+abs(nxt-ri);
				pq.push({dist[vis[nxt]],vis[nxt]});
			}
		}
	}
	rep(i,cnt){
		if(wide[i].first==sl){
			ans+=dist[i]*2;
			break;
		}
	}
	return ans;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:5:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define rng(i,l,r) for(int i=(l); i<(r); i++)
      |                                    ^
books.cpp:85:3: note: in expansion of macro 'rng'
   85 |   rng(i,1,seg.size()){
      |   ^~~
books.cpp:4:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define rep(i,n) for(int i=0; i<(n); i++)
      |                                ^
books.cpp:93:3: note: in expansion of macro 'rep'
   93 |   rep(i,re.size()-1){
      |   ^~~
books.cpp:5:36: warning: 'sr' may be used uninitialized in this function [-Wmaybe-uninitialized]
    5 | #define rng(i,l,r) for(int i=(l); i<(r); i++)
      |                                    ^
books.cpp:80:9: note: 'sr' was declared here
   80 |  int sl,sr;
      |         ^~
books.cpp:80:6: warning: 'sl' may be used uninitialized in this function [-Wmaybe-uninitialized]
   80 |  int sl,sr;
      |      ^~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 348 KB Output is correct
5 Correct 0 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 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 348 KB Output is correct
5 Correct 0 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 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 440 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 348 KB Output is correct
5 Correct 0 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 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 440 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 239 ms 34388 KB Output is correct
31 Correct 236 ms 34556 KB Output is correct
32 Correct 84 ms 34528 KB Output is correct
33 Correct 85 ms 36592 KB Output is correct
34 Correct 89 ms 36588 KB Output is correct
35 Correct 92 ms 36896 KB Output is correct
36 Correct 85 ms 36324 KB Output is correct
37 Correct 79 ms 34836 KB Output is correct
38 Correct 78 ms 34540 KB Output is correct
39 Correct 77 ms 34640 KB Output is correct
40 Correct 82 ms 34400 KB Output is correct
41 Correct 126 ms 34388 KB Output is correct
42 Correct 91 ms 34384 KB Output is correct
43 Correct 196 ms 41400 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 436 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 472 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 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 476 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 616 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 348 KB Output is correct
5 Correct 0 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 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 440 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 239 ms 34388 KB Output is correct
31 Correct 236 ms 34556 KB Output is correct
32 Correct 84 ms 34528 KB Output is correct
33 Correct 85 ms 36592 KB Output is correct
34 Correct 89 ms 36588 KB Output is correct
35 Correct 92 ms 36896 KB Output is correct
36 Correct 85 ms 36324 KB Output is correct
37 Correct 79 ms 34836 KB Output is correct
38 Correct 78 ms 34540 KB Output is correct
39 Correct 77 ms 34640 KB Output is correct
40 Correct 82 ms 34400 KB Output is correct
41 Correct 126 ms 34388 KB Output is correct
42 Correct 91 ms 34384 KB Output is correct
43 Correct 196 ms 41400 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 436 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 1 ms 344 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 1 ms 472 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 1 ms 476 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 0 ms 616 KB Output is correct
64 Correct 149 ms 37496 KB Output is correct
65 Correct 137 ms 37064 KB Output is correct
66 Correct 225 ms 34848 KB Output is correct
67 Correct 207 ms 34640 KB Output is correct
68 Correct 20 ms 3928 KB Output is correct
69 Correct 19 ms 3676 KB Output is correct
70 Correct 18 ms 3928 KB Output is correct
71 Correct 16 ms 3932 KB Output is correct
72 Correct 12 ms 3768 KB Output is correct
73 Correct 19 ms 3676 KB Output is correct
74 Correct 84 ms 36752 KB Output is correct
75 Correct 89 ms 36760 KB Output is correct
76 Correct 220 ms 41296 KB Output is correct
77 Correct 203 ms 41296 KB Output is correct
78 Correct 220 ms 40568 KB Output is correct
79 Correct 231 ms 40580 KB Output is correct
80 Correct 73 ms 34388 KB Output is correct
81 Correct 331 ms 41332 KB Output is correct
82 Correct 329 ms 40820 KB Output is correct
83 Correct 243 ms 37196 KB Output is correct
84 Correct 247 ms 36740 KB Output is correct
85 Correct 212 ms 35568 KB Output is correct
86 Correct 221 ms 34928 KB Output is correct
87 Correct 172 ms 36112 KB Output is correct
88 Correct 243 ms 37828 KB Output is correct
89 Correct 250 ms 37820 KB Output is correct
90 Correct 210 ms 34768 KB Output is correct
91 Correct 186 ms 34648 KB Output is correct
92 Correct 210 ms 34388 KB Output is correct