답안 #99182 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
99182	2019-03-01T14:23:54 Z	figter001	고대 책들 (IOI17_books)	C++17	12 / 100	3 ms	384 KB

books

#include "books.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

int ans;
map<pair<int,pair<int,pair<int,pair<int,vector<int>>>>>,int> mp;

void calc(int idx,vector<int> c,int cst,int h,int l){
	if(cst > ans || idx < 0 || idx >= c.size())return;
	if(mp[{idx,{cst,{h,{l,c}}}}] == 1)return;
	mp[{idx,{cst,{h,{l,c}}}}] = 1;
	bool f = 1;
	for(int i = 0;i<c.size();i++)
		if(i != c[i])
			f = 0;
	if(f && idx == 0){
		ans = min(cst,ans);
		return;
	}
	calc(idx+1,c,cst+1,h,1);
	calc(idx-1,c,cst+1,h,1);
	swap(h,c[idx]);
	if(l)
		calc(idx,c,cst,h,0);
	calc(idx+1,c,cst+1,h,1);
	calc(idx-1,c,cst+1,h,1);
}


ll minimum_walk(vector<int> p, int s) {
	ans = 0;
	// calc(s,p,0,-1,0);
	int n = p.size();
	int f = -1;
	for(int i=0;i<n;i++){
		if(i != p[i]){
			ans += abs(p[i] - i);
			if(f == -1)
				f = i;
		}
	}
	if(f == -1)
		ans = 0;
	else
		ans += f * 2;
	return ans;
}

Compilation message

books.cpp: In function 'void calc(int, std::vector<int>, int, int, int)':
books.cpp:14:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(cst > ans || idx < 0 || idx >= c.size())return;
                             ~~~~^~~~~~~~~~~
books.cpp:18:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0;i<c.size();i++)
                ~^~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 28.0

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

Subtask #4
0 / 20.0

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

답안 #99182

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 0 / 10.0

Subtask #3 0 / 28.0

Subtask #4 0 / 20.0

Subtask #5 0 / 30.0

Subtask #1
12.0 / 12.0

Subtask #2
0 / 10.0

Subtask #3
0 / 28.0

Subtask #4
0 / 20.0

Subtask #5
0 / 30.0