답안 #58442 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
58442	2018-07-17T20:56:01 Z	reality	고대 책들 (IOI17_books)	C++17	12 / 100	4 ms	636 KB

books

#include "books.h"
#include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define ll long long
#define dbg(v) cerr<<#v<<" = "<<v<<'\n'
#define vi vector<int>
#define vl vector <ll>
#define pii pair<int,int>
#define mp make_pair
#define db long double
#define pb push_back
#define all(s) s.begin(),s.end()
template < class T > T smin(T &a,T b) {if (a > b) a = b;return a;}
template < class T > T smax(T &a,T b) {if (a < b) a = b;return a;}
#include "books.h"
long long minimum_walk(std::vector<int> p, int s) {
	int n = p.size();
	ll ans = 0;
	while (s < n && p[s] == s)
		++s,ans += 2;
	if (s == n)
		return 0;
	vi was(n,0);
	vector < pii > e;
	for (int i = 0;i < n;++i) 
		if (i != p[i] && !was[i]) {
			int cnt = i;
			int mx = 0;
			do {
				was[cnt] = 1;
				smax(mx,cnt);
				cnt = p[cnt];
			} while (cnt != i);
			e.pb(mp(i,mx));
		}
	for (int i = 0;i < n;++i)
		ans += abs(i - p[i]);
	int k = e.size();
	for (int i = 1;i < k;++i)
		smax(e[i].se,e[i - 1].se);
	for (int i = 0;i + 1 < k;++i)
		if (e[i + 1].fi > e[i].se)
			ans += 2;
	return ans;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	488 KB	Output is correct
3	Correct	2 ms	488 KB	Output is correct
4	Correct	2 ms	488 KB	Output is correct
5	Correct	2 ms	624 KB	Output is correct
6	Correct	3 ms	624 KB	Output is correct
7	Correct	2 ms	624 KB	Output is correct
8	Correct	3 ms	624 KB	Output is correct
9	Correct	4 ms	624 KB	Output is correct
10	Correct	3 ms	624 KB	Output is correct
11	Correct	3 ms	624 KB	Output is correct
12	Correct	2 ms	624 KB	Output is correct
13	Correct	2 ms	624 KB	Output is correct
14	Correct	2 ms	624 KB	Output is correct
15	Correct	2 ms	624 KB	Output is correct
16	Correct	2 ms	624 KB	Output is correct
17	Correct	2 ms	624 KB	Output is correct
18	Correct	3 ms	624 KB	Output is correct
19	Correct	2 ms	636 KB	Output is correct
20	Correct	3 ms	636 KB	Output is correct
21	Correct	2 ms	636 KB	Output is correct
22	Incorrect	4 ms	636 KB	3rd lines differ - on the 1st token, expected: '2082', found: '1128'
23	Halted	0 ms	0 KB	-

Subtask #3
0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	488 KB	Output is correct
3	Correct	2 ms	488 KB	Output is correct
4	Correct	2 ms	488 KB	Output is correct
5	Correct	2 ms	624 KB	Output is correct
6	Correct	3 ms	624 KB	Output is correct
7	Correct	2 ms	624 KB	Output is correct
8	Correct	3 ms	624 KB	Output is correct
9	Correct	4 ms	624 KB	Output is correct
10	Correct	3 ms	624 KB	Output is correct
11	Correct	3 ms	624 KB	Output is correct
12	Correct	2 ms	624 KB	Output is correct
13	Correct	2 ms	624 KB	Output is correct
14	Correct	2 ms	624 KB	Output is correct
15	Correct	2 ms	624 KB	Output is correct
16	Correct	2 ms	624 KB	Output is correct
17	Correct	2 ms	624 KB	Output is correct
18	Correct	3 ms	624 KB	Output is correct
19	Correct	2 ms	636 KB	Output is correct
20	Correct	3 ms	636 KB	Output is correct
21	Correct	2 ms	636 KB	Output is correct
22	Incorrect	4 ms	636 KB	3rd lines differ - on the 1st token, expected: '2082', found: '1128'
23	Halted	0 ms	0 KB	-

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	3 ms	636 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	2 ms	376 KB	Output is correct
2	Correct	2 ms	488 KB	Output is correct
3	Correct	2 ms	488 KB	Output is correct
4	Correct	2 ms	488 KB	Output is correct
5	Correct	2 ms	624 KB	Output is correct
6	Correct	3 ms	624 KB	Output is correct
7	Correct	2 ms	624 KB	Output is correct
8	Correct	3 ms	624 KB	Output is correct
9	Correct	4 ms	624 KB	Output is correct
10	Correct	3 ms	624 KB	Output is correct
11	Correct	3 ms	624 KB	Output is correct
12	Correct	2 ms	624 KB	Output is correct
13	Correct	2 ms	624 KB	Output is correct
14	Correct	2 ms	624 KB	Output is correct
15	Correct	2 ms	624 KB	Output is correct
16	Correct	2 ms	624 KB	Output is correct
17	Correct	2 ms	624 KB	Output is correct
18	Correct	3 ms	624 KB	Output is correct
19	Correct	2 ms	636 KB	Output is correct
20	Correct	3 ms	636 KB	Output is correct
21	Correct	2 ms	636 KB	Output is correct
22	Incorrect	4 ms	636 KB	3rd lines differ - on the 1st token, expected: '2082', found: '1128'
23	Halted	0 ms	0 KB	-

답안 #58442

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 0 / 10.0

Subtask #3 0 / 28.0

Subtask #4 0 / 20.0

Subtask #5 0 / 30.0

Subtask #1
12.0 / 12.0

Subtask #2
0 / 10.0

Subtask #3
0 / 28.0

Subtask #4
0 / 20.0

Subtask #5
0 / 30.0