oj.uz

Submission #1058765

# Submission time Handle Problem Language Result Execution time Memory
1058765 2024-08-14T13:27:31 Z shenfe1 Ancient Books (IOI17_books) C++17
22 / 100
 2000 ms 105812 KB 
#include <bits/stdc++.h>
#include "books.h"

#pragma GCC optimize("Ofast")

using namespace std;

#define pb push_back
#define pii pair<int,int>
#define sz(s) (int)s.size()
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define ll long long

const int MAX=1e6+10;

int n;
vector<int> g[MAX];
bool use[MAX];
vector<int> vec;
int pref[MAX];

struct dsu{
    int f[MAX];

    void init(int n){
        for(int i=0;i<n;i++)f[i]=i;
    }

    int get(int v){
        return (f[v]==v?v:f[v]=get(f[v]));
    }

    void unite(int a,int b){
        a=get(a),b=get(b);
        f[a]=b;
    }
}d;

int num[MAX];

bool is(int l,int r,vector<int> x){
    for(int pos:x){
        if(l<=pos&&pos<=r)return 1;
    }
    return 0;
}

ll minimum_walk(vector<int> p,int s){
    n=sz(p);
    int Lneed=0,Rneed=n-1;
    ll ans=0;
    for(int i=0;i<n;i++){
        ans+=abs(i-p[i]);
    }
    vector<vector<int>> x;
    vector<pii> seg;
    for(int i=0;i<n;i++){
        if(!use[i]){
            vec.clear();
            int v=i;
            while(!use[v]){
                num[v]=sz(seg);
                vec.pb(v);
                use[v]=1;
                v=p[v];
            }
            sort(all(vec));
            seg.pb({vec[0],vec.back()});
            x.pb(vec);
        }
    }
    d.init(n);
    for(int i=0;i<sz(seg);i++){
        auto [l,r]=seg[i];
        for(int j=i+1;j<sz(seg);j++){
            // assert(is(l,r,x[j])==is(seg[j].F,seg[j].S,x[i]));
            for(int pos:x[j]){
                if(l<=pos&&pos<=r){
                    d.unite(i,j);
                }
            }
        }
    }
    for(int i=0;i<n-1;i++){
        if(d.get(num[i])!=d.get(num[i+1])){
            ans+=2;
            d.unite(num[i],num[i+1]);
        }
    }
    for(int i=0;i<s;i++){
        if(p[i]==i)ans-=2;
        else break;
    }
    for(int i=n-1;i>s;i--){
        if(p[i]==i)ans-=2;
        else break;
    }

    return ans;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:52:9: warning: unused variable 'Lneed' [-Wunused-variable]
   52 |     int Lneed=0,Rneed=n-1;
      |         ^~~~~
books.cpp:52:17: warning: unused variable 'Rneed' [-Wunused-variable]
   52 |     int Lneed=0,Rneed=n-1;
      |                 ^~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 28248 KB Output is correct
2 Correct 3 ms 28252 KB Output is correct
3 Correct 4 ms 28504 KB Output is correct
4 Correct 4 ms 28252 KB Output is correct
5 Correct 4 ms 28248 KB Output is correct
6 Correct 4 ms 28252 KB Output is correct
7 Correct 3 ms 28252 KB Output is correct
8 Correct 3 ms 28256 KB Output is correct
9 Correct 4 ms 28252 KB Output is correct
10 Correct 4 ms 28096 KB Output is correct
11 Correct 3 ms 28252 KB Output is correct
12 Correct 4 ms 28252 KB Output is correct
13 Correct 4 ms 28252 KB Output is correct
14 Correct 3 ms 28252 KB Output is correct
15 Correct 3 ms 28072 KB Output is correct
16 Correct 3 ms 28252 KB Output is correct
17 Correct 4 ms 28252 KB Output is correct
18 Correct 4 ms 28248 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 28248 KB Output is correct
2 Correct 3 ms 28252 KB Output is correct
3 Correct 4 ms 28504 KB Output is correct
4 Correct 4 ms 28252 KB Output is correct
5 Correct 4 ms 28248 KB Output is correct
6 Correct 4 ms 28252 KB Output is correct
7 Correct 3 ms 28252 KB Output is correct
8 Correct 3 ms 28256 KB Output is correct
9 Correct 4 ms 28252 KB Output is correct
10 Correct 4 ms 28096 KB Output is correct
11 Correct 3 ms 28252 KB Output is correct
12 Correct 4 ms 28252 KB Output is correct
13 Correct 4 ms 28252 KB Output is correct
14 Correct 3 ms 28252 KB Output is correct
15 Correct 3 ms 28072 KB Output is correct
16 Correct 3 ms 28252 KB Output is correct
17 Correct 4 ms 28252 KB Output is correct
18 Correct 4 ms 28248 KB Output is correct
19 Correct 4 ms 28252 KB Output is correct
20 Correct 3 ms 28252 KB Output is correct
21 Correct 4 ms 28252 KB Output is correct
22 Correct 4 ms 28252 KB Output is correct
23 Correct 4 ms 28252 KB Output is correct
24 Correct 4 ms 28252 KB Output is correct
25 Correct 4 ms 28252 KB Output is correct
26 Correct 4 ms 28128 KB Output is correct
27 Correct 4 ms 28252 KB Output is correct
28 Correct 5 ms 28112 KB Output is correct
29 Correct 4 ms 28252 KB Output is correct

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 28248 KB Output is correct
2 Correct 3 ms 28252 KB Output is correct
3 Correct 4 ms 28504 KB Output is correct
4 Correct 4 ms 28252 KB Output is correct
5 Correct 4 ms 28248 KB Output is correct
6 Correct 4 ms 28252 KB Output is correct
7 Correct 3 ms 28252 KB Output is correct
8 Correct 3 ms 28256 KB Output is correct
9 Correct 4 ms 28252 KB Output is correct
10 Correct 4 ms 28096 KB Output is correct
11 Correct 3 ms 28252 KB Output is correct
12 Correct 4 ms 28252 KB Output is correct
13 Correct 4 ms 28252 KB Output is correct
14 Correct 3 ms 28252 KB Output is correct
15 Correct 3 ms 28072 KB Output is correct
16 Correct 3 ms 28252 KB Output is correct
17 Correct 4 ms 28252 KB Output is correct
18 Correct 4 ms 28248 KB Output is correct
19 Correct 4 ms 28252 KB Output is correct
20 Correct 3 ms 28252 KB Output is correct
21 Correct 4 ms 28252 KB Output is correct
22 Correct 4 ms 28252 KB Output is correct
23 Correct 4 ms 28252 KB Output is correct
24 Correct 4 ms 28252 KB Output is correct
25 Correct 4 ms 28252 KB Output is correct
26 Correct 4 ms 28128 KB Output is correct
27 Correct 4 ms 28252 KB Output is correct
28 Correct 5 ms 28112 KB Output is correct
29 Correct 4 ms 28252 KB Output is correct
30 Correct 139 ms 49176 KB Output is correct
31 Correct 133 ms 47808 KB Output is correct
32 Execution timed out 2031 ms 105812 KB Time limit exceeded
33 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 28248 KB Output is correct
2 Correct 3 ms 28252 KB Output is correct
3 Correct 4 ms 28504 KB Output is correct
4 Correct 4 ms 28252 KB Output is correct
5 Correct 4 ms 28248 KB Output is correct
6 Correct 4 ms 28252 KB Output is correct
7 Correct 3 ms 28252 KB Output is correct
8 Correct 3 ms 28256 KB Output is correct
9 Correct 4 ms 28252 KB Output is correct
10 Correct 4 ms 28096 KB Output is correct
11 Correct 3 ms 28252 KB Output is correct
12 Correct 4 ms 28252 KB Output is correct
13 Correct 4 ms 28252 KB Output is correct
14 Correct 3 ms 28252 KB Output is correct
15 Correct 3 ms 28072 KB Output is correct
16 Correct 3 ms 28252 KB Output is correct
17 Correct 4 ms 28252 KB Output is correct
18 Correct 4 ms 28248 KB Output is correct
19 Correct 4 ms 28252 KB Output is correct
20 Correct 3 ms 28252 KB Output is correct
21 Correct 4 ms 28252 KB Output is correct
22 Correct 4 ms 28252 KB Output is correct
23 Correct 4 ms 28252 KB Output is correct
24 Correct 4 ms 28252 KB Output is correct
25 Correct 4 ms 28252 KB Output is correct
26 Correct 4 ms 28128 KB Output is correct
27 Correct 4 ms 28252 KB Output is correct
28 Correct 5 ms 28112 KB Output is correct
29 Correct 4 ms 28252 KB Output is correct
30 Correct 139 ms 49176 KB Output is correct
31 Correct 133 ms 47808 KB Output is correct
32 Execution timed out 2031 ms 105812 KB Time limit exceeded
33 Halted 0 ms 0 KB -