Submission #33542

#	Time	Username	Problem	Language	Result	Execution time	Memory
33542		top34051	Ancient Books (IOI17_books)	C++14	50 / 100	213 ms	17644 KiB

books

#include "books.h"
#include<bits/stdc++.h>
using namespace std;

#define pii pair<int,int>
#define X first
#define Y second
const int maxn = 1000005;

int n;
long long sum[maxn];

long long minimum_walk(vector<int> pos, int s) {
    int i, l = s, r = s;
    long long ans = 0;
    n = pos.size();
    for(i=0;i<n;i++) {
        sum[min(i,pos[i])]++, sum[max(i,pos[i])]--;
        if(i!=pos[i]) {
            l = min(l, min(i,pos[i]));
            r = max(r, max(i,pos[i]));
        }
    }
    for(i=l;i<r;i++) {
        sum[i] += sum[i-1];
        ans += max(2LL, sum[i]);
    }
    return ans;
}

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