제출 #582234

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
582234		jasmin	곤돌라 (IOI14_gondola)	C++14	20 / 100	10 ms	956 KiB

gondola

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

const int inf=1e9;

vector<int> reorder(int n, int s[]){
    int small=inf; int ind=-1;
    for(int i=0; i<n; i++){
        if(s[i]<small){
            small=s[i];
            ind=i;
        }
    }

    if(n<small){
        vector<int> ans(n);
        for(int i=0; i<n; i++){
            ans[i]=s[i];
        }
        return ans;
    }
    int start=(n+ind-(small-1))%n;
    vector<int> ans(n);
    for(int i=0; i<n; i++){
        ans[i]=s[(start+i)%n];
    }
    return ans;
}

int valid(int n, int inputSeq[]){
    vector<int> s=reorder(n, inputSeq);
    set<int> used;
    for(int i=0; i<n; i++){
        if(s[i]!=i+1){
            if(s[i]<=n || used.find(s[i])!=used.end()){
                return false;
            }
            used.insert(s[i]);
        }
    }
    return true;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  return -2;
}

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

/*signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;
    vector<int> s(n);
    for(int i=0; i<n; i++){
        cin >> s[i];
    }
    //cout << valid(n, s) << "\n";
}*/

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 0 / 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