oj.uz

Submission #581844

# Submission time Handle Problem Language Result Execution time Memory
581844 2022-06-23T07:17:25 Z Koosha_mv Ancient Books (IOI17_books) C++14
42 / 100
 104 ms 24544 KB 
#include "books.h"
#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<x.F<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
 
const int N=1005;
const ll inf=1e15;
 
int n,p[N],vis[N],mx1[N],mx2[N],mn1[N],mn2[N];
ll Max[N],dp[N][N];
 
ll minimum_walk(vector<int> p, int s) {
	fill(mx1,mx1+N,-1);
	fill(mx2,mx2+N,-1);
	fill(mn1,mn1+N,N);
	fill(mn2,mn2+N,N);
	ll mx=0,sum=0,ans=0;
	n=p.size();
	int l=n,r=0;
	f(i,0,n){
		sum+=abs(p[i]-i);
		if(p[i]!=i) minm(l,i),maxm(r,i);
	}
	minm(l,s);
	maxm(r,s);
	if(l==r) return 0;
	vector<int> v;
	f(i,l,r+1) v.pb(p[i]-l);
	p=v;
	n=p.size();
	f_(i,s,0){
		mx1[i]=max(p[i],mx1[i+1]);
		mn1[i]=min(p[i],mn1[i+1]);
	}
	f(i,s,n){
		mx2[i]=p[i];
		mn2[i]=p[i];
		if(i>0){
			maxm(mx2[i],mx2[i-1]);
			minm(mn2[i],mn2[i-1]);
		}
	}
	f(l,0,s+1){
		f_(r,n-1,s){
			if(l==0 && r==n-1) continue ;
			if(min(mn1[l],mn2[r])<l){
				dp[l][r]=dp[min(mn1[l],mn2[r])][r];
				continue ;
			}
			if(r<max(mx1[l],mx2[r])){
				dp[l][r]=dp[l][max(mx1[l],mx2[r])];
				continue ;
			}
			dp[l][r]=inf;
			if(0<l) minm(dp[l][r],dp[l-1][r]+1);
			if(r+1<n) minm(dp[l][r],dp[l][r+1]+1);
			//cout<<l<<" "<<r<<" -> "<<dp[l][r]<<endl;
		}
	}
	//eror(dp[s][s]);
	return 2ll*dp[s][s]+sum;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:35:5: warning: unused variable 'mx' [-Wunused-variable]
   35 |  ll mx=0,sum=0,ans=0;
      |     ^~
books.cpp:35:16: warning: unused variable 'ans' [-Wunused-variable]
   35 |  ll mx=0,sum=0,ans=0;
      |                ^~~

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 28.0

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

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3668 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 3 ms 4564 KB Output is correct
5 Correct 3 ms 4180 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 3 ms 4180 KB Output is correct
8 Correct 3 ms 4284 KB Output is correct
9 Correct 3 ms 4692 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 2 ms 3924 KB Output is correct
12 Correct 3 ms 4308 KB Output is correct
13 Correct 3 ms 4564 KB Output is correct
14 Correct 2 ms 3768 KB Output is correct
15 Correct 3 ms 4540 KB Output is correct
16 Correct 3 ms 3540 KB Output is correct
17 Correct 3 ms 4028 KB Output is correct
18 Correct 2 ms 4308 KB Output is correct
19 Correct 2 ms 4024 KB Output is correct
20 Correct 3 ms 4820 KB Output is correct

Subtask #5
0 / 30.0

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