oj.uz

Submission #790574

# Submission time Handle Problem Language Result Execution time Memory
790574 2023-07-22T21:05:28 Z FEDIKUS Ancient Books (IOI17_books) C++17
50 / 100
 164 ms 24760 KB 
#include "books.h"
#include<bits/stdc++.h>

using ll = long long;
using namespace std;

const int maxn=1e6+10;

int n;
int mini[maxn];
int maxi[maxn];
bool bio[maxn];
int dsu[maxn],siz[maxn];

int cale(int a){return a==dsu[a] ? a:cale(dsu[a]);}
void join(int a,int b){
	a=cale(a); b=cale(b);
	if(a==b) return;
	if(siz[a]<siz[b]) swap(a,b);
	dsu[b]=a;
	siz[a]+=siz[b];
	maxi[a]=max(maxi[a],maxi[b]);
	mini[a]=min(mini[a],mini[b]);
}
void init(){
	for(int i=0;i<n;i++){dsu[i]=i; siz[i]=1; maxi[i]=i; mini[i]=i;}
}

ll minimum_walk(vector<int> p, int s) {
	n=p.size();
	init();
	ll ret=0;
	int imal=n,imar=-1;
	for(int i=0;i<n;i++){
		if(p[i]!=i) imal=min(imal,i);
		if(p[i]!=i) imar=i;
		ret+=abs(p[i]-i);
		if(bio[i]) continue;
		int tren=i;
		while(!bio[tren]){
			bio[tren]=true;
			join(tren,p[tren]);
			tren=p[tren];
		}
	}
	imal=min(imal,s);
	imar=max(imar,s);
	int l=s,r=s;
	int tl=mini[cale(s)],tr=maxi[cale(s)];
	int dodaol=0,dodaor=0;
	while(l!=imal || r!=imar){
		bool pl=false,pr=false;
		if(l!=tl && r!=tr){
			if(l!=tl){
				l--;
				tl=min(tl,mini[cale(l)]);
				tr=max(tr,maxi[cale(l)]);
			}
			if(r!=tr){
				r++;
				tl=min(tl,mini[cale(r)]);
				tr=max(tr,maxi[cale(r)]);
			}
		}
		if(l>imal && maxi[cale(l-1)]<=r){
			pl=true;
			l--;
			if(l<tl){
				ret+=2;
				dodaol++;
			}
			tl=min(tl,mini[cale(l)]);
		}
		if(r<imar && mini[cale(r+1)]>=l){
			pr=true;
			r++;
			if(r>tr){
				ret+=2;
				dodaor++;
			}
			tr=max(tr,maxi[cale(r)]);
		}
		if(pl || pr) continue;
		ret-=2*max(dodaol,dodaor);
		ret+=2;
		l--;
		tl=min(tl,mini[cale(l)]);
		tr=max(tr,maxi[cale(l)]);
		dodaol=0;
		dodaor=0;
	}
	return ret;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 164 ms 24760 KB Output is correct
31 Correct 162 ms 24708 KB Output is correct
32 Correct 86 ms 24700 KB Output is correct
33 Correct 91 ms 24652 KB Output is correct
34 Correct 93 ms 24692 KB Output is correct
35 Correct 96 ms 24692 KB Output is correct
36 Correct 103 ms 24704 KB Output is correct
37 Correct 96 ms 24648 KB Output is correct
38 Correct 98 ms 24692 KB Output is correct
39 Correct 92 ms 24696 KB Output is correct
40 Correct 98 ms 24756 KB Output is correct
41 Correct 111 ms 24692 KB Output is correct
42 Correct 119 ms 24704 KB Output is correct
43 Correct 93 ms 24692 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 340 KB 3rd lines differ - on the 1st token, expected: '3304', found: '3308'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 164 ms 24760 KB Output is correct
31 Correct 162 ms 24708 KB Output is correct
32 Correct 86 ms 24700 KB Output is correct
33 Correct 91 ms 24652 KB Output is correct
34 Correct 93 ms 24692 KB Output is correct
35 Correct 96 ms 24692 KB Output is correct
36 Correct 103 ms 24704 KB Output is correct
37 Correct 96 ms 24648 KB Output is correct
38 Correct 98 ms 24692 KB Output is correct
39 Correct 92 ms 24696 KB Output is correct
40 Correct 98 ms 24756 KB Output is correct
41 Correct 111 ms 24692 KB Output is correct
42 Correct 119 ms 24704 KB Output is correct
43 Correct 93 ms 24692 KB Output is correct
44 Incorrect 0 ms 340 KB 3rd lines differ - on the 1st token, expected: '3304', found: '3308'
45 Halted 0 ms 0 KB -