oj.uz

Submission #1034959

# Submission time Handle Problem Language Result Execution time Memory
1034959 2024-07-26T00:24:37 Z vjudge1 Ancient Books (IOI17_books) C++17
50 / 100
 1501 ms 144248 KB 
#include "books.h"
#include<bits/stdc++.h>
using namespace std;
int par[1001000],sz[1001000];
int abp(int n){
    return par[n]?par[n]=abp(par[n]):n;
}
int merge(int a,int b){
    a=abp(a+1);b=abp(b+1);
    if(a-b)par[a]=b,
        sz[b]+=sz[a];
    return a!=b;
}
set<int>notanedge,ST;
map<int,int>mp;
int s_;
void mergefrom(int l,int r){
    ST.insert(l),ST.insert(r);
    while(notanedge.lower_bound(l)!=notanedge.lower_bound(r)){
        int k=*notanedge.lower_bound(l);
        merge(k,k+1);
        notanedge.erase(k);
        mp[k];mp[k+1];
    }
}
long long minimum_walk(std::vector<int> p, int s) {
    s_=s;
    long long ans=0;
    int n=p.size(),K=0;
    for(int i=0;i<n-1;i++)
        notanedge.insert(i);
    for(int i=0;i<n;i++) if(i-p[i])
        ans+=abs(i-p[i]), mergefrom(i,p[i]);
    if(ST.empty())return 0;
    vector<tuple<int,int,int>>v;
    for(auto [i,j]:mp){
        auto it=mp.upper_bound(i);
        if(it!=mp.end())
            v.push_back({it->first-i,i,it->first});
    }
    sort(v.begin(),v.end());
    for(auto [w,x,y]:v)
        ans+=w*2*merge(x,y);
    int ans2=min(abs(*ST.begin()-s),abs(*--ST.end()-s));
    return ans+2*ans2;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:29:20: warning: unused variable 'K' [-Wunused-variable]
   29 |     int n=p.size(),K=0;
      |                    ^

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 440 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 448 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 440 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 448 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 420 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 440 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 448 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 420 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1496 ms 144036 KB Output is correct
31 Correct 1501 ms 144248 KB Output is correct
32 Correct 246 ms 61784 KB Output is correct
33 Correct 663 ms 114000 KB Output is correct
34 Correct 689 ms 114108 KB Output is correct
35 Correct 817 ms 122040 KB Output is correct
36 Correct 895 ms 128440 KB Output is correct
37 Correct 965 ms 128944 KB Output is correct
38 Correct 1020 ms 128952 KB Output is correct
39 Correct 1030 ms 129188 KB Output is correct
40 Correct 1135 ms 129364 KB Output is correct
41 Correct 1293 ms 136360 KB Output is correct
42 Correct 1225 ms 134568 KB Output is correct
43 Correct 920 ms 120996 KB Output is correct

Subtask #4
0 / 20.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 440 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 448 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 420 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1496 ms 144036 KB Output is correct
31 Correct 1501 ms 144248 KB Output is correct
32 Correct 246 ms 61784 KB Output is correct
33 Correct 663 ms 114000 KB Output is correct
34 Correct 689 ms 114108 KB Output is correct
35 Correct 817 ms 122040 KB Output is correct
36 Correct 895 ms 128440 KB Output is correct
37 Correct 965 ms 128944 KB Output is correct
38 Correct 1020 ms 128952 KB Output is correct
39 Correct 1030 ms 129188 KB Output is correct
40 Correct 1135 ms 129364 KB Output is correct
41 Correct 1293 ms 136360 KB Output is correct
42 Correct 1225 ms 134568 KB Output is correct
43 Correct 920 ms 120996 KB Output is correct
44 Incorrect 1 ms 344 KB 3rd lines differ - on the 1st token, expected: '3304', found: '3594'
45 Halted 0 ms 0 KB -