Submission #31691

#	Time	Username	Problem	Language	Result	Execution time	Memory
31691		top34051	곤돌라 (IOI14_gondola)	C++14	20 / 100	13 ms	5140 KiB

gondola

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

int n;
int p[maxn], a[maxn];
int vis[250005];

int valid(int N, int p[]) {
    int i, x = 0, val;
    n = N;
    for(i=0;i<n;i++) if(p[i]<=n) x = i;
    val = p[x];
    for(i=0;i<n;i++) a[x] = val, x = (x+1)%n, val = val%n+1;
    for(i=0;i<n;i++) if(p[i]<=n && a[i]!=p[i]) return 0;
    memset(vis,0,sizeof(vis));
    for(i=0;i<n;i++) {
        if(vis[p[i]]) return 0;
        vis[p[i]] = 1;
    }
    return 1;
}

int replacement(int N, int data[], int res[]) {
}

int countReplacement(int N, int data[]) {
}

Compilation message (stderr)

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:26:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:29: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: 0 / 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