oj.uz

답안 #1025533

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1025533 2024-07-17T06:30:53 Z huutuan 고대 책들 (IOI17_books) C++14
0 / 100
 1 ms 348 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);
   }
   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
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 Incorrect 0 ms 348 KB 3rd lines differ - on the 1st token, expected: '4', found: '2'
6 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 Incorrect 0 ms 348 KB 3rd lines differ - on the 1st token, expected: '4', found: '2'
6 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 Incorrect 0 ms 348 KB 3rd lines differ - on the 1st token, expected: '4', found: '2'
6 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2744'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 Incorrect 0 ms 348 KB 3rd lines differ - on the 1st token, expected: '4', found: '2'
6 Halted 0 ms 0 KB -