제출 #138850

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
138850	2019-07-30 14:22:51	win11905	Ancient Books (IOI17_books)	C++11	50 / 100	250 ms	27640 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
28
29
30
#include <bits/stdc++.h>
#include "books.h"
#define long long long 
using namespace std;
const int N = 1e6+5;
long ans = 0;
int n, x, y;
int id[N], L[N], R[N], ptr;
bool check[N];
void extend(int &l, int &r) {
  int ll = min(L[id[l]], L[id[r]]);
  int rr = max(R[id[l]], R[id[r]]);
  while(ll < l || r < rr) {
    if(ll < l) l--;
    else r++;
    ll = min(ll, min(L[id[l]], L[id[r]]));
    rr = max(rr, max(R[id[l]], R[id[r]]));
  }
}
long minimum_walk(vector<int> p, int s) {
  n = p.size();
  x = y = s;
  for(int i = 0; i < n; ++i) ans += abs(i - p[i]);
  for(int i = 0; i < n; ++i) if(!check[i]) {
    id[i] = ++ptr, check[i] = true;
    L[ptr] = R[ptr] = i;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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