Submission #355285

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
355285	2021-01-22T11:11:35 Z	Kerim	Ancient Books (IOI17_books)	C++17	42 / 100	268 ms	17260 KB

books

#include "books.h"
#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N=1004;
int dp[N][N];
int L[MAXN],R[MAXN],bel[MAXN],S;
int destL,destR;
PII extend(int l,int r){
	int lp=l,rp=r;
	if(bel[l])umin(lp,L[bel[l]]),umax(rp,R[bel[l]]);
	if(bel[r])umin(lp,L[bel[r]]),umax(rp,R[bel[r]]);
	while(1){	
		if(l>lp){
			if(bel[--l])
				umin(lp,L[bel[l]]),umax(rp,R[bel[l]]);	
		}
		else if(r<rp){
			if(bel[++r])
				umin(lp,L[bel[r]]),umax(rp,R[bel[r]]);	
		}
		else
			break;
	}
	return mp(l,r);
}
int rec(int l,int r){
	if(l<destL or r>destR)return INF;
	PII tmp=extend(l,r);
	l=tmp.ff;r=tmp.ss;
	if(l==destL and r==destR)return 0;
	int &ret=dp[l][r];
	if(~ret)return ret;
	return ret=min(rec(l-1,r),rec(l,r+1))+2;
}
long long minimum_walk(vector<int> p, int s) {
	memset(dp,-1,sizeof dp);
	int n=int(p.size());
	vector<int>vis(n);
	destL=destR=s;
	ll res=0;
	for(int i=0;i<n;i++){
		res+=abs(p[i]-i);
		if(p[i]!=i and !vis[i]){
			int to=i;L[++S]=i;
			do{
				umax(R[S],to);bel[to]=S;
				vis[to]=1;to=p[to];
			}while(to!=i);
			umin(destL,L[S]);umax(destR,R[S]);
		} 
	}
	if(n<N)
		return rec(s,s)+res;
	vector<PII>v;
	for(int i=1;i<=S;i++)
		v.pb(mp(L[i],R[i]));
	sort(all(v));
	int last=s;
	for(int i=0;i<int(v.size());i++)
		res+=max(0,v[i].ff-last)*2,umax(last,v[i].ss);
	return res;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	4332 KB	Output is correct
2	Correct	3 ms	4332 KB	Output is correct
3	Correct	3 ms	4332 KB	Output is correct
4	Correct	3 ms	4332 KB	Output is correct
5	Correct	3 ms	4332 KB	Output is correct
6	Correct	3 ms	4332 KB	Output is correct
7	Correct	3 ms	4332 KB	Output is correct
8	Correct	3 ms	4332 KB	Output is correct
9	Correct	3 ms	4204 KB	Output is correct
10	Correct	3 ms	4332 KB	Output is correct
11	Correct	3 ms	4204 KB	Output is correct
12	Correct	3 ms	4332 KB	Output is correct
13	Correct	3 ms	4224 KB	Output is correct
14	Correct	3 ms	4204 KB	Output is correct
15	Correct	3 ms	4332 KB	Output is correct
16	Correct	3 ms	4332 KB	Output is correct
17	Correct	3 ms	4332 KB	Output is correct
18	Correct	3 ms	4332 KB	Output is correct
19	Correct	3 ms	4332 KB	Output is correct
20	Correct	3 ms	4332 KB	Output is correct
21	Correct	3 ms	4332 KB	Output is correct
22	Correct	3 ms	4332 KB	Output is correct
23	Correct	3 ms	4332 KB	Output is correct
24	Correct	3 ms	4332 KB	Output is correct
25	Correct	4 ms	4332 KB	Output is correct
26	Correct	3 ms	4332 KB	Output is correct
27	Correct	3 ms	4332 KB	Output is correct
28	Correct	3 ms	4332 KB	Output is correct
29	Correct	3 ms	4332 KB	Output is correct
30	Incorrect	268 ms	17260 KB	3rd lines differ - on the 1st token, expected: '333035179244', found: '333035179248'
31	Halted	0 ms	0 KB	-

Subtask #4
20.0 / 20.0

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

Subtask #5
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	4332 KB	Output is correct
2	Correct	3 ms	4332 KB	Output is correct
3	Correct	3 ms	4332 KB	Output is correct
4	Correct	3 ms	4332 KB	Output is correct
5	Correct	3 ms	4332 KB	Output is correct
6	Correct	3 ms	4332 KB	Output is correct
7	Correct	3 ms	4332 KB	Output is correct
8	Correct	3 ms	4332 KB	Output is correct
9	Correct	3 ms	4204 KB	Output is correct
10	Correct	3 ms	4332 KB	Output is correct
11	Correct	3 ms	4204 KB	Output is correct
12	Correct	3 ms	4332 KB	Output is correct
13	Correct	3 ms	4224 KB	Output is correct
14	Correct	3 ms	4204 KB	Output is correct
15	Correct	3 ms	4332 KB	Output is correct
16	Correct	3 ms	4332 KB	Output is correct
17	Correct	3 ms	4332 KB	Output is correct
18	Correct	3 ms	4332 KB	Output is correct
19	Correct	3 ms	4332 KB	Output is correct
20	Correct	3 ms	4332 KB	Output is correct
21	Correct	3 ms	4332 KB	Output is correct
22	Correct	3 ms	4332 KB	Output is correct
23	Correct	3 ms	4332 KB	Output is correct
24	Correct	3 ms	4332 KB	Output is correct
25	Correct	4 ms	4332 KB	Output is correct
26	Correct	3 ms	4332 KB	Output is correct
27	Correct	3 ms	4332 KB	Output is correct
28	Correct	3 ms	4332 KB	Output is correct
29	Correct	3 ms	4332 KB	Output is correct
30	Incorrect	268 ms	17260 KB	3rd lines differ - on the 1st token, expected: '333035179244', found: '333035179248'
31	Halted	0 ms	0 KB	-

Submission #355285

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