Submission #374540

#	Time	Username	Problem	Language	Result	Execution time	Memory
374540		vishesh312	Gondola (IOI14_gondola)	C++17	55 / 100	39 ms	5228 KiB

gondola

#include "bits/stdc++.h"
using namespace std;
#include "gondola.h"

int countReplacement(int n, int a[]) {return 0;}

int valid(int n, int arr[]) {
    map<int, bool> mp;
    vector<int> v(arr, arr+n);
    auto it = min_element(v.begin(), v.end());
    rotate(v.begin(), it, v.end());
    for (int i = 0; i < n; ++i) {
        if (mp[v[i]]) return 0;
        mp[v[i]] = true;
        if (v[i] <= n and i != v[i] - v[0]) return 0;
    }
    return 1;
}

int replacement(int n, int a[], int b[]) {
    vector<int> v(a, a+n);
    auto it = min_element(v.begin(), v.end());
    int mn = *it, pos = it - v.begin(), mx = *max_element(v.begin(), v.end());
    rotate(v.begin(), v.begin() + (pos - mn%n + 1 + n) % n, v.end());
    map<int, int> mp;
    for (int i = 0; i < n; ++i) {
        mp[v[i]] = i+1;
    }
    for (int i = n+1; i <= mx; ++i) {
        if (mp.count(i)) b[i-n-1] = mp[i];
        else {
            b[i-n-1] = mp[mx];
            mp[mx] = i;
        }
    }
    return mx - n;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 10 / 10
• Subtask 6: 20 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10