Submission #307583

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
307583	2020-09-28T17:42:28 Z	CaroLinda	Ancient Books (IOI17_books)	C++14	50 / 100	630 ms	26760 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) 
{

	assert( S == 0 ) ;

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

	for(l = 0 ; l < n ; l++ )
	{
		if(p[l] == l) ans += 2LL ;
		else break ;
	}

	if(l == n) return 0 ;

	for(r = n-1 ; r>= 0 ; r-- )
		if( p[r] != r ) break ;

	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	384 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	1 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	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	1 ms	384 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	0 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	0 ms	256 KB	Output is correct
17	Correct	1 ms	256 KB	Output is correct
18	Correct	1 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	384 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	1 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	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	1 ms	384 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	0 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	0 ms	256 KB	Output is correct
17	Correct	1 ms	256 KB	Output is correct
18	Correct	1 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	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	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	384 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	1 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	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	1 ms	384 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	0 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	0 ms	256 KB	Output is correct
17	Correct	1 ms	256 KB	Output is correct
18	Correct	1 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	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	256 KB	Output is correct
30	Correct	630 ms	26760 KB	Output is correct
31	Correct	624 ms	26692 KB	Output is correct
32	Correct	153 ms	14840 KB	Output is correct
33	Correct	222 ms	14840 KB	Output is correct
34	Correct	217 ms	14840 KB	Output is correct
35	Correct	217 ms	14840 KB	Output is correct
36	Correct	244 ms	14968 KB	Output is correct
37	Correct	267 ms	14968 KB	Output is correct
38	Correct	288 ms	14968 KB	Output is correct
39	Correct	282 ms	15096 KB	Output is correct
40	Correct	315 ms	15480 KB	Output is correct
41	Correct	434 ms	20984 KB	Output is correct
42	Correct	392 ms	19664 KB	Output is correct
43	Correct	231 ms	14968 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1 ms	512 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
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	384 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	1 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	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	1 ms	384 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	0 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	0 ms	256 KB	Output is correct
17	Correct	1 ms	256 KB	Output is correct
18	Correct	1 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	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	256 KB	Output is correct
30	Correct	630 ms	26760 KB	Output is correct
31	Correct	624 ms	26692 KB	Output is correct
32	Correct	153 ms	14840 KB	Output is correct
33	Correct	222 ms	14840 KB	Output is correct
34	Correct	217 ms	14840 KB	Output is correct
35	Correct	217 ms	14840 KB	Output is correct
36	Correct	244 ms	14968 KB	Output is correct
37	Correct	267 ms	14968 KB	Output is correct
38	Correct	288 ms	14968 KB	Output is correct
39	Correct	282 ms	15096 KB	Output is correct
40	Correct	315 ms	15480 KB	Output is correct
41	Correct	434 ms	20984 KB	Output is correct
42	Correct	392 ms	19664 KB	Output is correct
43	Correct	231 ms	14968 KB	Output is correct
44	Runtime error	1 ms	512 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
45	Halted	0 ms	0 KB	-

Submission #307583

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