oj.uz

Submission #581913

# Submission time Handle Problem Language Result Execution time Memory
581913 2022-06-23T08:02:17 Z Koosha_mv Ancient Books (IOI17_books) C++14
50 / 100
 303 ms 160796 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=2e6+99;
const ll inf=1e15;
 
int n,vis[N],mx1[N],mx2[N],mn1[N],mn2[N];
ll Max[N],dist[N];
queue<int> Q;
vector<int> vec,prt[N];
vector<pair<int,int>> g[N];
 
ll minimum_walk(vector<int> p, int s){
	ll 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;
	s-=l;
	f(i,l,r+1) vec.pb(p[i]-l);
	p=vec;
	n=p.size();
	int mx=0;
	l=0,r=n-1;
	f(i,0,s){
		maxm(mx,p[i]);
		if(mx==i){
			ans+=2;
			l=i+1;
		}
	}
	int mn=n;
	f_(i,n-1,s+1){
		minm(mn,p[i]);
		if(mn==i){
			ans+=2;
			r=i-1;
		}
	}
	if(l==r) return sum+ans;
	vec.clear(); s-=l;
	f(i,l,r+1) vec.pb(p[i]-l);
	p=vec;
	n=p.size();
	f(i,0,n){
		g[i].pb({p[i],0});
	}
	f_(i,s,1){
		g[i].pb({i-1,1});
		g[i-1].pb({i,0});
	}
	f(i,s,n-1){
		g[i].pb({i+1,1});
		g[i+1].pb({i,0});
	}
	prt[0].pb(s);
	f(i,0,n) dist[i]=(i==s ? 0 : N);
	f(i,0,n){
		for(auto u : prt[i]){
			if(dist[i]<i) continue ;
			for(auto [v,w] : g[u]){
				if(dist[u]+w<dist[v]){
					dist[v]=dist[u]+w;
					prt[dist[v]].pb(v);
				}
			}
		}
	}
	return ans+sum+2ll*dist[0];
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:86:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   86 |    for(auto [v,w] : g[u]){
      |             ^

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 94232 KB Output is correct
2 Correct 48 ms 94212 KB Output is correct
3 Correct 55 ms 94216 KB Output is correct
4 Correct 43 ms 94156 KB Output is correct
5 Correct 44 ms 94144 KB Output is correct
6 Correct 47 ms 94152 KB Output is correct
7 Correct 44 ms 94164 KB Output is correct
8 Correct 53 ms 94228 KB Output is correct
9 Correct 47 ms 94184 KB Output is correct
10 Correct 45 ms 94216 KB Output is correct
11 Correct 44 ms 94156 KB Output is correct
12 Correct 47 ms 94120 KB Output is correct
13 Correct 45 ms 94188 KB Output is correct
14 Correct 45 ms 94180 KB Output is correct
15 Correct 49 ms 94180 KB Output is correct
16 Correct 45 ms 94156 KB Output is correct
17 Correct 51 ms 94224 KB Output is correct
18 Correct 47 ms 94124 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 94232 KB Output is correct
2 Correct 48 ms 94212 KB Output is correct
3 Correct 55 ms 94216 KB Output is correct
4 Correct 43 ms 94156 KB Output is correct
5 Correct 44 ms 94144 KB Output is correct
6 Correct 47 ms 94152 KB Output is correct
7 Correct 44 ms 94164 KB Output is correct
8 Correct 53 ms 94228 KB Output is correct
9 Correct 47 ms 94184 KB Output is correct
10 Correct 45 ms 94216 KB Output is correct
11 Correct 44 ms 94156 KB Output is correct
12 Correct 47 ms 94120 KB Output is correct
13 Correct 45 ms 94188 KB Output is correct
14 Correct 45 ms 94180 KB Output is correct
15 Correct 49 ms 94180 KB Output is correct
16 Correct 45 ms 94156 KB Output is correct
17 Correct 51 ms 94224 KB Output is correct
18 Correct 47 ms 94124 KB Output is correct
19 Correct 46 ms 94284 KB Output is correct
20 Correct 45 ms 94228 KB Output is correct
21 Correct 46 ms 94192 KB Output is correct
22 Correct 43 ms 94224 KB Output is correct
23 Correct 49 ms 94120 KB Output is correct
24 Correct 46 ms 94156 KB Output is correct
25 Correct 47 ms 94124 KB Output is correct
26 Correct 52 ms 94220 KB Output is correct
27 Correct 45 ms 94156 KB Output is correct
28 Correct 44 ms 94240 KB Output is correct
29 Correct 44 ms 94284 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 94232 KB Output is correct
2 Correct 48 ms 94212 KB Output is correct
3 Correct 55 ms 94216 KB Output is correct
4 Correct 43 ms 94156 KB Output is correct
5 Correct 44 ms 94144 KB Output is correct
6 Correct 47 ms 94152 KB Output is correct
7 Correct 44 ms 94164 KB Output is correct
8 Correct 53 ms 94228 KB Output is correct
9 Correct 47 ms 94184 KB Output is correct
10 Correct 45 ms 94216 KB Output is correct
11 Correct 44 ms 94156 KB Output is correct
12 Correct 47 ms 94120 KB Output is correct
13 Correct 45 ms 94188 KB Output is correct
14 Correct 45 ms 94180 KB Output is correct
15 Correct 49 ms 94180 KB Output is correct
16 Correct 45 ms 94156 KB Output is correct
17 Correct 51 ms 94224 KB Output is correct
18 Correct 47 ms 94124 KB Output is correct
19 Correct 46 ms 94284 KB Output is correct
20 Correct 45 ms 94228 KB Output is correct
21 Correct 46 ms 94192 KB Output is correct
22 Correct 43 ms 94224 KB Output is correct
23 Correct 49 ms 94120 KB Output is correct
24 Correct 46 ms 94156 KB Output is correct
25 Correct 47 ms 94124 KB Output is correct
26 Correct 52 ms 94220 KB Output is correct
27 Correct 45 ms 94156 KB Output is correct
28 Correct 44 ms 94240 KB Output is correct
29 Correct 44 ms 94284 KB Output is correct
30 Correct 270 ms 160796 KB Output is correct
31 Correct 303 ms 160772 KB Output is correct
32 Correct 125 ms 101996 KB Output is correct
33 Correct 153 ms 106300 KB Output is correct
34 Correct 173 ms 106200 KB Output is correct
35 Correct 148 ms 106296 KB Output is correct
36 Correct 142 ms 106200 KB Output is correct
37 Correct 143 ms 106200 KB Output is correct
38 Correct 144 ms 106196 KB Output is correct
39 Correct 142 ms 106216 KB Output is correct
40 Correct 134 ms 106572 KB Output is correct
41 Correct 204 ms 120276 KB Output is correct
42 Correct 198 ms 106216 KB Output is correct
43 Correct 264 ms 160732 KB Output is correct

Subtask #4
0 / 20.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 94232 KB Output is correct
2 Correct 48 ms 94212 KB Output is correct
3 Correct 55 ms 94216 KB Output is correct
4 Correct 43 ms 94156 KB Output is correct
5 Correct 44 ms 94144 KB Output is correct
6 Correct 47 ms 94152 KB Output is correct
7 Correct 44 ms 94164 KB Output is correct
8 Correct 53 ms 94228 KB Output is correct
9 Correct 47 ms 94184 KB Output is correct
10 Correct 45 ms 94216 KB Output is correct
11 Correct 44 ms 94156 KB Output is correct
12 Correct 47 ms 94120 KB Output is correct
13 Correct 45 ms 94188 KB Output is correct
14 Correct 45 ms 94180 KB Output is correct
15 Correct 49 ms 94180 KB Output is correct
16 Correct 45 ms 94156 KB Output is correct
17 Correct 51 ms 94224 KB Output is correct
18 Correct 47 ms 94124 KB Output is correct
19 Correct 46 ms 94284 KB Output is correct
20 Correct 45 ms 94228 KB Output is correct
21 Correct 46 ms 94192 KB Output is correct
22 Correct 43 ms 94224 KB Output is correct
23 Correct 49 ms 94120 KB Output is correct
24 Correct 46 ms 94156 KB Output is correct
25 Correct 47 ms 94124 KB Output is correct
26 Correct 52 ms 94220 KB Output is correct
27 Correct 45 ms 94156 KB Output is correct
28 Correct 44 ms 94240 KB Output is correct
29 Correct 44 ms 94284 KB Output is correct
30 Correct 270 ms 160796 KB Output is correct
31 Correct 303 ms 160772 KB Output is correct
32 Correct 125 ms 101996 KB Output is correct
33 Correct 153 ms 106300 KB Output is correct
34 Correct 173 ms 106200 KB Output is correct
35 Correct 148 ms 106296 KB Output is correct
36 Correct 142 ms 106200 KB Output is correct
37 Correct 143 ms 106200 KB Output is correct
38 Correct 144 ms 106196 KB Output is correct
39 Correct 142 ms 106216 KB Output is correct
40 Correct 134 ms 106572 KB Output is correct
41 Correct 204 ms 120276 KB Output is correct
42 Correct 198 ms 106216 KB Output is correct
43 Correct 264 ms 160732 KB Output is correct
44 Incorrect 53 ms 94228 KB 3rd lines differ - on the 1st token, expected: '3304', found: '4002942'
45 Halted 0 ms 0 KB -