oj.uz

Submission #151255

# Submission time Handle Problem Language Result Execution time Memory
151255 2019-09-02T10:36:05 Z Bodo171 Ancient Books (IOI17_books) C++14
100 / 100
 360 ms 26684 KB 
#include "books.h"
#include <iostream>
using namespace std;
const int nmax=1000*1000+5;
int st[nmax],dr[nmax],viz[nmax];
int n,to_l,to_r,l,r,i,x,l1,l2,r1,r2,oldl,oldr,steps_left,steps_right;
long long abss(long long x)
{
    if(x<0) return -x;
    return x;
}
void ext(int &L,int &R,int oldL,int oldR)
{
    int nxtL,nxtR;
    while(oldL!=L||oldR!=R)
    {
        nxtL=L;nxtR=R;
        for(int it=oldL-1;it>=L;it--)
        {
            nxtL=min(nxtL,st[it]);
            nxtR=max(nxtR,dr[it]);
        }
        for(int it=oldR+1;it<=R;it++)
        {
            nxtL=min(nxtL,st[it]);
            nxtR=max(nxtR,dr[it]);
        }
        oldL=L;oldR=R;
        L=nxtL;R=nxtR;
    }
}
long long minimum_walk(vector<int> p, int s) {
    long long ans=0;
    n=p.size();
    to_l=s;to_r=s;
    for(i=0; i<p.size(); i++)
    {
        if(p[i]!=i)
        {
            to_l=min(to_l,i);
            to_r=max(to_r,i);
        }
        ans+=1LL*abss(i-p[i]);
        if(!viz[i])
        {
            st[i]=dr[i]=i;
            x=i;
            while(!viz[x])
            {
                st[i]=min(st[i],x);
                dr[i]=max(dr[i],x);
                viz[x]=1;
                x=p[x];
            }
            x=p[i];
            while(x!=i)
            {
                st[x]=st[i];
                dr[x]=dr[i];
                x=p[x];
            }
        }
    }
    l=st[s];r=dr[s];
    ext(l,r,s,s);
    while(l>to_l||r<to_r)
    {
        l1=l,r1=r;oldl=l;oldr=r;
        steps_left=steps_right=0;
        while(l1>to_l&&r1==r)
        {
            l1--;steps_left+=2;
            ext(l1,r1,oldl,oldr);
            oldl=l1;oldr=r1;

        }
        l2=l,r2=r;oldl=l;oldr=r;
        while(r2<to_r&&l2==l)
        {
            r2++;steps_right+=2;
            ext(l2,r2,oldl,oldr);
            oldl=l2;oldr=r2;
        }
        if(r1>r)
        {
            ans+=1LL*min(steps_left,steps_right);
            l=l1;r=r1;
        }
        else
        {
            ans+=1LL*steps_left;
            ans+=1LL*steps_right;
            l=l1;r=r2;
        }
    }
	return ans;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:36:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i=0; i<p.size(); i++)
              ~^~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 372 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 404 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 368 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 360 KB Output is correct
18 Correct 2 ms 372 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 372 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 404 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 368 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 360 KB Output is correct
18 Correct 2 ms 372 KB Output is correct
19 Correct 2 ms 296 KB Output is correct
20 Correct 2 ms 368 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 412 KB Output is correct
24 Correct 2 ms 396 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 360 KB Output is correct
27 Correct 2 ms 364 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 348 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 372 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 404 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 368 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 360 KB Output is correct
18 Correct 2 ms 372 KB Output is correct
19 Correct 2 ms 296 KB Output is correct
20 Correct 2 ms 368 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 412 KB Output is correct
24 Correct 2 ms 396 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 360 KB Output is correct
27 Correct 2 ms 364 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 360 ms 25428 KB Output is correct
31 Correct 342 ms 26676 KB Output is correct
32 Correct 151 ms 26672 KB Output is correct
33 Correct 168 ms 26544 KB Output is correct
34 Correct 165 ms 26552 KB Output is correct
35 Correct 168 ms 25764 KB Output is correct
36 Correct 164 ms 26604 KB Output is correct
37 Correct 163 ms 26640 KB Output is correct
38 Correct 169 ms 26588 KB Output is correct
39 Correct 169 ms 26536 KB Output is correct
40 Correct 189 ms 26668 KB Output is correct
41 Correct 227 ms 26552 KB Output is correct
42 Correct 228 ms 26552 KB Output is correct
43 Correct 164 ms 26676 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 368 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 404 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 2 ms 372 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 2 ms 364 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 364 KB Output is correct
20 Correct 2 ms 360 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 372 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 404 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 368 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 360 KB Output is correct
18 Correct 2 ms 372 KB Output is correct
19 Correct 2 ms 296 KB Output is correct
20 Correct 2 ms 368 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 412 KB Output is correct
24 Correct 2 ms 396 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 360 KB Output is correct
27 Correct 2 ms 364 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 360 ms 25428 KB Output is correct
31 Correct 342 ms 26676 KB Output is correct
32 Correct 151 ms 26672 KB Output is correct
33 Correct 168 ms 26544 KB Output is correct
34 Correct 165 ms 26552 KB Output is correct
35 Correct 168 ms 25764 KB Output is correct
36 Correct 164 ms 26604 KB Output is correct
37 Correct 163 ms 26640 KB Output is correct
38 Correct 169 ms 26588 KB Output is correct
39 Correct 169 ms 26536 KB Output is correct
40 Correct 189 ms 26668 KB Output is correct
41 Correct 227 ms 26552 KB Output is correct
42 Correct 228 ms 26552 KB Output is correct
43 Correct 164 ms 26676 KB Output is correct
44 Correct 2 ms 368 KB Output is correct
45 Correct 2 ms 376 KB Output is correct
46 Correct 2 ms 364 KB Output is correct
47 Correct 2 ms 376 KB Output is correct
48 Correct 2 ms 376 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 2 ms 376 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 2 ms 404 KB Output is correct
54 Correct 2 ms 376 KB Output is correct
55 Correct 2 ms 348 KB Output is correct
56 Correct 2 ms 364 KB Output is correct
57 Correct 2 ms 372 KB Output is correct
58 Correct 2 ms 364 KB Output is correct
59 Correct 2 ms 348 KB Output is correct
60 Correct 2 ms 364 KB Output is correct
61 Correct 2 ms 376 KB Output is correct
62 Correct 2 ms 364 KB Output is correct
63 Correct 2 ms 360 KB Output is correct
64 Correct 158 ms 26640 KB Output is correct
65 Correct 157 ms 26540 KB Output is correct
66 Correct 166 ms 26572 KB Output is correct
67 Correct 169 ms 26640 KB Output is correct
68 Correct 18 ms 2932 KB Output is correct
69 Correct 17 ms 2880 KB Output is correct
70 Correct 17 ms 2816 KB Output is correct
71 Correct 17 ms 2908 KB Output is correct
72 Correct 17 ms 2908 KB Output is correct
73 Correct 19 ms 3016 KB Output is correct
74 Correct 164 ms 26608 KB Output is correct
75 Correct 165 ms 26664 KB Output is correct
76 Correct 165 ms 26604 KB Output is correct
77 Correct 166 ms 26556 KB Output is correct
78 Correct 162 ms 26540 KB Output is correct
79 Correct 161 ms 26552 KB Output is correct
80 Correct 148 ms 26544 KB Output is correct
81 Correct 161 ms 26640 KB Output is correct
82 Correct 161 ms 26544 KB Output is correct
83 Correct 168 ms 26628 KB Output is correct
84 Correct 166 ms 26668 KB Output is correct
85 Correct 165 ms 26676 KB Output is correct
86 Correct 166 ms 26672 KB Output is correct
87 Correct 182 ms 26580 KB Output is correct
88 Correct 178 ms 26592 KB Output is correct
89 Correct 172 ms 26668 KB Output is correct
90 Correct 167 ms 26684 KB Output is correct
91 Correct 169 ms 26560 KB Output is correct
92 Correct 182 ms 26580 KB Output is correct