답안 #790587

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
790587 2023-07-22T21:51:08 Z FEDIKUS 고대 책들 (IOI17_books) C++17
50 / 100
176 ms 31464 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)]);
			}
			continue;
		}
		while(l>imal && maxi[cale(l-1)]<=r){
			l--;
			if(l<tl){
				ret+=2;
				dodaol++;
			}
			tl=min(tl,mini[cale(l)]);
		}
		while(r<imar && mini[cale(r+1)]>=l){
			r++;
			if(r>tr){
				ret+=2;
				dodaor++;
			}
			tr=max(tr,maxi[cale(r)]);
		}
		if(l==imal && r==imar) break;
		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;
}

Compilation message

books.cpp: In function 'll minimum_walk(std::vector<int>, int)':
books.cpp:52:8: warning: unused variable 'pl' [-Wunused-variable]
   52 |   bool pl=false,pr=false;
      |        ^~
books.cpp:52:17: warning: unused variable 'pr' [-Wunused-variable]
   52 |   bool pl=false,pr=false;
      |                 ^~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 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 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 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 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 312 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 316 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 312 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 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 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 312 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 316 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 312 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 176 ms 31464 KB Output is correct
31 Correct 174 ms 25040 KB Output is correct
32 Correct 83 ms 24972 KB Output is correct
33 Correct 95 ms 25036 KB Output is correct
34 Correct 99 ms 25040 KB Output is correct
35 Correct 98 ms 25028 KB Output is correct
36 Correct 97 ms 24996 KB Output is correct
37 Correct 94 ms 24968 KB Output is correct
38 Correct 110 ms 24952 KB Output is correct
39 Correct 96 ms 24980 KB Output is correct
40 Correct 101 ms 25112 KB Output is correct
41 Correct 121 ms 25024 KB Output is correct
42 Correct 107 ms 24968 KB Output is correct
43 Correct 101 ms 24976 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Incorrect 1 ms 340 KB 3rd lines differ - on the 1st token, expected: '5920', found: '5922'
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 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 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 312 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 316 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 312 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 176 ms 31464 KB Output is correct
31 Correct 174 ms 25040 KB Output is correct
32 Correct 83 ms 24972 KB Output is correct
33 Correct 95 ms 25036 KB Output is correct
34 Correct 99 ms 25040 KB Output is correct
35 Correct 98 ms 25028 KB Output is correct
36 Correct 97 ms 24996 KB Output is correct
37 Correct 94 ms 24968 KB Output is correct
38 Correct 110 ms 24952 KB Output is correct
39 Correct 96 ms 24980 KB Output is correct
40 Correct 101 ms 25112 KB Output is correct
41 Correct 121 ms 25024 KB Output is correct
42 Correct 107 ms 24968 KB Output is correct
43 Correct 101 ms 24976 KB Output is correct
44 Correct 0 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Incorrect 1 ms 340 KB 3rd lines differ - on the 1st token, expected: '5920', found: '5922'
47 Halted 0 ms 0 KB -