제출 #466462

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
466462		Carmel_Ab1	곤돌라 (IOI14_gondola)	C++17	25 / 100	23 ms	1340 KiB

gondola

#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;

#include "gondola.h"
//#include "grader.cpp"
#define pb push_back
#define all(x) x.begin(),x.end()

int valid(int n, int inputSeq[]){
    vi a(n);
    for(int i=0; i<n; i++)
        a[i]=inputSeq[i];
    vi s(a);
    sort(all(s));
    for(int i=0; i<n-1; i++)
        if(s[i]==s[i+1])
            return 0;
    int f=-1;
    for(int i=0; i<n; i++)
        if(a[i]<=n)
            f=i;
    for(int i=0; i<n; i++)
        if(a[i]<=0)
            return 0;
    if(f==-1)return 1;
    for(int i=0,j=a[f]; i<n; j=((j%n) +1),i++){
        int cur=a[(i+f)%n];
        if(cur!=j && cur<=n)
            return 0;
    }
    return 1;
}

int replacement(int n, int a[], int rep[]){
    vi ans,org(n);
    int f=-1;
    for(int i=0; i<n; i++)
        if(a[i]<=n)
            f=i;
    for(int i=0,j=a[f]; i<n; j=((j%n) +1),i++){
        int cur=a[(i+f)%n];
        org[(i+f)%n]=j;
    }
    vector<pair<int,int>>s;
    for(int i=0; i<n; i++)
        s.push_back({a[i],i});
    sort(all(s));
    vector<bool>has(250001);
    for(int i=0; i<n; i++)
        has[a[i]]=1;
    for(int i=0,j=n+1; i<n; i++){
        if(s[i].first<=n)continue;
        ans.pb(org[s[i].second]);
        while(!has[j]){
            has[j]=1;
            ans.pb(j);
            org[i]=j;
            j++;
        }
    }

    for(int i=0; i<ans.size(); i++)
        rep[i]=ans[i];
    return ans.size();
}

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

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

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

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:42:13: warning: unused variable 'cur' [-Wunused-variable]
   42 |         int cur=a[(i+f)%n];
      |             ^~~
gondola.cpp:63:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |     for(int i=0; i<ans.size(); i++)
      |                  ~^~~~~~~~~~~

• 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