Submission #1066598

#	Time	Username	Problem	Language	Result	Execution time	Memory
1066598		Charizard2021	Gondola (IOI14_gondola)	C++17	75 / 100	36 ms	6620 KiB

gondola

#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
int valid(int n, int inputSeq[]){
    set<int> s;
    bool works = true;
    int idx = 0;
    for(int i = 0; i < n; i++){
        s.insert(inputSeq[i]);
        if(inputSeq[i] <= n){
            idx = i;
            works = false;
        }
    }
    if((int)s.size() != n){
        return 0;
    }
    if(works){
        return 1;
    }
    int a[n];
    int val = inputSeq[idx];
    for(int i = idx; i < n; i++){
        a[i] = val++;
        val %= n;
        if(val == 0) val = n;
    }
    for(int i = 0; i < idx; i++){
        a[i] = val++;
        val %= n;
        if(val == 0) val = n;
    }
    bool works2 = true;
    for(int i = 0; i < n; i++){
        if(inputSeq[i] <= n){
            if(inputSeq[i] != a[i]){
                works2 = false;
            }
        }
    }
    if(works2){
        return 1;
    }
    return 0;
}

//----------------------

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
    //3, 8, 5, 6, 2
    int maxVal = 0;
    int minVal = INT_MAX;
    for(int x = 0; x < n; x++){
        maxVal = max(maxVal, gondolaSeq[x]);
        minVal = min(minVal, gondolaSeq[x]);
    }
    if(maxVal <= n){
        return 0;
    }
    if(minVal > n){
        int x[maxVal + 1];
        for(int a = n + 1; a <= maxVal; a++){
            x[a] = 0;
        }
        int idx = 0;
        for(int i = 0; i < n; i++){
            if(gondolaSeq[i] <= n){
                idx = i;
            }
        }
        int a[n];
        for(int i = 0; i < n; i++){
            a[i] = i + 1;
        }
        for(int i = 0; i < n; i++){
            if(gondolaSeq[i] > n){
                x[gondolaSeq[i]] = a[i];
            }
        }
        for(int i = maxVal; i >= n + 1; i--){
            if(x[i] == 0){
                x[i] = x[i + 1];
            }
        }
        map<int, vector<int> > mp;
        for(int i = n + 1; i <= maxVal; i++){
            mp[x[i]].push_back(i);
        }
        int val9 = 0;
        int idx9 = 0;
        vector<pair<int, vector<int> > > v9;
        for(auto it : mp){
            val9 += (int)it.second.size();
            v9.push_back(make_pair(it.second[0], (it.second)));
        }
        sort(v9.begin(), v9.end());
        //6, 7, 8, 9
        for(pair<int, vector<int> > c : v9){
            replacementSeq[idx9++] = x[c.first];
            for(int a : c.second){
                if(a == c.second.back()){
                    break;
                }
                replacementSeq[idx9++] = a;
            }
        }
        return val9;
    }
    int x[maxVal + 1];
    for(int a = n + 1; a <= maxVal; a++){
        x[a] = 0;
    }
    int idx = 0;
    for(int i = 0; i < n; i++){
        if(gondolaSeq[i] <= n){
            idx = i;
        }
    }
    int a[n];
    int val = gondolaSeq[idx];
    for(int i = idx; i < n; i++){
        a[i] = val++;
        val %= n;
        if(val == 0) val = n;
    }
    for(int i = 0; i < idx; i++){
        a[i] = val++;
        val %= n;
        if(val == 0) val = n;
    }
    for(int i = 0; i < n; i++){
        if(gondolaSeq[i] > n){
            x[gondolaSeq[i]] = a[i];
        }
    }
    for(int i = maxVal; i >= n + 1; i--){
        if(x[i] == 0){
            x[i] = x[i + 1];
        }
    }
    map<int, vector<int> > mp;
    for(int i = n + 1; i <= maxVal; i++){
        mp[x[i]].push_back(i);
    }
    int val9 = 0;
    int idx9 = 0;
    vector<pair<int, vector<int> > > v9;
    for(auto it : mp){
        val9 += (int)it.second.size();
        v9.push_back(make_pair(it.second[0], (it.second)));
    }
    sort(v9.begin(), v9.end());
    //6, 7, 8, 9
    for(pair<int, vector<int> > c : v9){
        replacementSeq[idx9++] = x[c.first];
        for(int a : c.second){
            if(a == c.second.back()){
                break;
            }
            replacementSeq[idx9++] = a;
        }
    }
    return val9;
}

//----------------------
const long long MOD = 1e9 + 9;
long long binaryExponention(long long a, long long b){
    a %= MOD;
    long long ans = 1;
    while(b > 0){
        if(b % 2 == 1){
            ans = (ans * a) % MOD;
        }
        a = (a * a) % MOD;
        b /= 2LL;
    }
    return ans;
}
int countReplacement(int n, int inputSeq[]){
    if(valid(n, inputSeq) == 0){
        return -5;
    }
    bool works = true;
    vector<long long> broke;
    for(long long i = 0; i < n; i++){
        if(inputSeq[i] < n){
            works = false;
        }
    }
    for(int i = 0; i < n; i++){
        if(inputSeq[i] >= n){
            broke.push_back(inputSeq[i]);
        }
    }
    sort(broke.begin(), broke.end());
    reverse(broke.begin(), broke.end());
    long long ans = 1;
    for(long long i = 0; i < (long long)broke.size(); i++){
        if(i != (long long)broke.size() - 1){
            long long val = broke[i] - broke[i + 1] - 1;
            long long val2 = binaryExponention(i + 1, val);
            ans = (ans * val2) % MOD;
        }
        else{
            long long val = broke[i] - n;
            long long val2 = binaryExponention((long long)broke.size(), val);
            ans = (ans * val2) % MOD;
        }
    }
    if(works){
        ans = (ans * (long long)n) % MOD;
    }
    return ans;
}

Compilation message (stderr)

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:65:13: warning: variable 'idx' set but not used [-Wunused-but-set-variable]
   65 |         int idx = 0;
      |             ^~~

• 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: 5 / 5
• Subtask 8: 15 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10