답안 #596682

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
596682	2022-07-15T01:14:02 Z	farhan132	고대 책들 (IOI17_books)	C++17	50 / 100	139 ms	40188 KB

books

#include "books.h"
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<ll , ll> ii;
 
#define ff first
#define ss second
#define pb push_back
#define in insert

long long minimum_walk(std::vector<int> p, int s) {

	 ll n = p.size();

	 vector < ll > vis(n, 0);
	 ll ans = 0;
	 while(n > 0 && p[n-1] == n-1){
	 	n--;
	 }
	 if(n == 0) return 0;
	 ll l = 0;
	 while(p[l] == l) l++;
	 ll r = n - 1; ll mx = l;

	 if(s < l){
	 	ans += 2*abs(l - s); l = s;
	 }
	 if(s > r){
	 	ans += 2*abs(r - s); r = s;
	 }
	 vector < ll > P(n + 2, -1), dist(n + 2, 0);
	 vector < ll > st; st.pb(l); P[l] = l; dist[l] = l;
	 for(ll i = l; i <= r; i++){
	 	if(vis[i]) continue;
	 	ll c = i; 
	 	ll _mx = c;
	 	while(!vis[c]){
	 		vis[c] = 1;
	 		_mx = max(_mx, c);
	 		ans += abs(p[c] - c); c = p[c];
	 	}
	 	if(mx < i){
	 		P[i] = i;
	 		dist[i] = _mx;
	 		st.pb(i);
	 	}else{
	 		if(i != l) P[i] = P[i - 1];
	 		dist[P[i]] = max(dist[P[i]], _mx);
	 	}
	 	mx = max(mx, _mx);
	 }
	 ans += 2*st.size() - 2;
	 for(auto L : st){
	 	if(L <= s && s <= dist[L]){
	 		//ans += 2 * min(abs(s - L), abs(s - dist[L]));
	 	}
	 }
	 
	return ans;
}

Subtask #1

12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	300 KB	Output is correct
2	Correct	1 ms	296 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	300 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	296 KB	Output is correct
10	Correct	1 ms	296 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	300 KB	Output is correct
2	Correct	1 ms	296 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	300 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	296 KB	Output is correct
10	Correct	1 ms	296 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	304 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	300 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	300 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	300 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	300 KB	Output is correct
28	Correct	1 ms	300 KB	Output is correct
29	Correct	1 ms	296 KB	Output is correct

Subtask #3

28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	300 KB	Output is correct
2	Correct	1 ms	296 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	300 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	296 KB	Output is correct
10	Correct	1 ms	296 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	304 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	300 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	300 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	300 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	300 KB	Output is correct
28	Correct	1 ms	300 KB	Output is correct
29	Correct	1 ms	296 KB	Output is correct
30	Correct	139 ms	31876 KB	Output is correct
31	Correct	135 ms	31780 KB	Output is correct
32	Correct	90 ms	16108 KB	Output is correct
33	Correct	104 ms	40148 KB	Output is correct
34	Correct	114 ms	40188 KB	Output is correct
35	Correct	110 ms	36160 KB	Output is correct
36	Correct	125 ms	34012 KB	Output is correct
37	Correct	120 ms	31928 KB	Output is correct
38	Correct	95 ms	31820 KB	Output is correct
39	Correct	113 ms	31844 KB	Output is correct
40	Correct	103 ms	31848 KB	Output is correct
41	Correct	116 ms	31800 KB	Output is correct
42	Correct	112 ms	31852 KB	Output is correct
43	Correct	105 ms	31868 KB	Output is correct

Subtask #4

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	212 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	300 KB	Output is correct
2	Correct	1 ms	296 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	300 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	296 KB	Output is correct
10	Correct	1 ms	296 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	304 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	300 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	300 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	300 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	300 KB	Output is correct
28	Correct	1 ms	300 KB	Output is correct
29	Correct	1 ms	296 KB	Output is correct
30	Correct	139 ms	31876 KB	Output is correct
31	Correct	135 ms	31780 KB	Output is correct
32	Correct	90 ms	16108 KB	Output is correct
33	Correct	104 ms	40148 KB	Output is correct
34	Correct	114 ms	40188 KB	Output is correct
35	Correct	110 ms	36160 KB	Output is correct
36	Correct	125 ms	34012 KB	Output is correct
37	Correct	120 ms	31928 KB	Output is correct
38	Correct	95 ms	31820 KB	Output is correct
39	Correct	113 ms	31844 KB	Output is correct
40	Correct	103 ms	31848 KB	Output is correct
41	Correct	116 ms	31800 KB	Output is correct
42	Correct	112 ms	31852 KB	Output is correct
43	Correct	105 ms	31868 KB	Output is correct
44	Incorrect	1 ms	212 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-