제출 #586960

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
586960		krit3379	곤돌라 (IOI14_gondola)	C++17	55 / 100	18 ms	2252 KiB

gondola

#include<bits/stdc++.h>
using namespace std;
#include "gondola.h"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define N 100005

int valid(int n, int a[]){
    int i,mod=1e9;
    bitset<250005> vis;
    for(i=0;i<n;i++){
        if(vis[a[i]])return 0;
        vis[a[i]]=true;
        if(a[i]>n)continue;
        if(mod==1e9)mod=(i-a[i]+n)%n;
        else if(mod!=(i-a[i]+n)%n)return 0;
    }
    return 1;
}

int replacement(int n, int a[], int b[]){
    int i,j,now,last,cnt;
    vector<pair<int,int>> v;
    for(i=0;i<n;i++)if(a[i]>n)v.push_back({a[i],i});
    for(i=0;i<n;i++){
        if(a[i]<=n){
            now=a[i];
            for(j=i+1;j<n;j++){
                now++;
                if(now==n+1)now=1;
                a[j]=now;
            }
            for(j=0;j<i;j++){
                now++;
                if(now==n+1)now=1;
                a[j]=now;
            }
            break;
        }
    }
    if(i==n)for(i=0;i<n;i++)a[i]=i+1;
    sort(v.begin(),v.end());
    i=0;
    last=n;
    for(auto [now,x]:v){
        cnt=now-last;
        while(cnt--)b[i++]=a[x],a[x]=i+n;
        last=now;
    }
    return i;
}

int countReplacement(int n, int inputSeq[]){

}

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

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:55:1: warning: no return statement in function returning non-void [-Wreturn-type]
   55 | }
      | ^

• 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