oj.uz

Submission #1061116

# Submission time Handle Problem Language Result Execution time Memory
1061116 2024-08-16T06:27:18 Z onbert Ancient Books (IOI17_books) C++17
22 / 100
 2000 ms 164056 KB 
#include "books.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 1e6 + 5, INF = 1e9;
int p[maxn];
int vis[maxn];
bool taken[maxn];

int minimum_walk(vector<int32_t> P, int32_t s) {
    int n = P.size();
    for (int i=0;i<n;i++) p[i] = P[i];
    for (int i=0;i<n;i++) vis[i] = false;
    int ans = 0, cnt = 0;
    vector<pair<int,int>> vec = {{-1, -1}};
    for (int i=0;i<n;i++) if (!vis[i]) {
        if (p[i]==i && i==s) {
            cnt++;
            vis[i] = cnt;
            vec.push_back({s, s});
        }
        if (p[i]==i) continue;
        int u = i;
        pair<int,int> val = {u, u};
        cnt++;
        while (true) {
            vis[u] = cnt;
            val.first = min(u, val.first);
            val.second = max(u, val.second);
            int v = p[u];
            ans += abs(v-u);
            if (v==i) break;
            u = v;
        }
        vec.push_back(val);
    }

    if (vec.size()==1) return ans;

    sort(vec.begin(), vec.end());
    int lastl = vec[1].first, mx = vec[1].second;
    int LL = 0, RR = n-1;
    for (int i=2;i<vec.size();i++) {
        if (vec[i].first > mx) {
            if (lastl<=s && s<=mx) {
                LL = lastl, RR = mx;
                break;
            }
            lastl = vec[i].first;
        }
        mx = max(vec[i].second, mx);
    }
    // cout << LL << " " << RR << endl;

    priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;
    pq.push({vis[s], 0});
    int dist[cnt+5];
    for (int i=1;i<=cnt;i++) dist[i] = -1;
    while (pq.size() > 0) {
        int u = pq.top().first, d = pq.top().second;
        pq.pop();
        if (vec[u].second < LL || vec[u].first > RR) dist[u] = -2;
        if (dist[u]!=-1) continue;
        dist[u] = d;
        for (int i=vec[u].first; i<=vec[u].second;i++) {
            if (dist[vis[i]]==-1) pq.push({vis[i], d});
        }
        for (int i=vec[u].first-1;i>=0;i--) {
            if (p[i]!=i) {
                if (dist[vis[i]]==-1) pq.push({vis[i], d + (vec[u].first - i)*2});
            }
        }
        for (int i=vec[u].second+1;i<n;i++) {
            if (p[i]!=i) {
                if (dist[vis[i]]==-1) pq.push({vis[i], d + (i - vec[u].first)*2});
            }
        }
    }
    int MX = 0;
    for (int i=1;i<=cnt;i++) if (dist[i]!=-1) MX = max(dist[i], MX);
    ans += MX;

    vector<pair<int,int>> vec2;
    for (auto [x, y]:vec) if (x!=-1 && y<LL || x>RR) vec2.push_back({x, y});
    vec2.push_back({LL, RR});
    sort(vec2.begin(), vec2.end());
    mx = vec2[0].second;
    for (int i=1;i<vec2.size();i++) {
        if (vec2[i].first > mx) ans += (vec2[i].first - mx)*2;
        mx = max(vec2[i].second, mx);
    }
    return ans;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int32_t)':
books.cpp:43:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |     for (int i=2;i<vec.size();i++) {
      |                  ~^~~~~~~~~~~
books.cpp:84:37: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   84 |     for (auto [x, y]:vec) if (x!=-1 && y<LL || x>RR) vec2.push_back({x, y});
      |                               ~~~~~~^~~~~~~
books.cpp:88:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |     for (int i=1;i<vec2.size();i++) {
      |                  ~^~~~~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4448 KB Output is correct
8 Correct 0 ms 4448 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4548 KB Output is correct
11 Correct 1 ms 4448 KB Output is correct
12 Correct 1 ms 4452 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 0 ms 4444 KB Output is correct
17 Correct 1 ms 4544 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4448 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4444 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4440 KB Output is correct
29 Correct 6 ms 5080 KB Output is correct
30 Correct 109 ms 37572 KB Output is correct
31 Correct 221 ms 49852 KB Output is correct
32 Correct 67 ms 31212 KB Output is correct
33 Correct 135 ms 51036 KB Output is correct
34 Correct 138 ms 51500 KB Output is correct
35 Correct 154 ms 54824 KB Output is correct
36 Correct 173 ms 56904 KB Output is correct
37 Correct 649 ms 99108 KB Output is correct
38 Correct 349 ms 64864 KB Output is correct
39 Correct 715 ms 98260 KB Output is correct
40 Correct 957 ms 163044 KB Output is correct
41 Execution timed out 2017 ms 164056 KB Time limit exceeded
42 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 5080 KB 3rd lines differ - on the 1st token, expected: '3304', found: '3590'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4448 KB Output is correct
8 Correct 0 ms 4448 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4548 KB Output is correct
11 Correct 1 ms 4448 KB Output is correct
12 Correct 1 ms 4452 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 0 ms 4444 KB Output is correct
17 Correct 1 ms 4544 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4448 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4444 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4440 KB Output is correct
29 Correct 6 ms 5080 KB Output is correct
30 Correct 109 ms 37572 KB Output is correct
31 Correct 221 ms 49852 KB Output is correct
32 Correct 67 ms 31212 KB Output is correct
33 Correct 135 ms 51036 KB Output is correct
34 Correct 138 ms 51500 KB Output is correct
35 Correct 154 ms 54824 KB Output is correct
36 Correct 173 ms 56904 KB Output is correct
37 Correct 649 ms 99108 KB Output is correct
38 Correct 349 ms 64864 KB Output is correct
39 Correct 715 ms 98260 KB Output is correct
40 Correct 957 ms 163044 KB Output is correct
41 Execution timed out 2017 ms 164056 KB Time limit exceeded
42 Halted 0 ms 0 KB -