Submission #892991

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
892991	2023-12-26T09:45:18 Z	abcvuitunggio	Ancient Books (IOI17_books)	C++17	42 / 100	103 ms	23892 KB

books

#include "books.h"
#include <bits/stdc++.h>
using namespace std;
int vis[1000001],r[1000001],g[1000001],nxt[1000001];
vector <pair <int, pair <int, int>>> e;
long long minimum_walk(vector <int> p, int s){
    int n=p.size(),lo=n,hi=0;
    iota(nxt,nxt+n,0);
    vector <pair <int, int>> tmp;
    long long d=0;
    for (int i=0;i<n;i++)
        if (!vis[i]){
            int x=i;
            while (!vis[x]){
                vis[x]=1;
                g[x]=i;
                r[i]=max(r[i],x);
                d+=abs(x-p[x]);
                x=p[x];
            }
          	if (r[i]!=i||i==s){
                lo=min(lo,i);
                hi=max(hi,r[i]);
          	}
        }
    int L=g[s],R=r[g[s]];
    while (L>lo||R<hi){
        if (nxt[L]!=R){
            int j=nxt[L]+1;
            nxt[L]=nxt[j];
            L=min(L,g[j]);
            R=max(R,r[g[j]]);
            continue;
        }
        int tmpl=L,tmpr=R,ch=0,d2=d;
        while (L>lo||R<hi){
            d+=2;
            d2+=((L>lo)+(R<hi))*2;
            L=max(L-1,lo);
            R=min(R+1,hi);
            int newL=g[L],newR=r[g[R]];
            while (L>=newL){
                if (r[g[L]]>tmpr){
                    R=r[g[L]];
                    L=g[L];
                    ch=1;
                    break;
                }
                newL=min(newL,g[L]);
                L--;
            }
            if (ch)
                break;
            L++;
            while (R<=newR){
                if (g[R]<tmpl){
                    L=g[R];
                    R=r[g[R]];
                    ch=1;
                    break;
                }
                newR=max(newR,r[g[R]]);
                R++;
            }
            if (ch)
                break;
            R--;
        }
        if (!ch)
            d=d2;
    }
    return d;
}

Subtask #1

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2648 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	1 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	2396 KB	Output is correct
10	Correct	1 ms	2504 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	0 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	0 ms	2392 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2500 KB	Output is correct
17	Correct	1 ms	2396 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	2396 KB	Output is correct
2	Correct	1 ms	2648 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	1 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	2396 KB	Output is correct
10	Correct	1 ms	2504 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	0 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	0 ms	2392 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2500 KB	Output is correct
17	Correct	1 ms	2396 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	2396 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	1 ms	2396 KB	Output is correct
29	Correct	1 ms	2396 KB	Output is correct

Subtask #3

0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2648 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	1 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	2396 KB	Output is correct
10	Correct	1 ms	2504 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	0 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	0 ms	2392 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2500 KB	Output is correct
17	Correct	1 ms	2396 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	2396 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	1 ms	2396 KB	Output is correct
29	Correct	1 ms	2396 KB	Output is correct
30	Correct	91 ms	19976 KB	Output is correct
31	Correct	103 ms	19964 KB	Output is correct
32	Correct	72 ms	23888 KB	Output is correct
33	Correct	81 ms	23892 KB	Output is correct
34	Correct	83 ms	23892 KB	Output is correct
35	Correct	92 ms	23820 KB	Output is correct
36	Correct	82 ms	23820 KB	Output is correct
37	Correct	77 ms	23888 KB	Output is correct
38	Correct	76 ms	23376 KB	Output is correct
39	Correct	77 ms	23124 KB	Output is correct
40	Incorrect	79 ms	20820 KB	3rd lines differ - on the 1st token, expected: '7046223616', found: '-1543710976'
41	Halted	0 ms	0 KB	-

Subtask #4

20.0 / 20.0

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

Subtask #5

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2648 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	1 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	2396 KB	Output is correct
10	Correct	1 ms	2504 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	0 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	0 ms	2392 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2500 KB	Output is correct
17	Correct	1 ms	2396 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	2396 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	1 ms	2396 KB	Output is correct
29	Correct	1 ms	2396 KB	Output is correct
30	Correct	91 ms	19976 KB	Output is correct
31	Correct	103 ms	19964 KB	Output is correct
32	Correct	72 ms	23888 KB	Output is correct
33	Correct	81 ms	23892 KB	Output is correct
34	Correct	83 ms	23892 KB	Output is correct
35	Correct	92 ms	23820 KB	Output is correct
36	Correct	82 ms	23820 KB	Output is correct
37	Correct	77 ms	23888 KB	Output is correct
38	Correct	76 ms	23376 KB	Output is correct
39	Correct	77 ms	23124 KB	Output is correct
40	Incorrect	79 ms	20820 KB	3rd lines differ - on the 1st token, expected: '7046223616', found: '-1543710976'
41	Halted	0 ms	0 KB	-