답안 #309826

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
309826	2020-10-04T15:34:51 Z	CaroLinda	고대 책들 (IOI17_books)	C++14	50 / 100	462 ms	30856 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)

int bit[MAX] ;
void upd(int pos, int val)
{
	if(pos == 0 ) return ;

	for(int i = pos ; i < MAX ; i += (i&-i) )
		bit[i] = max(bit[i] , val) ;
}
int qry(int pos)
{
	if(pos == 0) return -1 ;

	int tot = -1 ;
	for(int i = pos ; i > 0 ; i -= (i&-i) )
		tot = max(tot, bit[i]);
	return tot ;
}


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 ;

	upd( intervalo[s].ff+1 , 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( qry(x) >= x )
				adj.push_back(make_pair(x-1,0)) ;
			else adj.push_back(make_pair(x-1, 1)) ;
		}
		if(x+1 < n)
		{
			if( qry(x+1) >= x+1)
				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 ));
			upd( intervalo[y].ff+1, intervalo[y].ss ) ;

		}

	}

	ll toSum = dist[L] + dist[R] ;

	for(int i = L ; i <= s ; i++ )
		if(intervalo[i].ss >= s)
		{
			toSum -= dist[i] ;
			break ;
		}

	return ans + 2LL*toSum ;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

#	결과	실행 시간	메모리	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	Correct	1 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 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	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	447 ms	27112 KB	Output is correct
31	Correct	462 ms	28928 KB	Output is correct
32	Correct	308 ms	26744 KB	Output is correct
33	Correct	398 ms	30856 KB	Output is correct
34	Correct	400 ms	30712 KB	Output is correct
35	Correct	399 ms	30712 KB	Output is correct
36	Correct	407 ms	30676 KB	Output is correct
37	Correct	365 ms	30840 KB	Output is correct
38	Correct	369 ms	30584 KB	Output is correct
39	Correct	362 ms	30456 KB	Output is correct
40	Correct	375 ms	28696 KB	Output is correct
41	Correct	396 ms	28292 KB	Output is correct
42	Correct	394 ms	28460 KB	Output is correct
43	Correct	386 ms	30840 KB	Output is correct

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	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	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Incorrect	1 ms	384 KB	3rd lines differ - on the 1st token, expected: '22140', found: '22136'
7	Halted	0 ms	0 KB	-

Subtask #5
0 / 30.0

#	결과	실행 시간	메모리	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	Correct	1 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 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	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	447 ms	27112 KB	Output is correct
31	Correct	462 ms	28928 KB	Output is correct
32	Correct	308 ms	26744 KB	Output is correct
33	Correct	398 ms	30856 KB	Output is correct
34	Correct	400 ms	30712 KB	Output is correct
35	Correct	399 ms	30712 KB	Output is correct
36	Correct	407 ms	30676 KB	Output is correct
37	Correct	365 ms	30840 KB	Output is correct
38	Correct	369 ms	30584 KB	Output is correct
39	Correct	362 ms	30456 KB	Output is correct
40	Correct	375 ms	28696 KB	Output is correct
41	Correct	396 ms	28292 KB	Output is correct
42	Correct	394 ms	28460 KB	Output is correct
43	Correct	386 ms	30840 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	Correct	1 ms	384 KB	Output is correct
48	Correct	1 ms	384 KB	Output is correct
49	Incorrect	1 ms	384 KB	3rd lines differ - on the 1st token, expected: '22140', found: '22136'
50	Halted	0 ms	0 KB	-

답안 #309826

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