Submission #28912

#	Time	Username	Problem	Language	Result	Execution time	Memory
28912		top34051	Gondola (IOI14_gondola)	C++14	25 / 100	19 ms	4364 KiB

gondola

#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;

int cnt[250005];

int valid(int n, int p[]) {
    int i,x;
    x = 0;
    for(i=0;i<n;i++) if(p[x]>p[i]) x = i;
    for(i=0;i<n;i++) {
        cnt[p[i]]++;
        if(cnt[p[i]]>1) return 0;
    }
    for(i=0;i<n;i++) if(p[(x+i)%n] <= n && p[(x+i)%n] != p[x]+i) return 0;
    return 1;
}

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

int replacement(int n, int p[], int res[]) {
    int i,j,mx;
    mx = 0;
    for(i=0;i<n;i++) if(p[i]>mx) mx = p[i];
    for(i=0;i<n;i++) cnt[p[i]] = 1;
    for(i=1,j=0;i<=mx;i++) if(!cnt[i]) res[j++] = i;
    return j;
}

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

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

Compilation message (stderr)

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

• 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