답안 #971242

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
971242	2024-04-28T08:30:37 Z	MilosMilutinovic	고대 책들 (IOI17_books)	C++14	42 / 100	350 ms	200324 KB

books

#include "books.h"
#include<bits/stdc++.h>
 
#define pb push_back
#define fi first
#define se second
#define mp make_pair
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
 
template <typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template <typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}
 
ll readint(){
	ll x=0,f=1; char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}

bool was[1000005];
int n,sl[1000005],sr[1000005],rt[100005];

namespace rmq{
	int mina[1000005][22],maxa[1000005][22],logs[1000005]; 
	void build(){
		for(int i=2;i<=n;i++) logs[i]=logs[i>>1]+1;
		for(int i=0;i<n;i++){
			mina[i][0]=sl[rt[i]];
			maxa[i][0]=sr[rt[i]];
		}
		for(int j=1;j<22;j++){
			for(int i=0;i+(1<<j)<=n;i++){
				mina[i][j]=min(mina[i][j-1],mina[i+(1<<(j-1))][j-1]);
				maxa[i][j]=max(maxa[i][j-1],maxa[i+(1<<(j-1))][j-1]);
			}
		}
	}
	int qmin(int l,int r){
		int k=logs[r-l+1];
		return min(mina[l][k],mina[r-(1<<k)+1][k]);
	}
	int qmax(int l,int r){
		int k=logs[r-l+1];
		return max(maxa[l][k],maxa[r-(1<<k)+1][k]);
	}
};

void work(int&l,int&r){
	while(true){
		int fl=rmq::qmin(l,r);
		int fr=rmq::qmax(l,r);
		if(fl==l&&fr==r) break;
		l=fl; r=fr;
	}
}

ll minimum_walk(vector<int> p,int s){
	n=(int)p.size();
	ll ans=0;
	for(int i=0;i<n;i++) ans+=abs(p[i]-i);
	for(int i=0;i<n;i++){
		if(was[i]) continue;
		sl[i]=i; sr[i]=i;
		rt[i]=i;
		int x=i;
		while(!was[x]){
			chkmin(sl[i],x);
			chkmax(sr[i],x);
			rt[x]=i;
			was[x]=true;
			x=p[x];
		}
	}
	rmq::build();
	int L=s,R=s;
	for(int i=0;i<n;i++){
		if(p[i]==i) continue;
		chkmin(L,i); chkmax(R,i);
	}
	int cl=s,cr=s;
	while(cl>L||cr<R){
		work(cl,cr);
		int nl=cl,nr=cr;
		int pl=cl,pr=cr;
		ll a=0;
		bool lt=false;
		while(pl>L&&pr==cr){
			a+=2;
			pl--;
			work(pl,pr);
		}
		chkmin(nl,pl);
		chkmax(nr,pr);
		if(pr>cr) lt=true;
		pl=cl; pr=cr;
		ll b=0;
		bool rt=false;
		while(pl==cl&&pr<R){
			b+=2;
			pr++;
			work(pl,pr);
		}
		chkmin(nl,pl);
		chkmax(nr,pr);
		if(pl<cl) rt=true;
		if(lt&&rt) ans+=min(a,b);
		else ans+=a+b;
		cl=nl; cr=nr;
	}
	return ans;
}

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	10584 KB	Output is correct
2	Correct	3 ms	10588 KB	Output is correct
3	Correct	2 ms	10584 KB	Output is correct
4	Correct	1 ms	10704 KB	Output is correct
5	Correct	3 ms	10588 KB	Output is correct
6	Correct	1 ms	10704 KB	Output is correct
7	Correct	3 ms	10588 KB	Output is correct
8	Correct	2 ms	10588 KB	Output is correct
9	Correct	2 ms	10588 KB	Output is correct
10	Correct	2 ms	10588 KB	Output is correct
11	Correct	1 ms	10688 KB	Output is correct
12	Correct	2 ms	10588 KB	Output is correct
13	Correct	2 ms	10588 KB	Output is correct
14	Correct	1 ms	10588 KB	Output is correct
15	Correct	1 ms	10588 KB	Output is correct
16	Correct	2 ms	10588 KB	Output is correct
17	Correct	2 ms	10588 KB	Output is correct
18	Correct	2 ms	10588 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	10584 KB	Output is correct
2	Correct	3 ms	10588 KB	Output is correct
3	Correct	2 ms	10584 KB	Output is correct
4	Correct	1 ms	10704 KB	Output is correct
5	Correct	3 ms	10588 KB	Output is correct
6	Correct	1 ms	10704 KB	Output is correct
7	Correct	3 ms	10588 KB	Output is correct
8	Correct	2 ms	10588 KB	Output is correct
9	Correct	2 ms	10588 KB	Output is correct
10	Correct	2 ms	10588 KB	Output is correct
11	Correct	1 ms	10688 KB	Output is correct
12	Correct	2 ms	10588 KB	Output is correct
13	Correct	2 ms	10588 KB	Output is correct
14	Correct	1 ms	10588 KB	Output is correct
15	Correct	1 ms	10588 KB	Output is correct
16	Correct	2 ms	10588 KB	Output is correct
17	Correct	2 ms	10588 KB	Output is correct
18	Correct	2 ms	10588 KB	Output is correct
19	Correct	2 ms	10692 KB	Output is correct
20	Correct	2 ms	10588 KB	Output is correct
21	Correct	2 ms	10588 KB	Output is correct
22	Correct	2 ms	10700 KB	Output is correct
23	Correct	2 ms	10588 KB	Output is correct
24	Correct	2 ms	10588 KB	Output is correct
25	Correct	1 ms	10588 KB	Output is correct
26	Correct	2 ms	10588 KB	Output is correct
27	Correct	2 ms	10588 KB	Output is correct
28	Correct	1 ms	10588 KB	Output is correct
29	Correct	2 ms	10588 KB	Output is correct

Subtask #3
0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	10584 KB	Output is correct
2	Correct	3 ms	10588 KB	Output is correct
3	Correct	2 ms	10584 KB	Output is correct
4	Correct	1 ms	10704 KB	Output is correct
5	Correct	3 ms	10588 KB	Output is correct
6	Correct	1 ms	10704 KB	Output is correct
7	Correct	3 ms	10588 KB	Output is correct
8	Correct	2 ms	10588 KB	Output is correct
9	Correct	2 ms	10588 KB	Output is correct
10	Correct	2 ms	10588 KB	Output is correct
11	Correct	1 ms	10688 KB	Output is correct
12	Correct	2 ms	10588 KB	Output is correct
13	Correct	2 ms	10588 KB	Output is correct
14	Correct	1 ms	10588 KB	Output is correct
15	Correct	1 ms	10588 KB	Output is correct
16	Correct	2 ms	10588 KB	Output is correct
17	Correct	2 ms	10588 KB	Output is correct
18	Correct	2 ms	10588 KB	Output is correct
19	Correct	2 ms	10692 KB	Output is correct
20	Correct	2 ms	10588 KB	Output is correct
21	Correct	2 ms	10588 KB	Output is correct
22	Correct	2 ms	10700 KB	Output is correct
23	Correct	2 ms	10588 KB	Output is correct
24	Correct	2 ms	10588 KB	Output is correct
25	Correct	1 ms	10588 KB	Output is correct
26	Correct	2 ms	10588 KB	Output is correct
27	Correct	2 ms	10588 KB	Output is correct
28	Correct	1 ms	10588 KB	Output is correct
29	Correct	2 ms	10588 KB	Output is correct
30	Correct	350 ms	200184 KB	Output is correct
31	Correct	309 ms	198400 KB	Output is correct
32	Correct	304 ms	200180 KB	Output is correct
33	Incorrect	314 ms	200324 KB	3rd lines differ - on the 1st token, expected: '2121672', found: '842456'
34	Halted	0 ms	0 KB	-

Subtask #4
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	10584 KB	Output is correct
2	Correct	1 ms	10588 KB	Output is correct
3	Correct	2 ms	10588 KB	Output is correct
4	Correct	2 ms	10588 KB	Output is correct
5	Correct	2 ms	10588 KB	Output is correct
6	Correct	2 ms	10588 KB	Output is correct
7	Correct	1 ms	10588 KB	Output is correct
8	Correct	2 ms	10588 KB	Output is correct
9	Correct	2 ms	10588 KB	Output is correct
10	Correct	1 ms	10588 KB	Output is correct
11	Correct	2 ms	10588 KB	Output is correct
12	Correct	2 ms	10588 KB	Output is correct
13	Correct	2 ms	10584 KB	Output is correct
14	Correct	2 ms	10588 KB	Output is correct
15	Correct	2 ms	10692 KB	Output is correct
16	Correct	2 ms	10584 KB	Output is correct
17	Correct	2 ms	10588 KB	Output is correct
18	Correct	2 ms	10588 KB	Output is correct
19	Correct	2 ms	10588 KB	Output is correct
20	Correct	2 ms	10584 KB	Output is correct

Subtask #5
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	10584 KB	Output is correct
2	Correct	3 ms	10588 KB	Output is correct
3	Correct	2 ms	10584 KB	Output is correct
4	Correct	1 ms	10704 KB	Output is correct
5	Correct	3 ms	10588 KB	Output is correct
6	Correct	1 ms	10704 KB	Output is correct
7	Correct	3 ms	10588 KB	Output is correct
8	Correct	2 ms	10588 KB	Output is correct
9	Correct	2 ms	10588 KB	Output is correct
10	Correct	2 ms	10588 KB	Output is correct
11	Correct	1 ms	10688 KB	Output is correct
12	Correct	2 ms	10588 KB	Output is correct
13	Correct	2 ms	10588 KB	Output is correct
14	Correct	1 ms	10588 KB	Output is correct
15	Correct	1 ms	10588 KB	Output is correct
16	Correct	2 ms	10588 KB	Output is correct
17	Correct	2 ms	10588 KB	Output is correct
18	Correct	2 ms	10588 KB	Output is correct
19	Correct	2 ms	10692 KB	Output is correct
20	Correct	2 ms	10588 KB	Output is correct
21	Correct	2 ms	10588 KB	Output is correct
22	Correct	2 ms	10700 KB	Output is correct
23	Correct	2 ms	10588 KB	Output is correct
24	Correct	2 ms	10588 KB	Output is correct
25	Correct	1 ms	10588 KB	Output is correct
26	Correct	2 ms	10588 KB	Output is correct
27	Correct	2 ms	10588 KB	Output is correct
28	Correct	1 ms	10588 KB	Output is correct
29	Correct	2 ms	10588 KB	Output is correct
30	Correct	350 ms	200184 KB	Output is correct
31	Correct	309 ms	198400 KB	Output is correct
32	Correct	304 ms	200180 KB	Output is correct
33	Incorrect	314 ms	200324 KB	3rd lines differ - on the 1st token, expected: '2121672', found: '842456'
34	Halted	0 ms	0 KB	-

답안 #971242

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 10.0 / 10.0

Subtask #3 0 / 28.0

Subtask #4 20.0 / 20.0

Subtask #5 0 / 30.0

Subtask #1
12.0 / 12.0

Subtask #2
10.0 / 10.0

Subtask #3
0 / 28.0

Subtask #4
20.0 / 20.0

Subtask #5
0 / 30.0