Submission #992691

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
992691	2024-06-05T01:42:30 Z	bachhoangxuan	Ancient Books (IOI17_books)	C++17	50 / 100	118 ms	21528 KB

books

#include "books.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e6+5;
int cnt[maxn],f[maxn];

long long minimum_walk(std::vector<int> p, int s) {
    long long ans=0;
    int n=(int)p.size();
    for(int i=0;i<n;i++){
        if(!f[i] && i!=p[i]){
            int u=i,mn=i,mx=i;
            while(!f[u]){
                f[u]=1;
                mn=min(mn,u);
                mx=max(mx,u);
                u=p[u];
            }
            cnt[mn]++;
            cnt[mx]--;
        }
        ans+=abs(i-p[i]);
    }
    for(int i=1;i<=n;i++) cnt[i]+=cnt[i-1];
    int d=0;
    for(int i=n-1;i>=s;i--){
        if(cnt[i]) d=1;
        else ans+=2*d;
    }
    d=0;
    for(int i=0;i<s;i++){
        if(cnt[i]) d=1;
        else ans+=2*d;
    }
    if(s && cnt[s-1] && s<n-1 && cnt[s] && s==p[s]){
        int l=s,r=s;
        while(l>=0 && l==p[l]) l--;
        while(r<n && r==p[r]) r++;
        ans+=2*(min(s-l,r-s)-1);
    }
    return ans;
}

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	1 ms	2392 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	0 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	0 ms	2396 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	0 ms	2396 KB	Output is correct
17	Correct	1 ms	2500 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	1 ms	2392 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	0 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	0 ms	2396 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	0 ms	2396 KB	Output is correct
17	Correct	1 ms	2500 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2392 KB	Output is correct
20	Correct	1 ms	2492 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	0 ms	2396 KB	Output is correct
25	Correct	0 ms	2396 KB	Output is correct
26	Correct	0 ms	2396 KB	Output is correct
27	Correct	1 ms	2392 KB	Output is correct
28	Correct	1 ms	2396 KB	Output is correct
29	Correct	1 ms	2396 KB	Output is correct

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	1 ms	2392 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	0 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	0 ms	2396 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	0 ms	2396 KB	Output is correct
17	Correct	1 ms	2500 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2392 KB	Output is correct
20	Correct	1 ms	2492 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	0 ms	2396 KB	Output is correct
25	Correct	0 ms	2396 KB	Output is correct
26	Correct	0 ms	2396 KB	Output is correct
27	Correct	1 ms	2392 KB	Output is correct
28	Correct	1 ms	2396 KB	Output is correct
29	Correct	1 ms	2396 KB	Output is correct
30	Correct	94 ms	21528 KB	Output is correct
31	Correct	110 ms	21328 KB	Output is correct
32	Correct	75 ms	17488 KB	Output is correct
33	Correct	80 ms	21324 KB	Output is correct
34	Correct	78 ms	21328 KB	Output is correct
35	Correct	82 ms	21276 KB	Output is correct
36	Correct	78 ms	21332 KB	Output is correct
37	Correct	79 ms	21332 KB	Output is correct
38	Correct	78 ms	21240 KB	Output is correct
39	Correct	81 ms	21360 KB	Output is correct
40	Correct	78 ms	21216 KB	Output is correct
41	Correct	108 ms	21300 KB	Output is correct
42	Correct	118 ms	21424 KB	Output is correct
43	Correct	79 ms	21224 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	2392 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	1 ms	2392 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	0 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	0 ms	2396 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	0 ms	2396 KB	Output is correct
17	Correct	1 ms	2500 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2392 KB	Output is correct
20	Correct	1 ms	2492 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	0 ms	2396 KB	Output is correct
25	Correct	0 ms	2396 KB	Output is correct
26	Correct	0 ms	2396 KB	Output is correct
27	Correct	1 ms	2392 KB	Output is correct
28	Correct	1 ms	2396 KB	Output is correct
29	Correct	1 ms	2396 KB	Output is correct
30	Correct	94 ms	21528 KB	Output is correct
31	Correct	110 ms	21328 KB	Output is correct
32	Correct	75 ms	17488 KB	Output is correct
33	Correct	80 ms	21324 KB	Output is correct
34	Correct	78 ms	21328 KB	Output is correct
35	Correct	82 ms	21276 KB	Output is correct
36	Correct	78 ms	21332 KB	Output is correct
37	Correct	79 ms	21332 KB	Output is correct
38	Correct	78 ms	21240 KB	Output is correct
39	Correct	81 ms	21360 KB	Output is correct
40	Correct	78 ms	21216 KB	Output is correct
41	Correct	108 ms	21300 KB	Output is correct
42	Correct	118 ms	21424 KB	Output is correct
43	Correct	79 ms	21224 KB	Output is correct
44	Incorrect	1 ms	2392 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-

Submission #992691

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