Submission #43105

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
43105	2018-03-09T08:14:06 Z	RayaBurong25_1	Ancient Books (IOI17_books)	C++14	50 / 100	271 ms	27824 KB

books

#include "books.h"
#include <vector>
#include <map>
typedef struct range range;
struct range
{
	int e;
	long long m;
};
// bool operator<(range a, range b)
// {
// 	return a.s < b.s;
// }
int vis[1000005];
int abs(int a)
{
	return (a < 0)?-a:a;
}
int min(int a, int b)
{
	return (a < b)?a:b;
}
int max(int a, int b)
{
	return (a > b)?a:b;
}
long long minimum_walk(std::vector<int> p, int ss) {
	std::map<int, range> R;
	int i, n = p.size();
	int s, e;
	long long m;
	for (i = 0; i < n; i++)
	{
		if (!vis[i])
		{
			s = i;
			e = i;
			m = 0;
			while (!vis[i])
			{
				vis[i] = 1;
				m += abs(p[i] - i);
				i = p[i];
				s = min(s, i);
				e = max(e, i);
			}
			// printf("%d %d %lld\n", s, e, m);
			if (m != 0)
				R.insert(std::make_pair(s, range{e, m}));
		}
	}
	std::map<int, range>::iterator it, it2;
	for (it = R.begin(); it != R.end();)
	{
		if (it != R.begin() && it->second.e < it2->second.e)
		{
			it2->second.m += it->second.m;
			it = R.erase(it);
		}
		else if (it != R.begin() && it2->second.e > it->first)
		{
			it2->second.m += it->second.m;
			it2->second.e = it->second.e;
			it = R.erase(it);
		}
		else
		{
			it2 = it;
			it++;
		}
	}
	long long Ans = 0;
	for (it = R.begin(); it != R.end(); it++)
	{
		// printf("%d %d %lld\n", it->first, it->second.e, it->second.m);
		Ans += it->second.m;
		if (it != R.begin())
			Ans += 2*(it->first - it2->second.e);
		else if (ss < it->first)
			Ans += 2*it->first;
		it2 = it;
	}
	if (R.size() > 1 && ss > it2->second.e)
		Ans += 2*(ss - it2->second.e);
	return Ans;
}

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	352 KB	Output is correct
3	Correct	2 ms	492 KB	Output is correct
4	Correct	1 ms	492 KB	Output is correct
5	Correct	2 ms	492 KB	Output is correct
6	Correct	2 ms	492 KB	Output is correct
7	Correct	1 ms	492 KB	Output is correct
8	Correct	1 ms	492 KB	Output is correct
9	Correct	1 ms	492 KB	Output is correct
10	Correct	1 ms	660 KB	Output is correct
11	Correct	2 ms	660 KB	Output is correct
12	Correct	1 ms	660 KB	Output is correct
13	Correct	1 ms	660 KB	Output is correct
14	Correct	1 ms	660 KB	Output is correct
15	Correct	1 ms	660 KB	Output is correct
16	Correct	1 ms	660 KB	Output is correct
17	Correct	1 ms	660 KB	Output is correct
18	Correct	1 ms	660 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	352 KB	Output is correct
3	Correct	2 ms	492 KB	Output is correct
4	Correct	1 ms	492 KB	Output is correct
5	Correct	2 ms	492 KB	Output is correct
6	Correct	2 ms	492 KB	Output is correct
7	Correct	1 ms	492 KB	Output is correct
8	Correct	1 ms	492 KB	Output is correct
9	Correct	1 ms	492 KB	Output is correct
10	Correct	1 ms	660 KB	Output is correct
11	Correct	2 ms	660 KB	Output is correct
12	Correct	1 ms	660 KB	Output is correct
13	Correct	1 ms	660 KB	Output is correct
14	Correct	1 ms	660 KB	Output is correct
15	Correct	1 ms	660 KB	Output is correct
16	Correct	1 ms	660 KB	Output is correct
17	Correct	1 ms	660 KB	Output is correct
18	Correct	1 ms	660 KB	Output is correct
19	Correct	2 ms	660 KB	Output is correct
20	Correct	2 ms	660 KB	Output is correct
21	Correct	2 ms	660 KB	Output is correct
22	Correct	1 ms	660 KB	Output is correct
23	Correct	2 ms	660 KB	Output is correct
24	Correct	2 ms	660 KB	Output is correct
25	Correct	2 ms	660 KB	Output is correct
26	Correct	1 ms	660 KB	Output is correct
27	Correct	1 ms	660 KB	Output is correct
28	Correct	1 ms	660 KB	Output is correct
29	Correct	2 ms	660 KB	Output is correct

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	352 KB	Output is correct
3	Correct	2 ms	492 KB	Output is correct
4	Correct	1 ms	492 KB	Output is correct
5	Correct	2 ms	492 KB	Output is correct
6	Correct	2 ms	492 KB	Output is correct
7	Correct	1 ms	492 KB	Output is correct
8	Correct	1 ms	492 KB	Output is correct
9	Correct	1 ms	492 KB	Output is correct
10	Correct	1 ms	660 KB	Output is correct
11	Correct	2 ms	660 KB	Output is correct
12	Correct	1 ms	660 KB	Output is correct
13	Correct	1 ms	660 KB	Output is correct
14	Correct	1 ms	660 KB	Output is correct
15	Correct	1 ms	660 KB	Output is correct
16	Correct	1 ms	660 KB	Output is correct
17	Correct	1 ms	660 KB	Output is correct
18	Correct	1 ms	660 KB	Output is correct
19	Correct	2 ms	660 KB	Output is correct
20	Correct	2 ms	660 KB	Output is correct
21	Correct	2 ms	660 KB	Output is correct
22	Correct	1 ms	660 KB	Output is correct
23	Correct	2 ms	660 KB	Output is correct
24	Correct	2 ms	660 KB	Output is correct
25	Correct	2 ms	660 KB	Output is correct
26	Correct	1 ms	660 KB	Output is correct
27	Correct	1 ms	660 KB	Output is correct
28	Correct	1 ms	660 KB	Output is correct
29	Correct	2 ms	660 KB	Output is correct
30	Correct	224 ms	12328 KB	Output is correct
31	Correct	232 ms	12376 KB	Output is correct
32	Correct	149 ms	12376 KB	Output is correct
33	Correct	234 ms	24468 KB	Output is correct
34	Correct	236 ms	24468 KB	Output is correct
35	Correct	241 ms	26036 KB	Output is correct
36	Correct	226 ms	26036 KB	Output is correct
37	Correct	176 ms	26036 KB	Output is correct
38	Correct	162 ms	26036 KB	Output is correct
39	Correct	158 ms	26036 KB	Output is correct
40	Correct	166 ms	26036 KB	Output is correct
41	Correct	196 ms	26036 KB	Output is correct
42	Correct	195 ms	26036 KB	Output is correct
43	Correct	271 ms	27824 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	27824 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	248 KB	Output is correct
2	Correct	2 ms	352 KB	Output is correct
3	Correct	2 ms	492 KB	Output is correct
4	Correct	1 ms	492 KB	Output is correct
5	Correct	2 ms	492 KB	Output is correct
6	Correct	2 ms	492 KB	Output is correct
7	Correct	1 ms	492 KB	Output is correct
8	Correct	1 ms	492 KB	Output is correct
9	Correct	1 ms	492 KB	Output is correct
10	Correct	1 ms	660 KB	Output is correct
11	Correct	2 ms	660 KB	Output is correct
12	Correct	1 ms	660 KB	Output is correct
13	Correct	1 ms	660 KB	Output is correct
14	Correct	1 ms	660 KB	Output is correct
15	Correct	1 ms	660 KB	Output is correct
16	Correct	1 ms	660 KB	Output is correct
17	Correct	1 ms	660 KB	Output is correct
18	Correct	1 ms	660 KB	Output is correct
19	Correct	2 ms	660 KB	Output is correct
20	Correct	2 ms	660 KB	Output is correct
21	Correct	2 ms	660 KB	Output is correct
22	Correct	1 ms	660 KB	Output is correct
23	Correct	2 ms	660 KB	Output is correct
24	Correct	2 ms	660 KB	Output is correct
25	Correct	2 ms	660 KB	Output is correct
26	Correct	1 ms	660 KB	Output is correct
27	Correct	1 ms	660 KB	Output is correct
28	Correct	1 ms	660 KB	Output is correct
29	Correct	2 ms	660 KB	Output is correct
30	Correct	224 ms	12328 KB	Output is correct
31	Correct	232 ms	12376 KB	Output is correct
32	Correct	149 ms	12376 KB	Output is correct
33	Correct	234 ms	24468 KB	Output is correct
34	Correct	236 ms	24468 KB	Output is correct
35	Correct	241 ms	26036 KB	Output is correct
36	Correct	226 ms	26036 KB	Output is correct
37	Correct	176 ms	26036 KB	Output is correct
38	Correct	162 ms	26036 KB	Output is correct
39	Correct	158 ms	26036 KB	Output is correct
40	Correct	166 ms	26036 KB	Output is correct
41	Correct	196 ms	26036 KB	Output is correct
42	Correct	195 ms	26036 KB	Output is correct
43	Correct	271 ms	27824 KB	Output is correct
44	Incorrect	1 ms	27824 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-

Submission #43105

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