oj.uz

Submission #299767

# Submission time Handle Problem Language Result Execution time Memory
299767 2020-09-15T15:12:34 Z errorgorn Ancient Books (IOI17_books) C++14
50 / 100
 207 ms 24292 KB 
#include "books.h"

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ii pair<int,int>
#define fi first
#define se second

#define rep(x,s,e) for (auto x=(s)-((s)>(e));x!=(e)-((s)>(e));((s)<(e)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int) (x).size()

int n;
vector<int> arr;

int fwd[1000005];
vector<int> imp;

long long minimum_walk(std::vector<int> p, int s) {
	n=sz(p);
	arr=p;
	
	rep(x,0,n){
		if (x<arr[x]){
			fwd[x]++,fwd[arr[x]]--;
			imp.push_back(x);
			imp.push_back(arr[x]);
		}
		else if (arr[x]<x){
			imp.push_back(x);
			imp.push_back(arr[x]);
		}
	}
	
	if (imp.empty()) return 0;
	
	rep(x,0,n) fwd[x+1]+=fwd[x];
	
	int l=0,r=n-1;
	while (fwd[l]==0) l++;
	while (fwd[r]==0) r--;
	
	ll ans=1e9;
	for (auto &it:imp) ans=min(ans,(ll)abs(s-it));
	
	rep(x,l,r+1){
		ans+=max(fwd[x],1);
	}
	
	return ans*2;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 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 416 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 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 1 ms 288 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 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 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 416 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 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 1 ms 288 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 416 KB Output is correct
20 Correct 1 ms 288 KB Output is correct
21 Correct 1 ms 416 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 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 416 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 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 1 ms 288 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 416 KB Output is correct
20 Correct 1 ms 288 KB Output is correct
21 Correct 1 ms 416 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 193 ms 24292 KB Output is correct
31 Correct 207 ms 24292 KB Output is correct
32 Correct 143 ms 12280 KB Output is correct
33 Correct 167 ms 20016 KB Output is correct
34 Correct 163 ms 20068 KB Output is correct
35 Correct 163 ms 23524 KB Output is correct
36 Correct 168 ms 23208 KB Output is correct
37 Correct 173 ms 23848 KB Output is correct
38 Correct 182 ms 23904 KB Output is correct
39 Correct 174 ms 24032 KB Output is correct
40 Correct 180 ms 23904 KB Output is correct
41 Correct 197 ms 23904 KB Output is correct
42 Correct 204 ms 24032 KB Output is correct
43 Correct 164 ms 20068 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 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 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 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 416 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 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 1 ms 288 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 416 KB Output is correct
20 Correct 1 ms 288 KB Output is correct
21 Correct 1 ms 416 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 193 ms 24292 KB Output is correct
31 Correct 207 ms 24292 KB Output is correct
32 Correct 143 ms 12280 KB Output is correct
33 Correct 167 ms 20016 KB Output is correct
34 Correct 163 ms 20068 KB Output is correct
35 Correct 163 ms 23524 KB Output is correct
36 Correct 168 ms 23208 KB Output is correct
37 Correct 173 ms 23848 KB Output is correct
38 Correct 182 ms 23904 KB Output is correct
39 Correct 174 ms 24032 KB Output is correct
40 Correct 180 ms 23904 KB Output is correct
41 Correct 197 ms 23904 KB Output is correct
42 Correct 204 ms 24032 KB Output is correct
43 Correct 164 ms 20068 KB Output is correct
44 Incorrect 1 ms 384 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45 Halted 0 ms 0 KB -