답안 #135999

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
135999	2019-07-24T15:13:40 Z	rondojim	고대 책들 (IOI17_books)	C++17	50 / 100	216 ms	35992 KB

books

#include <bits/stdc++.h>
#include "books.h"
 
#define F first
#define S second
#define pii pair<int, int>
#define pb push_back
 
using namespace std;
 
typedef long long ll;
 
const int maxN = 1e6 + 10;
 
bool mark[maxN];
vector <pii> que;
 
long long minimum_walk(std::vector<int> p, int s) {
	int n = p.size(), m = 0;
	ll ans = 0;
 
	for (int i=0; i<n; i++)
	{
		if(mark[i]) continue ;
		int curr = i, mn = n, sz = 0, mx = 0;
		while(!mark[curr])
		{
			mn = min(mn, curr);
			mx = max(mx, curr);
			sz ++;
			mark[curr] = true;
			ans += abs(p[curr] - curr);
			curr = p[curr];
		}
		que.pb({mn, mx});
	}
 
	sort(que.begin(), que.end());
	int len = que.size();
 
	int maxR = 0, currL = 0;
		
	vector <pii> res;
 
	for (int i=0; i<len; i++)
	{
		if(maxR >= que[i].F) maxR = max(maxR, que[i].S);
		else
		{
			res.pb({currL, maxR});
			currL = maxR + 1;
			maxR = que[i].S;
		}
	}
	res.pb({currL, maxR});
 
	for (int i=0; i<(int)res.size(); i++)
		if(res[i].F != res[i].S) m = i;
 
	return ans + 2LL * m;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	252 KB	Output is correct
3	Correct	2 ms	252 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	252 KB	Output is correct
6	Correct	3 ms	376 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	2 ms	256 KB	Output is correct
14	Correct	2 ms	252 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	3 ms	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	400 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	368 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	376 KB	Output is correct
28	Correct	2 ms	252 KB	Output is correct
29	Correct	2 ms	364 KB	Output is correct

Subtask #3
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	252 KB	Output is correct
3	Correct	2 ms	252 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	252 KB	Output is correct
6	Correct	3 ms	376 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	2 ms	256 KB	Output is correct
14	Correct	2 ms	252 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	3 ms	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	400 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	368 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	376 KB	Output is correct
28	Correct	2 ms	252 KB	Output is correct
29	Correct	2 ms	364 KB	Output is correct
30	Correct	208 ms	15804 KB	Output is correct
31	Correct	216 ms	15924 KB	Output is correct
32	Correct	199 ms	35992 KB	Output is correct
33	Correct	188 ms	33572 KB	Output is correct
34	Correct	191 ms	33616 KB	Output is correct
35	Correct	181 ms	27788 KB	Output is correct
36	Correct	179 ms	20968 KB	Output is correct
37	Correct	149 ms	16496 KB	Output is correct
38	Correct	153 ms	15976 KB	Output is correct
39	Correct	154 ms	15908 KB	Output is correct
40	Correct	172 ms	15932 KB	Output is correct
41	Correct	190 ms	15716 KB	Output is correct
42	Correct	181 ms	15800 KB	Output is correct
43	Correct	179 ms	24220 KB	Output is correct

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	368 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	256 KB	Output is correct
2	Correct	2 ms	252 KB	Output is correct
3	Correct	2 ms	252 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	252 KB	Output is correct
6	Correct	3 ms	376 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	2 ms	256 KB	Output is correct
14	Correct	2 ms	252 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	3 ms	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	400 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	368 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	376 KB	Output is correct
28	Correct	2 ms	252 KB	Output is correct
29	Correct	2 ms	364 KB	Output is correct
30	Correct	208 ms	15804 KB	Output is correct
31	Correct	216 ms	15924 KB	Output is correct
32	Correct	199 ms	35992 KB	Output is correct
33	Correct	188 ms	33572 KB	Output is correct
34	Correct	191 ms	33616 KB	Output is correct
35	Correct	181 ms	27788 KB	Output is correct
36	Correct	179 ms	20968 KB	Output is correct
37	Correct	149 ms	16496 KB	Output is correct
38	Correct	153 ms	15976 KB	Output is correct
39	Correct	154 ms	15908 KB	Output is correct
40	Correct	172 ms	15932 KB	Output is correct
41	Correct	190 ms	15716 KB	Output is correct
42	Correct	181 ms	15800 KB	Output is correct
43	Correct	179 ms	24220 KB	Output is correct
44	Incorrect	0 ms	368 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-

답안 #135999

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