Submission #400736

#	Time	Username	Problem	Language	Result	Execution time	Memory
400736		idk321	Ancient Books (IOI17_books)	C++11	0 / 100	1 ms	204 KiB

books

#include "books.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int N = 1000000;
bool vis[N];

long long minimum_walk(std::vector<int> p, int s) {

    ll res = 0;

    int n = p.size();
    for (int i = 0; i < n; i++)
    {
        if (p[i] == i || vis[i]) continue;
        int cur = i;
        do
        {
            vis[cur] = true;
            res += abs(p[cur] - cur);
            cur = p[cur];
        } while (cur != i);


    }

    if (res == 0) return 0;

    int first = -1;
    int last = -1;
    for (int i = 0; i < n; i++)
    {
        if (vis[i])
        {
            first = i;
            break;
        }
    }
    for (int i = n - 1; i >= 0; i--)
    {
        if (vis[i])
        {
            last = i;
            break;
        }
    }


    for (int i = n - 1; i >= 0; i--)
    {
        if (!vis[i])
        {
            if (i <= last)
            {
                if (i < first) res++;
                else res += 2;
            }
        }
    }

    return res;
}

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