제출 #307811

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
307811		juggernaut	곤돌라 (IOI14_gondola)	C++14	60 / 100	25 ms	2296 KiB

gondola

#include"gondola.h"
#include<bits/stdc++.h>
//#include"grader.cpp"
using namespace std;
int valid(int n,int a[]){
    int i=0,need;
    while(i<n&&a[i]>n)i++;
    need=a[i];
    while(i<n){
        if(a[i]<=n&&a[i]!=need)return 0;
        if(need==n)need=1;
        else need++;
        i++;
    }
    sort(a,a+n);
    for(i=1;i<n;i++)if(a[i]==a[i-1])return 0;
    return 1;
}
int replacement(int n,int a[],int res[]){
    vector<pair<int,int>>b;
    int i=0,ind=n,need=1,len=0,x;
    while(i<n&&a[i]>n)i++;
    if(i!=n)need=a[i]-i;
    if(need<1)need+=n;
    for(i=0;i<n;i++,need=need%n+1)b.push_back({a[i],need});
    sort(b.begin(),b.end());
    i=0;
    while(i<n){
        if(b[i].first<=n){
            i++;
            continue;
        }
        res[len++]=b[i].second;
        x=++ind;
        while(x!=b[i].first){
            res[len++]=x;
            x=++ind;
        }
        i++;
    }
    return len;
}
int countReplacement(int n,int a[]){
    if(!valid(n,a))return 0;
    vector<pair<int,int>>b;
    int i=0,ind=n,need=1,len=0,x;
    long long cnt=1,mod=1e9+7,y;
    while(i<n&&a[i]>n)i++;
    if(i!=n)need=a[i]-i;
    if(need<1)need+=n;
    for(i=0;i<n;i++,need=need%n+1)b.push_back({a[i],need});
    sort(b.begin(),b.end());
    i=0;
    while(i<n){
        if(b[i].first<=n){
            i++;
            continue;
        }
        y=b[i].first-ind;
        ind=b[i].first;
        cnt=(cnt*y)%mod;
        i++;
    }
    return cnt;
}

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

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:46:26: warning: unused variable 'len' [-Wunused-variable]
   46 |     int i=0,ind=n,need=1,len=0,x;
      |                          ^~~
gondola.cpp:46:32: warning: unused variable 'x' [-Wunused-variable]
   46 |     int i=0,ind=n,need=1,len=0,x;
      |                                ^

• 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: 5 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10