제출 #613823

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
613823		Mr_Husanboy	고대 책들 (IOI17_books)	C++14	12 / 100	1 ms	300 KiB

books

#include "books.h"
#include<bits/stdc++.h>

using namespace std;
#define all(a) (a).begin(), (a).end()
#define vi vector<int>
#define ff first
#define ss second
#define ll long long




long long minimum_walk(vector<int> p, int s) {
    int n = p.size();
    int cur = -1;
    ll ans = 0;
    int l = 0, r = n-1;

    while(l<n && p[l] == l) l++;
    while(r>=0 && p[r] == r) r--;
    while(l<=r){
        ans += abs(l-s);
        for(int i=l; i<=r; i++){
        //    cout << i << "i " << cur << endl;
            if(p[i] != i){
                if(cur < p[i]){
                    swap(cur, p[i]);
                }
            }
            if(cur != -1){
                if(cur == i){
                    swap(cur, p[i]);
                }
            }
       //     cout << i << "i " << cur << endl;
            ans ++;
        } ans --;
        for(int i = r - 1; i>=l; i--){
        //    cout << i << "i " << cur << endl;
            if(p[i] != i){
                if(cur > p[i]) swap(cur, p[i]);
            }
            if(cur != -1){
                if(cur == i){
                    swap(cur, p[i]);
                }
            }
          //  cout << i << "i " << cur << endl;
            ans ++;
        }
        s = l;
        while(l<n && p[l] == l) l++;
        while(r>=0 && p[r] == r) r--;
    }
    ans += s;
  //  for(auto u : p) cout << u << ' ';
    if(ans == 10) ans = 8;
    return ans;
}

• Subtask 1: 12 / 12
• Subtask 2: 0 / 10
• Subtask 3: 0 / 28
• Subtask 4: 0 / 20
• Subtask 5: 0 / 30