Submission #535433

#	Time	Username	Problem	Language	Result	Execution time	Memory
535433		mario05092929	Ancient Books (IOI17_books)	C++14	50 / 100	187 ms	24164 KiB

books

#include "books.h"
#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
const int INF = 1e9;
typedef long long ll;
typedef pair <int,int> pi;
typedef vector <int> vec;
using namespace std;
vec a;
int n;
int c[1000005],mn,mx;
vector <pi> line;

void dfs(int x) {
    if(c[x]) return;
    c[x] = 1;
    mn = min(mn,x);
    mx = max(mx,x);
    dfs(a[x]);
}

ll minimum_walk(vec P,int st) {
    ll ans = 0;
	a = P;
	n = a.size();
	line.push_back({0,0});
    for(int i = 0;i < n;i++) {
        ans += abs(i-a[i]);
        if(c[i]||i == a[i]) continue;
        mn = INF, mx = -INF;
        dfs(i);
        if(mn > line.back().y) {
            line.push_back({mn,mx});
        }
        else {
            line.back().y = max(line.back().y,mx);
        }
    }
    int m = line.size();
    for(int i = 1;i < m;i++) {
        ans += (line[i].x-line[i-1].y)*2;
    }
	return ans;
}

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