oj.uz

Submission #425918

# Submission time Handle Problem Language Result Execution time Memory
425918 2021-06-13T12:23:07 Z 2fat2code Ancient Books (IOI17_books) C++17
100 / 100
 350 ms 76564 KB 
#include "books.h"
#include<bits/stdc++.h>
#define fr first
#define sc second
#define LL long long
#define all(s) s.begin(), s.end()
using namespace std;

const int nmax = 1000005;

long long n, comp, l_ned, r_ned, ans, viz[nmax];
vector<long long>cicles[nmax];

void extend(LL &l, LL &r, LL &ll, LL &rr){
    while(l > ll || r < rr){
        if(l > ll){
            --l;
            ll = min(ll, cicles[viz[l]][0]);
            rr = max(rr, cicles[viz[l]].back());
        }
        if(r < rr){
            ++r;
            ll = min(ll, cicles[viz[r]][0]);
            rr = max(rr, cicles[viz[r]].back());
        }
    }
}

void compute(int s){
    LL l = s, r = s, ll = cicles[viz[s]][0], rr = cicles[viz[s]].back();
    extend(l, r, ll, rr);
    while(ll > 0 || rr < n - 1){
        LL calcright = 0, maxi = -1, findright = 0;
        for(int i=rr+1;i<=n-1;i++){
            if(i > maxi){
                calcright += 2LL;
            }
            maxi = max(maxi, cicles[viz[i]].back());
            if(cicles[viz[i]][0] < ll){
                findright = viz[i];
                break;
            }
        }
        if(!findright){
            rr = n - 1;
            ans += calcright;
        }
        LL calcleft = 0, mini = n, findleft = 0;
        for(int i=ll-1;i>=0;i--){
            if(i < mini){
                calcleft += 2LL;
            }
            mini = min(mini, cicles[viz[i]][0]);
            if(cicles[viz[i]].back() > rr){
                findleft = viz[i];
                break;
            }
        }
        if(!findleft){
            ll = 0;
            ans += calcleft;
        }
        else{
            ans += min(calcleft, calcright);
            if(calcleft > calcright){
                ll = min(ll, cicles[findright][0]);
                rr = max(rr, cicles[findright].back());
            }
            else{
                ll = min(ll, cicles[findleft][0]);
                rr = max(rr, cicles[findleft].back());
            }
        }
        extend(l, r, ll, rr);
    }
}

long long minimum_walk(vector<int> p, int s) {
    n = (int)p.size();
	while(p[l_ned] == l_ned && s > l_ned) l_ned++;
	r_ned = n - 1;
	while(p[r_ned] == r_ned && s < r_ned) r_ned--;
	vector<int>aux;
	for(int i=l_ned;i<=r_ned;i++){
        aux.push_back(p[i] - l_ned);
	}
	swap(aux, p);
	s -= l_ned;
	n = (int)p.size();

	for(int i=0;i<n;i++){
        ans += abs(i - p[i]);
	}
	for(int i=0;i<n;i++){
        if(!viz[i]){
            ++comp;
            viz[i] = comp;
            cicles[comp].push_back(i);
            int curr = p[i];
            while(curr  !=  i){
                viz[curr] = comp;
                cicles[comp].push_back(curr);
                curr = p[curr];
            }
        }
	}
	for(int i=1;i<=comp;i++){
        sort(all(cicles[i]));
	}
	compute(s);
    return ans;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23756 KB Output is correct
2 Correct 19 ms 23784 KB Output is correct
3 Correct 15 ms 23780 KB Output is correct
4 Correct 18 ms 23792 KB Output is correct
5 Correct 16 ms 23756 KB Output is correct
6 Correct 17 ms 23756 KB Output is correct
7 Correct 15 ms 23756 KB Output is correct
8 Correct 15 ms 23664 KB Output is correct
9 Correct 17 ms 23884 KB Output is correct
10 Correct 15 ms 23756 KB Output is correct
11 Correct 17 ms 23792 KB Output is correct
12 Correct 21 ms 23744 KB Output is correct
13 Correct 19 ms 23756 KB Output is correct
14 Correct 19 ms 23756 KB Output is correct
15 Correct 16 ms 23744 KB Output is correct
16 Correct 15 ms 23756 KB Output is correct
17 Correct 16 ms 23792 KB Output is correct
18 Correct 15 ms 23724 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23756 KB Output is correct
2 Correct 19 ms 23784 KB Output is correct
3 Correct 15 ms 23780 KB Output is correct
4 Correct 18 ms 23792 KB Output is correct
5 Correct 16 ms 23756 KB Output is correct
6 Correct 17 ms 23756 KB Output is correct
7 Correct 15 ms 23756 KB Output is correct
8 Correct 15 ms 23664 KB Output is correct
9 Correct 17 ms 23884 KB Output is correct
10 Correct 15 ms 23756 KB Output is correct
11 Correct 17 ms 23792 KB Output is correct
12 Correct 21 ms 23744 KB Output is correct
13 Correct 19 ms 23756 KB Output is correct
14 Correct 19 ms 23756 KB Output is correct
15 Correct 16 ms 23744 KB Output is correct
16 Correct 15 ms 23756 KB Output is correct
17 Correct 16 ms 23792 KB Output is correct
18 Correct 15 ms 23724 KB Output is correct
19 Correct 19 ms 23808 KB Output is correct
20 Correct 16 ms 23788 KB Output is correct
21 Correct 16 ms 23756 KB Output is correct
22 Correct 18 ms 23756 KB Output is correct
23 Correct 20 ms 23828 KB Output is correct
24 Correct 16 ms 23756 KB Output is correct
25 Correct 19 ms 23776 KB Output is correct
26 Correct 17 ms 23752 KB Output is correct
27 Correct 19 ms 23816 KB Output is correct
28 Correct 16 ms 23756 KB Output is correct
29 Correct 18 ms 23756 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23756 KB Output is correct
2 Correct 19 ms 23784 KB Output is correct
3 Correct 15 ms 23780 KB Output is correct
4 Correct 18 ms 23792 KB Output is correct
5 Correct 16 ms 23756 KB Output is correct
6 Correct 17 ms 23756 KB Output is correct
7 Correct 15 ms 23756 KB Output is correct
8 Correct 15 ms 23664 KB Output is correct
9 Correct 17 ms 23884 KB Output is correct
10 Correct 15 ms 23756 KB Output is correct
11 Correct 17 ms 23792 KB Output is correct
12 Correct 21 ms 23744 KB Output is correct
13 Correct 19 ms 23756 KB Output is correct
14 Correct 19 ms 23756 KB Output is correct
15 Correct 16 ms 23744 KB Output is correct
16 Correct 15 ms 23756 KB Output is correct
17 Correct 16 ms 23792 KB Output is correct
18 Correct 15 ms 23724 KB Output is correct
19 Correct 19 ms 23808 KB Output is correct
20 Correct 16 ms 23788 KB Output is correct
21 Correct 16 ms 23756 KB Output is correct
22 Correct 18 ms 23756 KB Output is correct
23 Correct 20 ms 23828 KB Output is correct
24 Correct 16 ms 23756 KB Output is correct
25 Correct 19 ms 23776 KB Output is correct
26 Correct 17 ms 23752 KB Output is correct
27 Correct 19 ms 23816 KB Output is correct
28 Correct 16 ms 23756 KB Output is correct
29 Correct 18 ms 23756 KB Output is correct
30 Correct 350 ms 53128 KB Output is correct
31 Correct 302 ms 53020 KB Output is correct
32 Correct 143 ms 31528 KB Output is correct
33 Correct 211 ms 66332 KB Output is correct
34 Correct 209 ms 66464 KB Output is correct
35 Correct 229 ms 63276 KB Output is correct
36 Correct 210 ms 58132 KB Output is correct
37 Correct 228 ms 54924 KB Output is correct
38 Correct 249 ms 54160 KB Output is correct
39 Correct 208 ms 53932 KB Output is correct
40 Correct 226 ms 52644 KB Output is correct
41 Correct 276 ms 53024 KB Output is correct
42 Correct 262 ms 52628 KB Output is correct
43 Correct 206 ms 66580 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23756 KB Output is correct
2 Correct 21 ms 23748 KB Output is correct
3 Correct 16 ms 23756 KB Output is correct
4 Correct 18 ms 23788 KB Output is correct
5 Correct 16 ms 23924 KB Output is correct
6 Correct 19 ms 23716 KB Output is correct
7 Correct 19 ms 23756 KB Output is correct
8 Correct 16 ms 23756 KB Output is correct
9 Correct 16 ms 23788 KB Output is correct
10 Correct 17 ms 23756 KB Output is correct
11 Correct 18 ms 23764 KB Output is correct
12 Correct 21 ms 23732 KB Output is correct
13 Correct 18 ms 23724 KB Output is correct
14 Correct 16 ms 23716 KB Output is correct
15 Correct 16 ms 23756 KB Output is correct
16 Correct 16 ms 23756 KB Output is correct
17 Correct 17 ms 23788 KB Output is correct
18 Correct 17 ms 23756 KB Output is correct
19 Correct 16 ms 23756 KB Output is correct
20 Correct 15 ms 23708 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23756 KB Output is correct
2 Correct 19 ms 23784 KB Output is correct
3 Correct 15 ms 23780 KB Output is correct
4 Correct 18 ms 23792 KB Output is correct
5 Correct 16 ms 23756 KB Output is correct
6 Correct 17 ms 23756 KB Output is correct
7 Correct 15 ms 23756 KB Output is correct
8 Correct 15 ms 23664 KB Output is correct
9 Correct 17 ms 23884 KB Output is correct
10 Correct 15 ms 23756 KB Output is correct
11 Correct 17 ms 23792 KB Output is correct
12 Correct 21 ms 23744 KB Output is correct
13 Correct 19 ms 23756 KB Output is correct
14 Correct 19 ms 23756 KB Output is correct
15 Correct 16 ms 23744 KB Output is correct
16 Correct 15 ms 23756 KB Output is correct
17 Correct 16 ms 23792 KB Output is correct
18 Correct 15 ms 23724 KB Output is correct
19 Correct 19 ms 23808 KB Output is correct
20 Correct 16 ms 23788 KB Output is correct
21 Correct 16 ms 23756 KB Output is correct
22 Correct 18 ms 23756 KB Output is correct
23 Correct 20 ms 23828 KB Output is correct
24 Correct 16 ms 23756 KB Output is correct
25 Correct 19 ms 23776 KB Output is correct
26 Correct 17 ms 23752 KB Output is correct
27 Correct 19 ms 23816 KB Output is correct
28 Correct 16 ms 23756 KB Output is correct
29 Correct 18 ms 23756 KB Output is correct
30 Correct 350 ms 53128 KB Output is correct
31 Correct 302 ms 53020 KB Output is correct
32 Correct 143 ms 31528 KB Output is correct
33 Correct 211 ms 66332 KB Output is correct
34 Correct 209 ms 66464 KB Output is correct
35 Correct 229 ms 63276 KB Output is correct
36 Correct 210 ms 58132 KB Output is correct
37 Correct 228 ms 54924 KB Output is correct
38 Correct 249 ms 54160 KB Output is correct
39 Correct 208 ms 53932 KB Output is correct
40 Correct 226 ms 52644 KB Output is correct
41 Correct 276 ms 53024 KB Output is correct
42 Correct 262 ms 52628 KB Output is correct
43 Correct 206 ms 66580 KB Output is correct
44 Correct 15 ms 23756 KB Output is correct
45 Correct 21 ms 23748 KB Output is correct
46 Correct 16 ms 23756 KB Output is correct
47 Correct 18 ms 23788 KB Output is correct
48 Correct 16 ms 23924 KB Output is correct
49 Correct 19 ms 23716 KB Output is correct
50 Correct 19 ms 23756 KB Output is correct
51 Correct 16 ms 23756 KB Output is correct
52 Correct 16 ms 23788 KB Output is correct
53 Correct 17 ms 23756 KB Output is correct
54 Correct 18 ms 23764 KB Output is correct
55 Correct 21 ms 23732 KB Output is correct
56 Correct 18 ms 23724 KB Output is correct
57 Correct 16 ms 23716 KB Output is correct
58 Correct 16 ms 23756 KB Output is correct
59 Correct 16 ms 23756 KB Output is correct
60 Correct 17 ms 23788 KB Output is correct
61 Correct 17 ms 23756 KB Output is correct
62 Correct 16 ms 23756 KB Output is correct
63 Correct 15 ms 23708 KB Output is correct
64 Correct 222 ms 74940 KB Output is correct
65 Correct 237 ms 76476 KB Output is correct
66 Correct 208 ms 61616 KB Output is correct
67 Correct 249 ms 61288 KB Output is correct
68 Correct 34 ms 27820 KB Output is correct
69 Correct 42 ms 27580 KB Output is correct
70 Correct 38 ms 28012 KB Output is correct
71 Correct 47 ms 28600 KB Output is correct
72 Correct 43 ms 29024 KB Output is correct
73 Correct 35 ms 27240 KB Output is correct
74 Correct 212 ms 73100 KB Output is correct
75 Correct 209 ms 73196 KB Output is correct
76 Correct 228 ms 73284 KB Output is correct
77 Correct 224 ms 73344 KB Output is correct
78 Correct 211 ms 69772 KB Output is correct
79 Correct 225 ms 69804 KB Output is correct
80 Correct 147 ms 38300 KB Output is correct
81 Correct 200 ms 65708 KB Output is correct
82 Correct 207 ms 65648 KB Output is correct
83 Correct 204 ms 66356 KB Output is correct
84 Correct 206 ms 65468 KB Output is correct
85 Correct 210 ms 62732 KB Output is correct
86 Correct 201 ms 62088 KB Output is correct
87 Correct 218 ms 76564 KB Output is correct
88 Correct 240 ms 72072 KB Output is correct
89 Correct 212 ms 67752 KB Output is correct
90 Correct 202 ms 61840 KB Output is correct
91 Correct 227 ms 60936 KB Output is correct
92 Correct 246 ms 59568 KB Output is correct