답안 #423930

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
423930	2021-06-11T14:13:29 Z	Abelyan	고대 책들 (IOI17_books)	C++17	50 / 100	249 ms	21188 KB

books

#ifndef ALEXPC
#include "books.h"
#endif

#include <bits/stdc++.h>
using namespace std;

#define FOR(i,n) for (int i=0;i<(n);++i)
#define FORT(i,a,b) for (int i=(a);i<=(b);++i)
#define FORD(i,n) for (int i=(n)-1;i>=0;--i)
#define FORTD(i,a,b) for (int i=(a);i>=(b);--i)
#define trav(to,v) for (auto to : v)
#define all(v) v.begin(),v.end()
#define fr first
#define sc second

typedef long long ll;

const int N = 1e6+6;


long long minimum_walk(vector<int> p, int s) {
	ll ans=0;
	bool bl=false;
	vector<pair<int,int> > vc;
	FOR(i,p.size()){
		ans+=llabs(p[i]-i);
		if (p[i]!=i || i==s)bl=true;
		if (bl)vc.push_back({min(i,p[i]),max(i,p[i])});
	}
	while(vc.size() && vc.back().fr==vc.back().sc && vc.back().fr!=s)vc.pop_back();
	sort(all(vc));
	int mx=-1;
	FOR(i,vc.size()){
		if (i && vc[i].fr>mx){
			ans+=2;
		}
		if (vc[i].sc>mx)mx=vc[i].sc;
	}
	return ans;
}


#ifdef ALEXPC

#include <cstdio>
#include <vector>
#include <cassert>

using namespace std;

int main() {
	int n, s;
	assert(2 == scanf("%d %d", &n, &s));

	vector<int> p((unsigned) n);
	for(int i = 0; i < n; i++)
		assert(1 == scanf("%d", &p[(unsigned) i]));

	long long res = minimum_walk(p, s);
	printf("%lld\n", res);

	return 0;
}


#endif

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:8:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | #define FOR(i,n) for (int i=0;i<(n);++i)
      |                                ^
books.cpp:26:2: note: in expansion of macro 'FOR'
   26 |  FOR(i,p.size()){
      |  ^~~
books.cpp:8:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | #define FOR(i,n) for (int i=0;i<(n);++i)
      |                                ^
books.cpp:34:2: note: in expansion of macro 'FOR'
   34 |  FOR(i,vc.size()){
      |  ^~~

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	0 ms	288 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 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	1 ms	204 KB	Output is correct
11	Correct	1 ms	292 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	296 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	0 ms	292 KB	Output is correct
18	Correct	0 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	0 ms	288 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 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	1 ms	204 KB	Output is correct
11	Correct	1 ms	292 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	296 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	0 ms	292 KB	Output is correct
18	Correct	0 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	292 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	268 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	0 ms	288 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 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	1 ms	204 KB	Output is correct
11	Correct	1 ms	292 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	296 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	0 ms	292 KB	Output is correct
18	Correct	0 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	292 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	268 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	249 ms	21084 KB	Output is correct
31	Correct	240 ms	21188 KB	Output is correct
32	Correct	137 ms	21040 KB	Output is correct
33	Correct	173 ms	21108 KB	Output is correct
34	Correct	167 ms	21080 KB	Output is correct
35	Correct	176 ms	21052 KB	Output is correct
36	Correct	182 ms	21024 KB	Output is correct
37	Correct	201 ms	21036 KB	Output is correct
38	Correct	199 ms	21020 KB	Output is correct
39	Correct	209 ms	21084 KB	Output is correct
40	Correct	220 ms	21036 KB	Output is correct
41	Correct	231 ms	21040 KB	Output is correct
42	Correct	227 ms	21044 KB	Output is correct
43	Correct	245 ms	21040 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	0 ms	288 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 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	1 ms	204 KB	Output is correct
11	Correct	1 ms	292 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	296 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	0 ms	292 KB	Output is correct
18	Correct	0 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	292 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	268 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	249 ms	21084 KB	Output is correct
31	Correct	240 ms	21188 KB	Output is correct
32	Correct	137 ms	21040 KB	Output is correct
33	Correct	173 ms	21108 KB	Output is correct
34	Correct	167 ms	21080 KB	Output is correct
35	Correct	176 ms	21052 KB	Output is correct
36	Correct	182 ms	21024 KB	Output is correct
37	Correct	201 ms	21036 KB	Output is correct
38	Correct	199 ms	21020 KB	Output is correct
39	Correct	209 ms	21084 KB	Output is correct
40	Correct	220 ms	21036 KB	Output is correct
41	Correct	231 ms	21040 KB	Output is correct
42	Correct	227 ms	21044 KB	Output is correct
43	Correct	245 ms	21040 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	-

답안 #423930

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