oj.uz

Submission #1061130

# Submission time Handle Problem Language Result Execution time Memory
1061130 2024-08-16T06:31:39 Z onbert Ancient Books (IOI17_books) C++17
22 / 100
 1084 ms 1048576 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 = -1, RR = -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);
    }
    if (LL==-1) {
        LL = lastl, RR = 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>=LL;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<=RR;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:87:37: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   87 |     for (auto [x, y]:vec) if (x!=-1 && y<LL || x>RR) vec2.push_back({x, y});
      |                               ~~~~~~^~~~~~~
books.cpp:91: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]
   91 |     for (int i=1;i<vec2.size();i++) {
      |                  ~^~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 0 ms 4444 KB Output is correct
3 Correct 0 ms 4444 KB Output is correct
4 Correct 0 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 0 ms 4444 KB Output is correct
8 Correct 0 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 0 ms 4444 KB Output is correct
16 Correct 0 ms 4444 KB Output is correct
17 Correct 1 ms 4440 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 4444 KB Output is correct
2 Correct 0 ms 4444 KB Output is correct
3 Correct 0 ms 4444 KB Output is correct
4 Correct 0 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 0 ms 4444 KB Output is correct
8 Correct 0 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 0 ms 4444 KB Output is correct
16 Correct 0 ms 4444 KB Output is correct
17 Correct 1 ms 4440 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 4532 KB Output is correct
21 Correct 1 ms 4444 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 4444 KB Output is correct
29 Correct 7 ms 5080 KB Output is correct

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 0 ms 4444 KB Output is correct
3 Correct 0 ms 4444 KB Output is correct
4 Correct 0 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 0 ms 4444 KB Output is correct
8 Correct 0 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 0 ms 4444 KB Output is correct
16 Correct 0 ms 4444 KB Output is correct
17 Correct 1 ms 4440 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 4532 KB Output is correct
21 Correct 1 ms 4444 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 4444 KB Output is correct
29 Correct 7 ms 5080 KB Output is correct
30 Correct 110 ms 36444 KB Output is correct
31 Correct 217 ms 47940 KB Output is correct
32 Correct 66 ms 31316 KB Output is correct
33 Correct 90 ms 42428 KB Output is correct
34 Correct 91 ms 42176 KB Output is correct
35 Correct 96 ms 44480 KB Output is correct
36 Correct 88 ms 42580 KB Output is correct
37 Correct 71 ms 32712 KB Output is correct
38 Correct 71 ms 31616 KB Output is correct
39 Correct 70 ms 31552 KB Output is correct
40 Correct 75 ms 31568 KB Output is correct
41 Correct 85 ms 31948 KB Output is correct
42 Correct 80 ms 31344 KB Output is correct
43 Runtime error 1084 ms 1048576 KB Execution killed with signal 9
44 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 5076 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 4444 KB Output is correct
2 Correct 0 ms 4444 KB Output is correct
3 Correct 0 ms 4444 KB Output is correct
4 Correct 0 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 0 ms 4444 KB Output is correct
8 Correct 0 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 0 ms 4444 KB Output is correct
16 Correct 0 ms 4444 KB Output is correct
17 Correct 1 ms 4440 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 4532 KB Output is correct
21 Correct 1 ms 4444 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 4444 KB Output is correct
29 Correct 7 ms 5080 KB Output is correct
30 Correct 110 ms 36444 KB Output is correct
31 Correct 217 ms 47940 KB Output is correct
32 Correct 66 ms 31316 KB Output is correct
33 Correct 90 ms 42428 KB Output is correct
34 Correct 91 ms 42176 KB Output is correct
35 Correct 96 ms 44480 KB Output is correct
36 Correct 88 ms 42580 KB Output is correct
37 Correct 71 ms 32712 KB Output is correct
38 Correct 71 ms 31616 KB Output is correct
39 Correct 70 ms 31552 KB Output is correct
40 Correct 75 ms 31568 KB Output is correct
41 Correct 85 ms 31948 KB Output is correct
42 Correct 80 ms 31344 KB Output is correct
43 Runtime error 1084 ms 1048576 KB Execution killed with signal 9
44 Halted 0 ms 0 KB -