답안 #1104917

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1104917	2024-10-24T17:27:54 Z	alexander707070	고대 책들 (IOI17_books)	C++14	22 / 100	94 ms	22380 KB

books

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

int n,s,p[MAXN],ans,last,mins,maxs,pref[MAXN],curr;
bool li[MAXN];

void dfs(int x){
	li[x]=true;

	ans+=abs(x-p[x]);
	mins=min(mins,x);
	maxs=max(maxs,x);

	if(!li[p[x]])dfs(p[x]);
}

long long minimum_walk(vector<int> P, int S){
	n=int(P.size()); s=S+1;

	for(int i=1;i<=n;i++){
		p[i]=P[i-1]+1;
	}

	for(int i=1;i<=n;i++){
		if(!li[i]){
			if(p[i]!=i)last=i;
			mins=n; maxs=1;
			dfs(i);

			pref[mins]++; pref[maxs]--;
		}
	}

	for(int i=1;i<=n-1;i++){
		curr+=pref[i];
		if(curr==0 and last>i)ans+=2;
	}

	return ans;
}

/*int main(){

	cout<<minimum_walk({0, 2, 3, 1}, 0)<<"\n";

	return 0;
}*/

Subtask #1

12.0 / 12.0

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

Subtask #2

10.0 / 10.0

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

Subtask #3

0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4432 KB	Output is correct
2	Correct	2 ms	4432 KB	Output is correct
3	Correct	1 ms	4432 KB	Output is correct
4	Correct	2 ms	4432 KB	Output is correct
5	Correct	1 ms	4604 KB	Output is correct
6	Correct	1 ms	4432 KB	Output is correct
7	Correct	2 ms	4432 KB	Output is correct
8	Correct	2 ms	4432 KB	Output is correct
9	Correct	1 ms	4432 KB	Output is correct
10	Correct	1 ms	4432 KB	Output is correct
11	Correct	1 ms	4432 KB	Output is correct
12	Correct	1 ms	4432 KB	Output is correct
13	Correct	1 ms	4432 KB	Output is correct
14	Correct	2 ms	4432 KB	Output is correct
15	Correct	1 ms	4432 KB	Output is correct
16	Correct	1 ms	4432 KB	Output is correct
17	Correct	1 ms	4432 KB	Output is correct
18	Correct	1 ms	4444 KB	Output is correct
19	Correct	1 ms	4432 KB	Output is correct
20	Correct	1 ms	4432 KB	Output is correct
21	Correct	1 ms	4432 KB	Output is correct
22	Correct	1 ms	4432 KB	Output is correct
23	Correct	2 ms	4432 KB	Output is correct
24	Correct	1 ms	4432 KB	Output is correct
25	Correct	2 ms	4432 KB	Output is correct
26	Correct	1 ms	4432 KB	Output is correct
27	Correct	1 ms	4432 KB	Output is correct
28	Correct	1 ms	4432 KB	Output is correct
29	Correct	1 ms	4432 KB	Output is correct
30	Incorrect	94 ms	22380 KB	3rd lines differ - on the 1st token, expected: '333035179244', found: '-1972269844'
31	Halted	0 ms	0 KB	-

Subtask #4

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	4432 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	1 ms	4432 KB	Output is correct
2	Correct	2 ms	4432 KB	Output is correct
3	Correct	1 ms	4432 KB	Output is correct
4	Correct	2 ms	4432 KB	Output is correct
5	Correct	1 ms	4604 KB	Output is correct
6	Correct	1 ms	4432 KB	Output is correct
7	Correct	2 ms	4432 KB	Output is correct
8	Correct	2 ms	4432 KB	Output is correct
9	Correct	1 ms	4432 KB	Output is correct
10	Correct	1 ms	4432 KB	Output is correct
11	Correct	1 ms	4432 KB	Output is correct
12	Correct	1 ms	4432 KB	Output is correct
13	Correct	1 ms	4432 KB	Output is correct
14	Correct	2 ms	4432 KB	Output is correct
15	Correct	1 ms	4432 KB	Output is correct
16	Correct	1 ms	4432 KB	Output is correct
17	Correct	1 ms	4432 KB	Output is correct
18	Correct	1 ms	4444 KB	Output is correct
19	Correct	1 ms	4432 KB	Output is correct
20	Correct	1 ms	4432 KB	Output is correct
21	Correct	1 ms	4432 KB	Output is correct
22	Correct	1 ms	4432 KB	Output is correct
23	Correct	2 ms	4432 KB	Output is correct
24	Correct	1 ms	4432 KB	Output is correct
25	Correct	2 ms	4432 KB	Output is correct
26	Correct	1 ms	4432 KB	Output is correct
27	Correct	1 ms	4432 KB	Output is correct
28	Correct	1 ms	4432 KB	Output is correct
29	Correct	1 ms	4432 KB	Output is correct
30	Incorrect	94 ms	22380 KB	3rd lines differ - on the 1st token, expected: '333035179244', found: '-1972269844'
31	Halted	0 ms	0 KB	-