Submission #99533

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
99533	2019-03-04T17:28:32 Z	MvC	Ancient Books (IOI17_books)	C++11	50 / 100	291 ms	26472 KB

books

#pragma GCC optimize("O3")
#include "books.h"
#include<bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=1e6+50;
const int mod=1e9+7;
using namespace std;
int n,s,p[nmax],mn,mx,t,i,st[nmax],v[nmax],j;
ll ans,nr;
ll minimum_walk(vector<int>x,int s)
{
	n=(int)x.size();
	for(i=1;i<=n;i++)p[i]=x[i-1]+1;
	for(i=1;i<=n;i++)ans+=1LL*abs(i-p[i]);
	for(i=1;i<=n;i++)
	{
		if(v[p[i]])continue;
		j=p[i];
		mn=1e9,mx=-1;
		while(!v[j])
		{
			v[j]=1;
			mn=min(mn,j);
			mx=max(mx,j);
			j=p[j];
		}
		st[mn]=mx;
		if(mn!=mx)t=max(t,mx);
	}
	mx=-1;
	for(i=1;i<=t;i++)
	{
		mx=max(mx,st[i]);
		if(i==mx)ans+=2LL;
	}
	if(!t)return 0LL;
	return ans-2LL;
}
/*int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n>>s;
	for(i=1;i<=n;i++)cin>>p[i];
	for(i=1;i<=n;i++)ans+=abs(i-p[i]);
	for(i=1;i<=n;i++)
	{
		if(v[p[i]])continue;
		j=p[i];
		mn=1e9,mx=-1;
		while(!v[j])
		{
			v[j]=1;
			mn=min(mn,j);
			mx=max(mx,j);
			j=p[j];
		}
		st[mn]=mx;
		t=max(t,mx);
	}
	mx=st[1];
	for(i=1;i<=t;i++)
	{
		if(mx<st[i])nr++;
		mx=max(mx,st[i]);
	}
	cout<<ans+2*nr<<endl;
    return 0;
}
/*
4 1
1 3 4 2
*/

Compilation message

books.cpp:82:1: warning: "/*" within comment [-Wcomment]
 /*

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	3 ms	356 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	3 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	3 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	3 ms	384 KB	Output is correct
16	Correct	3 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	384 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	2 ms	384 KB	Output is correct
21	Correct	4 ms	384 KB	Output is correct
22	Correct	2 ms	384 KB	Output is correct
23	Correct	2 ms	384 KB	Output is correct
24	Correct	3 ms	384 KB	Output is correct
25	Correct	2 ms	384 KB	Output is correct
26	Correct	3 ms	384 KB	Output is correct
27	Correct	2 ms	384 KB	Output is correct
28	Correct	2 ms	384 KB	Output is correct
29	Correct	2 ms	384 KB	Output is correct
30	Correct	267 ms	22620 KB	Output is correct
31	Correct	273 ms	22528 KB	Output is correct
32	Correct	154 ms	26440 KB	Output is correct
33	Correct	179 ms	26472 KB	Output is correct
34	Correct	138 ms	26360 KB	Output is correct
35	Correct	139 ms	26360 KB	Output is correct
36	Correct	164 ms	26328 KB	Output is correct
37	Correct	207 ms	26360 KB	Output is correct
38	Correct	291 ms	25848 KB	Output is correct
39	Correct	162 ms	25592 KB	Output is correct
40	Correct	180 ms	23416 KB	Output is correct
41	Correct	187 ms	20728 KB	Output is correct
42	Correct	188 ms	22756 KB	Output is correct
43	Correct	209 ms	26360 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	384 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	3 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	3 ms	356 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	3 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	3 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	3 ms	384 KB	Output is correct
16	Correct	3 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	384 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	2 ms	384 KB	Output is correct
21	Correct	4 ms	384 KB	Output is correct
22	Correct	2 ms	384 KB	Output is correct
23	Correct	2 ms	384 KB	Output is correct
24	Correct	3 ms	384 KB	Output is correct
25	Correct	2 ms	384 KB	Output is correct
26	Correct	3 ms	384 KB	Output is correct
27	Correct	2 ms	384 KB	Output is correct
28	Correct	2 ms	384 KB	Output is correct
29	Correct	2 ms	384 KB	Output is correct
30	Correct	267 ms	22620 KB	Output is correct
31	Correct	273 ms	22528 KB	Output is correct
32	Correct	154 ms	26440 KB	Output is correct
33	Correct	179 ms	26472 KB	Output is correct
34	Correct	138 ms	26360 KB	Output is correct
35	Correct	139 ms	26360 KB	Output is correct
36	Correct	164 ms	26328 KB	Output is correct
37	Correct	207 ms	26360 KB	Output is correct
38	Correct	291 ms	25848 KB	Output is correct
39	Correct	162 ms	25592 KB	Output is correct
40	Correct	180 ms	23416 KB	Output is correct
41	Correct	187 ms	20728 KB	Output is correct
42	Correct	188 ms	22756 KB	Output is correct
43	Correct	209 ms	26360 KB	Output is correct
44	Incorrect	2 ms	384 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-

Submission #99533

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