Submission #307585

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
307585	2020-09-28T17:53:05 Z	CaroLinda	Ancient Books (IOI17_books)	C++14	50 / 100	604 ms	19964 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())

using namespace std ;

long long minimum_walk(vector<int> p, int S) 
{

	int n = sz(p) ;
	long long ans = 0 ;
	int l = 0 , r = n-1 ;

	while( l < n && p[l] == l ) l++ ;
	while( r > S && p[r] == r ) r-- ;

	if(l == n) return 0LL ;

	if( l > S ) ans += 2LL * ( l - S ) ;

	set<int> s ;
	s.insert( p[l] ) ;

	for(int i = l+1 ; i <= r ; i++ )
	{

		while( sz(s) )
		{
			auto it = s.begin() ;

			if( *it <= i-1 ) s.erase(it) ;
			else break ;
		}


		//Sobre a aresta i-1 -> i
		ans += max(2LL, 2LL*sz(s) ) ;
		s.insert( p[i] ) ;

	}

	return ans ;
}

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	0 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 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	1 ms	256 KB	Output is correct
16	Correct	1 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	0 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 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	1 ms	256 KB	Output is correct
16	Correct	1 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	256 KB	Output is correct
22	Correct	1 ms	256 KB	Output is correct
23	Correct	1 ms	256 KB	Output is correct
24	Correct	1 ms	256 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	256 KB	Output is correct
28	Correct	1 ms	384 KB	Output is correct
29	Correct	1 ms	256 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	0 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 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	1 ms	256 KB	Output is correct
16	Correct	1 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	256 KB	Output is correct
22	Correct	1 ms	256 KB	Output is correct
23	Correct	1 ms	256 KB	Output is correct
24	Correct	1 ms	256 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	256 KB	Output is correct
28	Correct	1 ms	384 KB	Output is correct
29	Correct	1 ms	256 KB	Output is correct
30	Correct	604 ms	19964 KB	Output is correct
31	Correct	592 ms	19832 KB	Output is correct
32	Correct	153 ms	8184 KB	Output is correct
33	Correct	237 ms	8184 KB	Output is correct
34	Correct	217 ms	8184 KB	Output is correct
35	Correct	217 ms	8256 KB	Output is correct
36	Correct	227 ms	8184 KB	Output is correct
37	Correct	258 ms	8184 KB	Output is correct
38	Correct	283 ms	8184 KB	Output is correct
39	Correct	279 ms	8252 KB	Output is correct
40	Correct	312 ms	8952 KB	Output is correct
41	Correct	449 ms	14200 KB	Output is correct
42	Correct	402 ms	12792 KB	Output is correct
43	Correct	227 ms	8184 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	256 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
2	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	0 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 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	1 ms	256 KB	Output is correct
16	Correct	1 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	256 KB	Output is correct
22	Correct	1 ms	256 KB	Output is correct
23	Correct	1 ms	256 KB	Output is correct
24	Correct	1 ms	256 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	256 KB	Output is correct
28	Correct	1 ms	384 KB	Output is correct
29	Correct	1 ms	256 KB	Output is correct
30	Correct	604 ms	19964 KB	Output is correct
31	Correct	592 ms	19832 KB	Output is correct
32	Correct	153 ms	8184 KB	Output is correct
33	Correct	237 ms	8184 KB	Output is correct
34	Correct	217 ms	8184 KB	Output is correct
35	Correct	217 ms	8256 KB	Output is correct
36	Correct	227 ms	8184 KB	Output is correct
37	Correct	258 ms	8184 KB	Output is correct
38	Correct	283 ms	8184 KB	Output is correct
39	Correct	279 ms	8252 KB	Output is correct
40	Correct	312 ms	8952 KB	Output is correct
41	Correct	449 ms	14200 KB	Output is correct
42	Correct	402 ms	12792 KB	Output is correct
43	Correct	227 ms	8184 KB	Output is correct
44	Incorrect	1 ms	256 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-

Submission #307585

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