Submission #675570

#	Time	Username	Problem	Language	Result	Execution time	Memory
675570		benjaminkleyn	Gondola (IOI14_gondola)	C++17	20 / 100	12 ms	2108 KiB

gondola

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

int cnt[250001];
int valid(int n, int inputSeq[])
{
    memset(cnt, 0, sizeof(cnt));
    for (int i = 0; i < n; i++)
    {
        cnt[inputSeq[i]]++;
        if (cnt[inputSeq[i]] > 1)
            return 0;
    }
    int startPos = -1;
    for (int i = 0; i < n; i++)
        if (inputSeq[i] <= n)
        {
            startPos = (i - inputSeq[i] + 1 + n) % n;
            break;
        }

    if (startPos == -1)
        return 1;

    for (int i = 0; i < n; i++)
        if (inputSeq[i] <= n && startPos != (i - inputSeq[i] + 1 + n) % n)
            return 0;

    return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
}

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

Compilation message (stderr)

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

• 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