oj.uz

Submission #371136

# Submission time Handle Problem Language Result Execution time Memory
371136 2021-02-25T22:31:05 Z doowey Ancient Books (IOI17_books) C++14
100 / 100
 236 ms 23892 KB 
#include <bits/stdc++.h>
#include "books.h"

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair

int n;
const int N = (int)1e6 + 100;
int lef[N], rig[N];
bool vis[N];
bool has[N];

int tl, tr;


void extend(int &li, int &ri){
    int ni = min(lef[li],lef[ri]);
    int nj = max(rig[li],rig[ri]);
    while(li > ni || ri < nj){
        if(li > ni){
            li--;
            ni = min(ni, lef[li]);
            nj = max(nj, rig[li]);
        }
        else{
            ri++;
            ni = min(ni, lef[ri]);
            nj = max(nj, rig[ri]);
        }
    }
}

int disl[N];
int disr[N];

int st;

int solve(int li, int ri){
    int cnt = 0;
    extend(li, ri);
    int ai, aj;
    while(li != tl || ri != tr){
        if(li == tl){
            cnt += 2;
            ri ++ ;
        }
        else if(ri == tr){
            cnt += 2;
            li -- ;
        }
        else{
            int il = li;
            int ir = ri;
            int ca = 0;
            bool valid = false;
            int low=li, high=ri;
            while(il > tl){
                il--;
                ca += 2;
                extend(il, ir);
                if(ir > ri){
                    valid = true;
                    break;
                }
            }
            if(!valid){
                li=il;
                cnt+=ca;
                extend(li,ri);
                continue;
            }
            low = min(low, il);
            high = max(high, ir);

            il = li;
            ir = ri;
            int cb = 0;
            valid = false;
            while(ir < tr){
                ir++;
                cb += 2;
                extend(il, ir);
                if(il < li){
                    valid = true;
                    break;
                }
            }
            if(!valid){
                ri=ir;
                cnt += cb;
                extend(li, ri);
                continue;
            }
            low = min(low, il);
            high = max(high, ir);
            cnt += min(ca, cb);
            li = low;
            ri = high;
        }
        extend(li,ri);
    }
    return cnt;
}
long long minimum_walk(vector<int> p, int s) {
	n = p.size();
	st = s;
	int id;
	int low, high;
	ll sol = 0;
    tl = tr = s;
	for(int i = 0 ; i < n; i ++ ){
        sol += abs(p[i] - i);
        if(!vis[i]){
            vector<int> cyc;
            id = i;
            while(!vis[id]){
                vis[id]=true;
                cyc.push_back(id);
                id=p[id];
            }
            low = n-1;
            high = 0;
            for(auto x : cyc){
                low = min(low, x);
                high = max(high, x);
            }
            for(auto x : cyc){
                lef[x] = low;
                rig[x] = high;
            }
        }
        if(p[i] != i){
            tl = min(tl, i);
            tr = max(tr, i);
        }
	}
	return sol + solve(s, s);
}

Compilation message

books.cpp: In function 'int solve(int, int)':
books.cpp:47:9: warning: unused variable 'ai' [-Wunused-variable]
   47 |     int ai, aj;
      |         ^~
books.cpp:47:13: warning: unused variable 'aj' [-Wunused-variable]
   47 |     int ai, aj;
      |             ^~

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 229 ms 20312 KB Output is correct
31 Correct 236 ms 19064 KB Output is correct
32 Correct 197 ms 17004 KB Output is correct
33 Correct 184 ms 17132 KB Output is correct
34 Correct 182 ms 17004 KB Output is correct
35 Correct 182 ms 17132 KB Output is correct
36 Correct 172 ms 16964 KB Output is correct
37 Correct 167 ms 17004 KB Output is correct
38 Correct 157 ms 17004 KB Output is correct
39 Correct 156 ms 17004 KB Output is correct
40 Correct 165 ms 17172 KB Output is correct
41 Correct 192 ms 17880 KB Output is correct
42 Correct 171 ms 17960 KB Output is correct
43 Correct 178 ms 17004 KB Output is correct

Subtask #4
20.0 / 20.0

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

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 229 ms 20312 KB Output is correct
31 Correct 236 ms 19064 KB Output is correct
32 Correct 197 ms 17004 KB Output is correct
33 Correct 184 ms 17132 KB Output is correct
34 Correct 182 ms 17004 KB Output is correct
35 Correct 182 ms 17132 KB Output is correct
36 Correct 172 ms 16964 KB Output is correct
37 Correct 167 ms 17004 KB Output is correct
38 Correct 157 ms 17004 KB Output is correct
39 Correct 156 ms 17004 KB Output is correct
40 Correct 165 ms 17172 KB Output is correct
41 Correct 192 ms 17880 KB Output is correct
42 Correct 171 ms 17960 KB Output is correct
43 Correct 178 ms 17004 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 1 ms 364 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 1 ms 364 KB Output is correct
53 Correct 1 ms 364 KB Output is correct
54 Correct 1 ms 364 KB Output is correct
55 Correct 1 ms 364 KB Output is correct
56 Correct 1 ms 364 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 1 ms 364 KB Output is correct
61 Correct 1 ms 364 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 176 ms 17004 KB Output is correct
65 Correct 183 ms 17004 KB Output is correct
66 Correct 156 ms 17004 KB Output is correct
67 Correct 155 ms 17004 KB Output is correct
68 Correct 17 ms 2028 KB Output is correct
69 Correct 21 ms 2028 KB Output is correct
70 Correct 17 ms 2028 KB Output is correct
71 Correct 18 ms 2028 KB Output is correct
72 Correct 17 ms 2028 KB Output is correct
73 Correct 16 ms 2156 KB Output is correct
74 Correct 181 ms 17004 KB Output is correct
75 Correct 181 ms 18924 KB Output is correct
76 Correct 179 ms 18924 KB Output is correct
77 Correct 183 ms 18924 KB Output is correct
78 Correct 180 ms 18924 KB Output is correct
79 Correct 180 ms 18924 KB Output is correct
80 Correct 185 ms 18924 KB Output is correct
81 Correct 176 ms 18924 KB Output is correct
82 Correct 178 ms 18868 KB Output is correct
83 Correct 183 ms 18924 KB Output is correct
84 Correct 193 ms 23876 KB Output is correct
85 Correct 169 ms 23660 KB Output is correct
86 Correct 162 ms 23804 KB Output is correct
87 Correct 201 ms 23788 KB Output is correct
88 Correct 188 ms 23660 KB Output is correct
89 Correct 189 ms 23788 KB Output is correct
90 Correct 165 ms 23788 KB Output is correct
91 Correct 156 ms 23660 KB Output is correct
92 Correct 178 ms 23892 KB Output is correct