답안 #421489

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
421489	2021-06-09T08:13:26 Z	schse	고대 책들 (IOI17_books)	C++17	50 / 100	220 ms	27532 KB

books

#include "books.h"
#ifndef EVAL
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;

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

	vector<int> cycle(p.size(), -1);
	vector<vector<int>> cycles;
	vector<pair<int, int>> cmmc;
	long long triplenght = 0;

	for (int i = 0; i < p.size(); i++)
	{
		if (cycle[i] == -1 && p[i] != i)
		{
			int t = i;
			cycles.push_back({});
			cmmc.push_back({INT32_MAX, INT32_MIN});
			do
			{
				cmmc[cmmc.size() - 1].first = min(cmmc[cmmc.size() - 1].first, t);
				cmmc[cmmc.size() - 1].second = max(cmmc[cmmc.size() - 1].second, t);
				cycles[cycles.size() - 1].push_back(t);
				cycle[t] = cycles.size();
				triplenght += abs(t - p[t]);
				t = p[t];
			} while (t != i);
		}
	}
	if (cmmc.size() == 0)
		return 0;

	int t = 0;
	while (cycle[max(s - t, 0)] == -1 && cycle[min(s + t, (int)cycle.size() - 1)] == -1)
		t++;

	for (auto i : cmmc)
	{
		if (i.first <= s && s <= i.second)
		{
			triplenght += 2 * t;
			break;
		}
	}

	// triplenght += 2 * cmmc[0].first; //initial walk

	int mx = cmmc[0].second;
	for (int i = 1; i < cmmc.size(); i++)
	{
		if (mx < cmmc[i].first)
			triplenght += abs(cmmc[i].first - mx) * 2;
		mx = max(mx, cmmc[i].second);
	}
	if (s < cmmc[0].first || s > mx)
		triplenght += 2 * t;

	return triplenght;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:16:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |  for (int i = 0; i < p.size(); i++)
      |                  ~~^~~~~~~~~~
books.cpp:53:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |  for (int i = 1; i < cmmc.size(); i++)
      |                  ~~^~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	212 ms	16848 KB	Output is correct
31	Correct	220 ms	17232 KB	Output is correct
32	Correct	150 ms	12004 KB	Output is correct
33	Correct	182 ms	24216 KB	Output is correct
34	Correct	184 ms	24348 KB	Output is correct
35	Correct	200 ms	26128 KB	Output is correct
36	Correct	201 ms	25460 KB	Output is correct
37	Correct	154 ms	18724 KB	Output is correct
38	Correct	145 ms	17764 KB	Output is correct
39	Correct	154 ms	17764 KB	Output is correct
40	Correct	157 ms	16732 KB	Output is correct
41	Correct	198 ms	16512 KB	Output is correct
42	Correct	169 ms	16452 KB	Output is correct
43	Correct	178 ms	27532 KB	Output is correct

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	204 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	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	212 ms	16848 KB	Output is correct
31	Correct	220 ms	17232 KB	Output is correct
32	Correct	150 ms	12004 KB	Output is correct
33	Correct	182 ms	24216 KB	Output is correct
34	Correct	184 ms	24348 KB	Output is correct
35	Correct	200 ms	26128 KB	Output is correct
36	Correct	201 ms	25460 KB	Output is correct
37	Correct	154 ms	18724 KB	Output is correct
38	Correct	145 ms	17764 KB	Output is correct
39	Correct	154 ms	17764 KB	Output is correct
40	Correct	157 ms	16732 KB	Output is correct
41	Correct	198 ms	16512 KB	Output is correct
42	Correct	169 ms	16452 KB	Output is correct
43	Correct	178 ms	27532 KB	Output is correct
44	Incorrect	1 ms	204 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-

답안 #421489

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