제출 #598125

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
598125		enerelt14	Gondola (IOI14_gondola)	C++14	35 / 100	17 ms	3080 KiB

gondola

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

int valid(int n, int inputSeq[]){
    int k=n+1, s;
    for (int i=0;i<n;i++){
        if (i>n)continue;
        s=inputSeq[i]-i;
        if (k==n+1)k=s;
        if (k!=s && min(k, s)+n!=max(k, s))return 0;
    }
    return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
    int mx=0, k=1;
    for (int i=0;i<n;i++)mx=max(mx, gondolaSeq[i]);
    bool vis[mx+1]={0};
    int pos[mx+1], a[n];
    for (int i=0;i<n;i++){
        vis[gondolaSeq[i]]=1;
        pos[gondolaSeq[i]]=i;
        if (gondolaSeq[i]<=n)k=gondolaSeq[i]-i;
    }
    for (int i=0;i<n;i++){
        a[i]=k+i;
        if (a[i]<=0)a[i]+=n;
    }
    for (int i=n+1;i<=mx;i++){
        if (vis[i]){
            replacementSeq[i-n-1]=a[pos[i]];
            a[pos[i]]=i;
            continue;
        }
        replacementSeq[i-n-1]=a[pos[mx]];
        a[pos[mx]]=i;
    }
    return mx-n;
}

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

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