oj.uz

Submission #1025536

# Submission time Handle Problem Language Result Execution time Memory
1025536 2024-07-17T06:32:07 Z huutuan Ancient Books (IOI17_books) C++14
50 / 100
 177 ms 18876 KB 
#include "books.h"

#include <bits/stdc++.h>

using namespace std;

const int N=1e6;
int vis[N], n;

long long minimum_walk(vector<int> p, int s) {
   n=p.size();
   vector<pair<int, int>> v;
   long long ans=0;
   vector<int> vv;
   for (int i=0; i<n; ++i) if (!vis[i] && i!=p[i]){
      int mx=i, mn=i;
      while (!vis[i]){
         vv.push_back(i);
         mx=max(mx, i);
         mn=min(mn, i);
         vis[i]=1;
         ans+=abs(p[i]-i);
         i=p[i];
      }
      v.emplace_back(mn, mx);
   }
   int pf=0, sf=0;
   for (int i=0; i<n; ++i) if (p[i]==i) ++pf; else break;
   for (int i=n-1; i>=0; --i) if (p[i]==i) ++sf; else break;
   sort(v.begin(), v.end());
   int cur=0;
   for (auto &i:v){
      if (cur<=i.first) ans+=(i.first-cur)*2;
      cur=max(cur, i.second);
   }
   ans+=(n-1-cur)*2;
   bool check=0;
   for (auto &i:v) check|=i.first<=s && s<=i.second;
   if (pf>=s) ans-=s*2;
   else ans-=pf*2;
   if (sf>=n-s-1) ans-=(n-s-1)*2;
   else ans-=sf*2;
   sort(vv.begin(), vv.end());
   if (check){
      auto it=lower_bound(vv.begin(), vv.end(), s);
      if (it==vv.begin()) ans+=(*it-s)*2;
      else ans+=min(*it-s, s-*prev(it))*2;
   }
   return ans;
}

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 344 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 1 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 344 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 1 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 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 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 344 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 1 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 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 161 ms 17600 KB Output is correct
31 Correct 177 ms 18020 KB Output is correct
32 Correct 74 ms 8016 KB Output is correct
33 Correct 84 ms 15796 KB Output is correct
34 Correct 86 ms 15796 KB Output is correct
35 Correct 98 ms 17520 KB Output is correct
36 Correct 103 ms 18876 KB Output is correct
37 Correct 108 ms 16316 KB Output is correct
38 Correct 114 ms 15976 KB Output is correct
39 Correct 113 ms 16060 KB Output is correct
40 Correct 126 ms 15972 KB Output is correct
41 Correct 149 ms 16068 KB Output is correct
42 Correct 154 ms 16068 KB Output is correct
43 Correct 110 ms 16308 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 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 344 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 1 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 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 161 ms 17600 KB Output is correct
31 Correct 177 ms 18020 KB Output is correct
32 Correct 74 ms 8016 KB Output is correct
33 Correct 84 ms 15796 KB Output is correct
34 Correct 86 ms 15796 KB Output is correct
35 Correct 98 ms 17520 KB Output is correct
36 Correct 103 ms 18876 KB Output is correct
37 Correct 108 ms 16316 KB Output is correct
38 Correct 114 ms 15976 KB Output is correct
39 Correct 113 ms 16060 KB Output is correct
40 Correct 126 ms 15972 KB Output is correct
41 Correct 149 ms 16068 KB Output is correct
42 Correct 154 ms 16068 KB Output is correct
43 Correct 110 ms 16308 KB Output is correct
44 Incorrect 1 ms 348 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45 Halted 0 ms 0 KB -