제출 #1075940

#제출 시각아이디문제언어결과실행 시간메모리
1075940edogawa_something고대 책들 (IOI17_books)C++17
50 / 100
110 ms16000 KiB
#include "books.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vii;
typedef pair<ll,ll> pii;
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define pb push_back
ll n;
bool vis[2000000];
long long minimum_walk(vector<int> p, int s) {
  n=p.size();
  ll res=0;
  bool chk=1;
  for(int i=0;i<n;i++) {
    if(p[i]!=i)
      chk=0;
  }
  if(chk)
    return 0;
  ll cnt=0;
  for(int i=0;i<n;i++) {
    if(p[i]>=i) {
      cnt++;
    }
    vis[p[i]]=1;
    if(vis[i])
      cnt--;
    res+=2*cnt;
    if(cnt==0)
      res+=2;
  }
  res-=2;
  for(int i=0;i<s;i++) {
    if(p[i]==i)
      res-=2;
    else
      break;
  }
  for(int i=n-1;i>s;i--) {
    if(p[i]==i)
      res-=2;
    else
      break;
  }
  return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...