Submission #292741

#	Time	Username	Problem	Language	Result	Execution time	Memory
292741		Saboon	Ancient Books (IOI17_books)	C++17	0 / 100	1 ms	384 KiB

books

#include "books.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 10;

bool visited[maxn], root[maxn];

long long minimum_walk(vector<int> p, int s){
	int n = p.size();
	set<int> S;
	ll answer = 0;
	for (int i = 0; i < n-1; i++){
        S.insert(p[i]);
        if (!S.empty() and *S.begin() == i)
            S.erase(S.begin());
        answer += 2*S.size();
	}
	int tmp = 0;
	for (int i = 0; i < n; i++){
        if (!visited[i] and p[i] != i){
            tmp = i;
            int x = i;
            while (!visited[x]){
                visited[x] = 1;
                x = p[x];
            }
        }
	}
	answer += 2*tmp;
	return answer;
}

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