제출 #209576

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
209576		Lukoloz	Gondola (IOI14_gondola)	C++14	55 / 100	24 ms	2168 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"
#define ff first
#define ss second
#define pb push_back
#define MAXN 100005
using namespace std;
int valid(int n, int inputSeq[]){
    bool fl[250005];
    int tdif,dif=-1;
    for (int i=0; i<250005; i++) fl[i]=0;
    for (int i=0; i<n; i++){
        if (fl[inputSeq[i]]) return 0;
        fl[inputSeq[i]]=1;
        if (inputSeq[i]<=n){
            tdif=inputSeq[i]-1-i;
            if (tdif<0) tdif+=n;
            if (dif!=-1 && tdif!=dif) return 0;
            dif=tdif;
        }
    }
    return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
    int dif=0,mx=0,mxi;
    for (int i=0; i<n; i++){
        if (gondolaSeq[i]>mx){ mx=gondolaSeq[i]; mxi=i; }
        if (gondolaSeq[i]<=n){
            dif=gondolaSeq[i]-1-i;
            if (dif<0) dif+=n;
        }
    }
    for (int i=0; i<mx-n; i++) replacementSeq[i]=0;
    for (int i=0; i<n; i++){
        if (i==mxi || gondolaSeq[i]<=n) continue;
        replacementSeq[gondolaSeq[i]-n-1]=(i+dif)%n+1;
    }

    mxi=(mxi+dif)%n+1;
    for (int i=0; i<mx-n; i++){
        if (replacementSeq[i]!=0) continue;
        replacementSeq[i]=mxi;
        mxi=i+n+1;
    } 

    // for (int i=0; i<mx-n; i++) cout<<replacementSeq[i]<<" "; cout<<endl;
    
    return mx-n;
}
int countReplacement(int n, int inputSeq[]){

}
// int main(){
//     int n;
//     cin>>n;
//     int arr[n],arr1[100];
//     for (int i=0; i<n; i++) cin>>arr[i];
//     cout<<replacement(n,arr,arr1)<<endl;

// }

컴파일 시 표준 에러 (stderr) 메시지

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:52:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:25:20: warning: 'mxi' may be used uninitialized in this function [-Wmaybe-uninitialized]
     int dif=0,mx=0,mxi;
                    ^~~

• 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