Submission #309836

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
309836	2020-10-04T16:29:21 Z	CaroLinda	Ancient Books (IOI17_books)	C++14	50 / 100	348 ms	22148 KB

books

#include "books.h"
#include <bits/stdc++.h>
 
#define debug printf
#define lp(i,a,b) for(int i = a ; i < b; i++)
#define pb push_back
#define ff first
#define ss second
#define mk make_pair
#define pii pair<int,int>
#define ll long long 
#define all(x) x.begin(),x.end()
#define sz(x) (int)(x.size())
 
const int MAX = 1e6+10 ;
 
using namespace std ;
 
//Tentando uma ideia (provavelmente vai dar errado mas vamos nessa)
 
 
long long minimum_walk(vector<int> p, int s) 
{
 
	int n = sz(p) ;
	ll ans = 0LL ;
 
	lp(i,0,n) ans += (ll)(abs(p[i]-i)) ;
 
	int L = 0  ;
	int R = n-1 ;
 
	while(L < s && p[L] == L ) L++ ;
	while(R > s && p[R] == R) R-- ;
 
	vector<bool> vis( n, false ) ;
	vector<pii> intervalo(n, make_pair(-1,-1) ) ;
 
	for(int i = L ; i <= R ; i++ )
	{
		if(vis[i]) continue ;
 
		vector<int> List ;
 
		int x = i , l = i , r = i;
		while(!vis[x])
		{
			vis[x] = true ;
			List.push_back(x) ;
			
			l = min(l,x) ;
			r = max(r,x) ;
 
			x = p[x] ;
		}
 
		for(auto e : List ) intervalo[e] = make_pair(l,r) ;
 
	}
 
	vector<int> dist(n, n+5 ) ;
	priority_queue< pii , vector<pii> , greater<pii> > fila ;
 
	fila.push(make_pair(0,s)) ;
	dist[s] = 0 ;
 
	int l = intervalo[s].ff ;
	int r = intervalo[s].ss ;

 
	while(!fila.empty())
	{
		int x = fila.top().ss ;
		int d = fila.top().ff ;
		fila.pop() ;
 
		if(dist[x] != d) continue ;
 
		vector<pii> adj ;
 
		if(x)
		{
			if( x-1 >= l && x <= r )
				adj.push_back(make_pair(x-1,0)) ;
			else adj.push_back(make_pair(x-1, 1)) ;
		}
		if(x+1 < n)
		{
			if( x >= l && x+1 <= r )
				adj.push_back(make_pair(x+1, 0)); 
			else adj.push_back(make_pair(x+1, 1 ) ) ;
		}
 
		for(auto e : adj)
		{
			int y = e.ff ;
			int cost = e.ss ;
 
			if(dist[y]<= cost+dist[x]) continue ;
 
			dist[y] = dist[x]+cost ;
 
			fila.push(make_pair(dist[y] , y ));
			l = min(intervalo[y].ff,l);
			r = max(intervalo[y].ss,r );
 
		}
 
	}
 
	ll toSum = dist[L] + dist[R] ;
	ll mx = 0 ;
 
	for(int i = L ; i <= R ; i++ )
		if(intervalo[i].ff <= s && intervalo[i].ss >= s )
			mx = max(mx, (ll)dist[i]) ;

	toSum -= mx ;
 
	return ans + 2LL*toSum ;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	0 ms	256 KB	Output is correct
13	Correct	0 ms	256 KB	Output is correct
14	Correct	0 ms	256 KB	Output is correct
15	Correct	0 ms	256 KB	Output is correct
16	Correct	0 ms	256 KB	Output is correct
17	Correct	0 ms	256 KB	Output is correct
18	Correct	0 ms	256 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	1 ms	384 KB	Output is correct
28	Correct	1 ms	384 KB	Output is correct
29	Correct	1 ms	384 KB	Output is correct
30	Correct	344 ms	20328 KB	Output is correct
31	Correct	348 ms	22148 KB	Output is correct
32	Correct	255 ms	19964 KB	Output is correct
33	Correct	309 ms	20088 KB	Output is correct
34	Correct	316 ms	20216 KB	Output is correct
35	Correct	313 ms	19960 KB	Output is correct
36	Correct	304 ms	20088 KB	Output is correct
37	Correct	286 ms	20164 KB	Output is correct
38	Correct	300 ms	20124 KB	Output is correct
39	Correct	287 ms	20028 KB	Output is correct
40	Correct	295 ms	20248 KB	Output is correct
41	Correct	320 ms	21004 KB	Output is correct
42	Correct	311 ms	21040 KB	Output is correct
43	Correct	322 ms	20216 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Incorrect	1 ms	384 KB	3rd lines differ - on the 1st token, expected: '2094', found: '1824'
5	Halted	0 ms	0 KB	-

Subtask #5
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	0 ms	256 KB	Output is correct
13	Correct	0 ms	256 KB	Output is correct
14	Correct	0 ms	256 KB	Output is correct
15	Correct	0 ms	256 KB	Output is correct
16	Correct	0 ms	256 KB	Output is correct
17	Correct	0 ms	256 KB	Output is correct
18	Correct	0 ms	256 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	1 ms	384 KB	Output is correct
28	Correct	1 ms	384 KB	Output is correct
29	Correct	1 ms	384 KB	Output is correct
30	Correct	344 ms	20328 KB	Output is correct
31	Correct	348 ms	22148 KB	Output is correct
32	Correct	255 ms	19964 KB	Output is correct
33	Correct	309 ms	20088 KB	Output is correct
34	Correct	316 ms	20216 KB	Output is correct
35	Correct	313 ms	19960 KB	Output is correct
36	Correct	304 ms	20088 KB	Output is correct
37	Correct	286 ms	20164 KB	Output is correct
38	Correct	300 ms	20124 KB	Output is correct
39	Correct	287 ms	20028 KB	Output is correct
40	Correct	295 ms	20248 KB	Output is correct
41	Correct	320 ms	21004 KB	Output is correct
42	Correct	311 ms	21040 KB	Output is correct
43	Correct	322 ms	20216 KB	Output is correct
44	Correct	1 ms	384 KB	Output is correct
45	Correct	1 ms	384 KB	Output is correct
46	Correct	1 ms	384 KB	Output is correct
47	Incorrect	1 ms	384 KB	3rd lines differ - on the 1st token, expected: '2094', found: '1824'
48	Halted	0 ms	0 KB	-

Submission #309836

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 10.0 / 10.0

Subtask #3 28.0 / 28.0

Subtask #4 0 / 20.0

Subtask #5 0 / 30.0

Subtask #1
12.0 / 12.0

Subtask #2
10.0 / 10.0

Subtask #3
28.0 / 28.0

Subtask #4
0 / 20.0

Subtask #5
0 / 30.0