Submission #308125

#	Time	Username	Problem	Language	Result	Execution time	Memory
308125		juggernaut	Gondola (IOI14_gondola)	C++14	Compilation error	0 ms	0 KiB

gondola

#include"gondola.h"
#include<bits/stdc++.h>
#include"grader.cpp"
using namespace std;
typedef long long int ll;
ll mod=1e9+7;
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;
}
ll pw(ll a,ll b){
    if(!b)return 1;
    if(b&1)return (1ll*a*pw(a,b-1))%mod;
    ll x=pw(a,b>>1ll);
    return (1ll*x*x)%mod;
}
int countReplacement(int n,int a[]){
    if(!valid(n,a))return 0ll;
    sort(a,a+n);
    ll i,res=1,x=n;
    for(i=0;i<n;i++){
        if(a[i]<=n)continue;
        res=(res*pw(1ll*(n-i),1ll*(a[i]-x-1)))%mod;
        x=max(x,1ll*a[i]);
    }
    if(a[0]>n)res=(1ll*n*res)%mod;
    return res%mod;
}

Compilation message (stderr)

/tmp/ccnbkyDw.o: In function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'
/tmp/cca2AuNy.o:gondola.cpp:(.text.startup+0x0): first defined here
/tmp/ccnbkyDw.o:(.bss+0xf4260): multiple definition of `gondolaSequence'
/tmp/cca2AuNy.o:(.bss+0xf4260): first defined here
/tmp/ccnbkyDw.o:(.bss+0x0): multiple definition of `replacementSequence'
/tmp/cca2AuNy.o:(.bss+0x0): first defined here
collect2: error: ld returned 1 exit status