답안 #297022

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
297022	2020-09-11T07:54:34 Z	Gurban	고대 책들 (IOI17_books)	C++17	12 / 100	1 ms	384 KB

books

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

long long minimum_walk(vector<int> p, int s) {
	if(s == 0){
		if(p.size()==1) return 0;
		else if(p.size()==2){
			if(p[0] != 0) return 2;
			return 0;
		}
		else if(p.size()==3){
			vector<int> v={0,1,2};
			if(p==v) return 0;
			v={0,2,1};
			if(p==v) return 4;
			v={1,0,2};
			if(p==v) return 2;
			v={1,2,0};
			if(p==v) return 4;
			v={2,0,1};
			if(p==v) return 4;
			v={2,1,0};
			if(p==v) return 4;
		}
		else {
			vector<int> v={0,1,2,3};
			if(p==v) return 0;
			v={0,1,3,2};
			if(p==v) return 6;
			v={0,2,1,3};
			if(p==v) return 4;
			v={0,2,3,1};
			if(p==v) return 6;
			v={0,3,1,2};
			if(p==v) return 6;
			v={0,3,2,1};
			if(p==v) return 6;
			v={1,0,2,3};
			if(p==v) return 2;
			v={1,0,3,2};
			if(p==v) return 8;
			v={1,2,0,3};
			if(p==v) return 4;
			v={1,2,3,0};
			if(p==v) return 6;
			v={1,3,0,2};
			if(p==v) return 6;
			v={1,3,2,0};
			if(p==v) return 6;
			v={2,0,1,3};
			if(p==v) return 4;
			v={2,0,3,1};
			if(p==v) return 6;
			v={2,1,0,3};
			if(p==v) return 4;
			v={2,1,3,0};
			if(p==v) return 6;
			v={2,3,0,1};
			if(p==v) return 10;
			v={2,3,1,0};
			if(p==v) return 8;
			v={3,0,1,2};
			if(p==v) return 6;
			v={3,0,2,1};
			if(p==v) return 6;
			v={3,1,0,2};
			if(p==v) return 6;
			v={3,1,2,0};
			if(p==v) return 6;
			v={3,2,0,1};
			if(p==v) return 8;
			v={3,2,1,0};
			if(p==v) return 8;
		}
	}
	return 0;
}

Subtask #1

12.0 / 12.0

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

Subtask #2

0 / 10.0

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

Subtask #3

0 / 28.0

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

Subtask #4

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	256 KB	3rd lines differ - on the 1st token, expected: '3304', found: '0'
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 30.0

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