답안 #309831

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
309831	2020-10-04T16:13:52 Z	CaroLinda	고대 책들 (IOI17_books)	C++14	50 / 100	252 ms	20308 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) ;

	}

	int l = s , r = s ;
	int lmin = intervalo[s].ff, rmax = intervalo[s].ss ;
	ll lastTime = ans ;

	while( !(l <= L && r >= R) )
	{

		while( l > lmin || r < rmax )
		{

			if( l > lmin )
			{
				l-- ;

				if( intervalo[l].ff <= lmin && intervalo[l].ss >= rmax )
					lastTime = ans ;

				lmin = min( lmin , intervalo[l].ff ) ;
				rmax = max(rmax, intervalo[l].ss ) ;
			}

			if(r < rmax )
			{
				r++ ;

				if(intervalo[r].ff <= lmin && intervalo[r].ss >= rmax)
					lastTime = ans ;

				lmin = min(lmin, intervalo[r].ff );
				rmax = max(rmax , intervalo[r].ss ) ;
			}

		}

		//Agora custa

		if( l <= L && r >= R ) break ;

		if(l > L) lmin-- , ans++ ;
		if(r+1 < R ) rmax++ , ans++ ;

	}

	ans += ans - lastTime ;

	return ans ;
}

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	1 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	1 ms	256 KB	Output is correct
13	Correct	0 ms	256 KB	Output is correct
14	Correct	1 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	384 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	1 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	1 ms	256 KB	Output is correct
13	Correct	0 ms	256 KB	Output is correct
14	Correct	1 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	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	0 ms	256 KB	Output is correct
22	Correct	1 ms	256 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	256 KB	Output is correct
26	Correct	1 ms	256 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

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	1 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	1 ms	256 KB	Output is correct
13	Correct	0 ms	256 KB	Output is correct
14	Correct	1 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	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	0 ms	256 KB	Output is correct
22	Correct	1 ms	256 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	256 KB	Output is correct
26	Correct	1 ms	256 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	247 ms	20308 KB	Output is correct
31	Correct	252 ms	18284 KB	Output is correct
32	Correct	153 ms	16192 KB	Output is correct
33	Correct	211 ms	16120 KB	Output is correct
34	Correct	213 ms	16120 KB	Output is correct
35	Correct	212 ms	16248 KB	Output is correct
36	Correct	204 ms	16120 KB	Output is correct
37	Correct	182 ms	16120 KB	Output is correct
38	Correct	187 ms	16188 KB	Output is correct
39	Correct	183 ms	16248 KB	Output is correct
40	Correct	188 ms	16432 KB	Output is correct
41	Correct	213 ms	19248 KB	Output is correct
42	Correct	205 ms	17828 KB	Output is correct
43	Correct	211 ms	16124 KB	Output is correct

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Incorrect	1 ms	384 KB	3rd lines differ - on the 1st token, expected: '5920', found: '6226'
4	Halted	0 ms	0 KB	-

Subtask #5
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	1 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	1 ms	256 KB	Output is correct
13	Correct	0 ms	256 KB	Output is correct
14	Correct	1 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	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	0 ms	256 KB	Output is correct
22	Correct	1 ms	256 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	256 KB	Output is correct
26	Correct	1 ms	256 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	247 ms	20308 KB	Output is correct
31	Correct	252 ms	18284 KB	Output is correct
32	Correct	153 ms	16192 KB	Output is correct
33	Correct	211 ms	16120 KB	Output is correct
34	Correct	213 ms	16120 KB	Output is correct
35	Correct	212 ms	16248 KB	Output is correct
36	Correct	204 ms	16120 KB	Output is correct
37	Correct	182 ms	16120 KB	Output is correct
38	Correct	187 ms	16188 KB	Output is correct
39	Correct	183 ms	16248 KB	Output is correct
40	Correct	188 ms	16432 KB	Output is correct
41	Correct	213 ms	19248 KB	Output is correct
42	Correct	205 ms	17828 KB	Output is correct
43	Correct	211 ms	16124 KB	Output is correct
44	Correct	1 ms	256 KB	Output is correct
45	Correct	1 ms	256 KB	Output is correct
46	Incorrect	1 ms	384 KB	3rd lines differ - on the 1st token, expected: '5920', found: '6226'
47	Halted	0 ms	0 KB	-

답안 #309831

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