제출 #70240

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
70240	2018-08-22 14:02:19	E869120	Ancient Books (IOI17_books)	C++14	50 / 100	303 ms	107868 KiB

books

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
#include "books.h"
#include <bits/stdc++.h>
using namespace std;
int n,c[1000009];bool used[1000009];
long long minimum_walk(vector<int> p, int s) {
  n=p.size();
  long long sum=0;
  for(int i=0;i<n;i++){
    if(used[i]==true || i==p[i]) continue;
    int cx=i, maxn=0;
    while(true){
      sum+=abs(cx-p[cx]);used[cx]=true;maxn=max(maxn,cx);
      cx=p[cx];if(cx==i) break;
    }
    c[i]++;c[maxn]--;
  }
  for(int i=1;i<=n;i++) c[i]+=c[i-1];
  long long L=0;bool flag=false;
  for(int i=n;i>=0;i--){
    if(c[i]==1) flag=true;
    if(flag==true && c[i]==0) L++;
  }
  return sum+L*2;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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