oj.uz

Submission #114022

# Submission time Handle Problem Language Result Execution time Memory
114022 2019-05-29T15:26:47 Z faustaadp Ancient Books (IOI17_books) C++17
50 / 100
 287 ms 46288 KB 
#include "books.h"
#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
ll n,i,b[1010101],ka[1010101],R,j;
ll K[1010101];
ll nx[1010101];
void dfs(ll aa)
{
	b[aa]=1;
	R=max(R,aa);
	if(!b[nx[aa]])
		dfs(nx[aa]);
}
long long minimum_walk(std::vector<int> x, int s) 
{
	n=x.size();
	ll jaw=0;
	for(i=0;i<n;i++)nx[i]=x[i];
	for(i=0;i<n;i++)jaw+=abs(i-x[i]);
	ll tam=0;
	for(i=0;i<n;i++)
	{
		if(b[i])continue;
		R=0;
		dfs(i);
		ka[i]=R;
	}
	for(i=0;i<n;i++)
	{
		R=ka[i];
		j=i;
		while(j<R)
		{
			j++;
			R=max(R,ka[j]);
		}
		K[i]=j;
		i=j;
	}
	ll nn=-1;
	for(i=(n-1);i>=0;i--)
		if(K[i]!=i)
		{
			nn=i;
			break;
		}
	for(i=0;i<nn;i++)
	{
		if(i!=0)
			tam+=2;
		i=K[i];
	}
//	cout<<jaw<<" "<<tam<<"\n";
	return jaw+tam;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 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 5 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 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 2 ms 384 KB Output is correct
16 Correct 2 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 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 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 5 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 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 2 ms 384 KB Output is correct
16 Correct 2 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 2 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 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 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 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 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 5 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 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 2 ms 384 KB Output is correct
16 Correct 2 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 2 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 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 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 287 ms 30744 KB Output is correct
31 Correct 286 ms 30684 KB Output is correct
32 Correct 148 ms 46200 KB Output is correct
33 Correct 156 ms 46200 KB Output is correct
34 Correct 155 ms 46168 KB Output is correct
35 Correct 157 ms 46200 KB Output is correct
36 Correct 158 ms 46288 KB Output is correct
37 Correct 164 ms 45900 KB Output is correct
38 Correct 162 ms 39032 KB Output is correct
39 Correct 158 ms 38068 KB Output is correct
40 Correct 177 ms 32120 KB Output is correct
41 Correct 223 ms 30840 KB Output is correct
42 Correct 200 ms 30968 KB Output is correct
43 Correct 148 ms 38424 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 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 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 5 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 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 2 ms 384 KB Output is correct
16 Correct 2 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 2 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 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 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 287 ms 30744 KB Output is correct
31 Correct 286 ms 30684 KB Output is correct
32 Correct 148 ms 46200 KB Output is correct
33 Correct 156 ms 46200 KB Output is correct
34 Correct 155 ms 46168 KB Output is correct
35 Correct 157 ms 46200 KB Output is correct
36 Correct 158 ms 46288 KB Output is correct
37 Correct 164 ms 45900 KB Output is correct
38 Correct 162 ms 39032 KB Output is correct
39 Correct 158 ms 38068 KB Output is correct
40 Correct 177 ms 32120 KB Output is correct
41 Correct 223 ms 30840 KB Output is correct
42 Correct 200 ms 30968 KB Output is correct
43 Correct 148 ms 38424 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 -