oj.uz

Submission #1034948

# Submission time Handle Problem Language Result Execution time Memory
1034948 2024-07-25T23:49:16 Z vjudge1 Ancient Books (IOI17_books) C++17
50 / 100
 1425 ms 144200 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;
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) {
    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;
    auto it=ST.lower_bound(s);
    int ans2=1e9;
    if(it!=ST.end())
        ans2=min(ans2,*it-s);
    if(it!=ST.begin())
        ans2=min(ans2,s-*--it);
    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);
    return ans+2*ans2;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:27:20: warning: unused variable 'K' [-Wunused-variable]
   27 |     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 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 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 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 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 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 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 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 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 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 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 348 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 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 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 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 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 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 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 348 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 1402 ms 144200 KB Output is correct
31 Correct 1425 ms 144188 KB Output is correct
32 Correct 234 ms 61776 KB Output is correct
33 Correct 647 ms 114104 KB Output is correct
34 Correct 649 ms 114108 KB Output is correct
35 Correct 772 ms 122036 KB Output is correct
36 Correct 929 ms 128448 KB Output is correct
37 Correct 986 ms 128952 KB Output is correct
38 Correct 1006 ms 128992 KB Output is correct
39 Correct 991 ms 129204 KB Output is correct
40 Correct 1102 ms 129196 KB Output is correct
41 Correct 1297 ms 136356 KB Output is correct
42 Correct 1232 ms 134568 KB Output is correct
43 Correct 888 ms 120908 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 600 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 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 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 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 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 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 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 348 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 1402 ms 144200 KB Output is correct
31 Correct 1425 ms 144188 KB Output is correct
32 Correct 234 ms 61776 KB Output is correct
33 Correct 647 ms 114104 KB Output is correct
34 Correct 649 ms 114108 KB Output is correct
35 Correct 772 ms 122036 KB Output is correct
36 Correct 929 ms 128448 KB Output is correct
37 Correct 986 ms 128952 KB Output is correct
38 Correct 1006 ms 128992 KB Output is correct
39 Correct 991 ms 129204 KB Output is correct
40 Correct 1102 ms 129196 KB Output is correct
41 Correct 1297 ms 136356 KB Output is correct
42 Correct 1232 ms 134568 KB Output is correct
43 Correct 888 ms 120908 KB Output is correct
44 Incorrect 1 ms 600 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45 Halted 0 ms 0 KB -