Submission #1229307

#	Time	Username	Problem	Language	Result	Execution time	Memory
1229307		kl0989e	곤돌라 (IOI14_gondola)	C++20	25 / 100	18 ms	4496 KiB

gondola

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

#define ll long long
#define pi pair<int, int>
#define pl pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()

int valid(int n, int s[]) {
    set<int> nums;
    int z=-1;
    for (int i=0; i<n; i++) {
        nums.insert(s[i]);
        if (1<=s[i] && s[i]<=n && z==-1) {
            z=(s[i]-i+10*n)%n;
        }
        if (1<=s[i] && s[i]<=n) {
            if ((s[i]-i+10*n)%n!=z) {
                return 0;
            }
        }
    }
    if (nums.size()!=n) {
        return 0;
    }
    return 1;
}

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

int replacement(int n, int s[], int rep[]) {
    int z=1;
    vector<pi> inds;
    for (int i=0; i<n; i++) {
        if (1<=s[i] && s[i]<=n) {
            z=(s[i]-i+10*n)%n;
        }
        else {
            inds.pb({s[i],i});
        }
    }
    sort(all(inds));
    int ind=0;
    int lstval=n+1;
    for (auto [val,i]:inds) {
        rep[ind++]=(z+i+10*n)%n+n*(((z+i)%n)==0);
        lstval++;
        while (lstval<=val) {
            rep[ind++]=lstval-1;
        }
    }
    return *max_element(s,s+n)-n;
}

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

int countReplacement(int n, int inputSeq[]) {
    return -3;
}

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