oj.uz

Submission #561026

# Submission time Handle Problem Language Result Execution time Memory
561026 2022-05-12T07:48:56 Z neki Ancient Books (IOI17_books) C++14
50 / 100
 208 ms 48660 KB 
#include <bits/stdc++.h>
#define ll long long
#define vc vector
#define all(a) a.begin(), a.end()
#define fi first
#define se second
using namespace std;
 
ll minimum_walk(vc<int> p, int s){
    ll n=p.size();
    ll ans=0;
    
    vc<ll> doseg(n);iota(all(doseg), 0);
    
    vc<ll> vis(n, 0);
    for(ll i=0;i<n;++i) if(!vis[i]){
        vc<ll> cyc;
        for(ll cur=i;1;){
            vis[cur]=1;
            cyc.push_back(cur);
            ll nex=p[cur];
            ans+=abs(nex-cur);
            if(nex==i)break;
            cur=nex;
        }
        
        ll zac=(*min_element(all(cyc))), konc=(*max_element(all(cyc)));
        doseg[konc]=min(doseg[konc], zac);
    }
    vc<pair<ll, ll>> ints;
    for(ll i=0;i<n;++i){
        while(ints.size() and doseg[i]<=ints.back().second) ints.pop_back();
        if(ints.size()==0) ints.emplace_back((ll)0, i);
        else ints.emplace_back(ints.back().second+1, i);
    }
    ll st;for(ll i=0;i<ints.size();++i) if(ints[i].fi<=s and s<=ints[i].se) st=i;
    ll fl=st;for(ll i=st-1;i>=0;--i) if(ints[i].fi!=ints[i].se) fl=i;
    ll fr=st;for(ll i=st+1;i<ints.size();++i) if(ints[i].fi!=ints[i].se) fr=i;
    ans+=2 * (fr-fl);
    return ans;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:36:23: 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]
   36 |     ll st;for(ll i=0;i<ints.size();++i) if(ints[i].fi<=s and s<=ints[i].se) st=i;
      |                      ~^~~~~~~~~~~~
books.cpp:38:29: 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]
   38 |     ll fr=st;for(ll i=st+1;i<ints.size();++i) if(ints[i].fi!=ints[i].se) fr=i;
      |                            ~^~~~~~~~~~~~
books.cpp:37:21: warning: 'st' may be used uninitialized in this function [-Wmaybe-uninitialized]
   37 |     ll fl=st;for(ll i=st-1;i>=0;--i) if(ints[i].fi!=ints[i].se) fl=i;
      |                     ^

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 300 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 300 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 296 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 296 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 208 ms 48660 KB Output is correct
31 Correct 187 ms 46956 KB Output is correct
32 Correct 138 ms 47040 KB Output is correct
33 Correct 160 ms 47048 KB Output is correct
34 Correct 145 ms 47052 KB Output is correct
35 Correct 159 ms 38856 KB Output is correct
36 Correct 148 ms 34644 KB Output is correct
37 Correct 136 ms 30696 KB Output is correct
38 Correct 117 ms 30728 KB Output is correct
39 Correct 138 ms 30824 KB Output is correct
40 Correct 123 ms 31980 KB Output is correct
41 Correct 135 ms 42784 KB Output is correct
42 Correct 145 ms 36680 KB Output is correct
43 Correct 152 ms 30684 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 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 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 300 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 300 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 296 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 296 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 208 ms 48660 KB Output is correct
31 Correct 187 ms 46956 KB Output is correct
32 Correct 138 ms 47040 KB Output is correct
33 Correct 160 ms 47048 KB Output is correct
34 Correct 145 ms 47052 KB Output is correct
35 Correct 159 ms 38856 KB Output is correct
36 Correct 148 ms 34644 KB Output is correct
37 Correct 136 ms 30696 KB Output is correct
38 Correct 117 ms 30728 KB Output is correct
39 Correct 138 ms 30824 KB Output is correct
40 Correct 123 ms 31980 KB Output is correct
41 Correct 135 ms 42784 KB Output is correct
42 Correct 145 ms 36680 KB Output is correct
43 Correct 152 ms 30684 KB Output is correct
44 Incorrect 1 ms 340 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45 Halted 0 ms 0 KB -