oj.uz

Submission #371133

# Submission time Handle Problem Language Result Execution time Memory
371133 2021-02-25T22:19:14 Z doowey Ancient Books (IOI17_books) C++14
70 / 100
 2000 ms 20332 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, high;
            while(il > tl){
                il--;
                ca += 2;
                extend(il, ir);
                if(ir > ri){
                    valid = true;
                    break;
                }
            }
            if(!valid){
                li -- ;
                cnt += 2;
                extend(li, ri);
                continue;
            }
            low = il;
            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 ++ ;
                cnt += 2;
                extend(li, ri);
                continue;
            }
            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 0 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 0 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

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 0 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 0 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
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 0 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 0 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
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 224 ms 20332 KB Output is correct
31 Correct 209 ms 19064 KB Output is correct
32 Correct 149 ms 17004 KB Output is correct
33 Correct 162 ms 17004 KB Output is correct
34 Correct 195 ms 17004 KB Output is correct
35 Correct 191 ms 17004 KB Output is correct
36 Correct 155 ms 17004 KB Output is correct
37 Correct 156 ms 17024 KB Output is correct
38 Correct 151 ms 17004 KB Output is correct
39 Correct 138 ms 17004 KB Output is correct
40 Correct 147 ms 17172 KB Output is correct
41 Correct 163 ms 17924 KB Output is correct
42 Correct 162 ms 18092 KB Output is correct
43 Correct 175 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
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 0 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 0 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
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 224 ms 20332 KB Output is correct
31 Correct 209 ms 19064 KB Output is correct
32 Correct 149 ms 17004 KB Output is correct
33 Correct 162 ms 17004 KB Output is correct
34 Correct 195 ms 17004 KB Output is correct
35 Correct 191 ms 17004 KB Output is correct
36 Correct 155 ms 17004 KB Output is correct
37 Correct 156 ms 17024 KB Output is correct
38 Correct 151 ms 17004 KB Output is correct
39 Correct 138 ms 17004 KB Output is correct
40 Correct 147 ms 17172 KB Output is correct
41 Correct 163 ms 17924 KB Output is correct
42 Correct 162 ms 18092 KB Output is correct
43 Correct 175 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 166 ms 17004 KB Output is correct
65 Correct 154 ms 17004 KB Output is correct
66 Correct 144 ms 17004 KB Output is correct
67 Correct 157 ms 16964 KB Output is correct
68 Correct 15 ms 2028 KB Output is correct
69 Correct 15 ms 2028 KB Output is correct
70 Correct 15 ms 2028 KB Output is correct
71 Correct 19 ms 2028 KB Output is correct
72 Correct 18 ms 2028 KB Output is correct
73 Correct 15 ms 2156 KB Output is correct
74 Execution timed out 2076 ms 17004 KB Time limit exceeded
75 Halted 0 ms 0 KB -