Submission #431555

#	Time	Username	Problem	Language	Result	Execution time	Memory
431555		MilosMilutinovic	Gondola (IOI14_gondola)	C++14	15 / 100	17 ms	632 KiB

gondola

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

int valid(int N, int A[]) {
    int j = -1;
    for (int i = 0; i < N; i++)
        if (A[i] >= 1 && A[i] <= N) {
            j = i;
            break;
        }
    if (j == -1) {
        set<int> vals;
        for (int i = 0; i < N; i++)
            vals.insert(A[i]);

        return vals.size() == N ? 1 : 0;
    }
    int val = A[j];
    for (int i = 0; i < N; i++) {
        int id = (i + j) % N;

        if (A[id] >= 1 && A[id] <= N && A[id] != val)
            return 0;

        val++;
        if (val == N + 1)
            val = 1;
    }
    return 1;
}

int replacement(int N, int A[], int ans[]) {
    return 1;
}

int countReplacement(int N, int A[]) {
    return valid(N, A);
}

Compilation message (stderr)

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:17:28: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   17 |         return vals.size() == N ? 1 : 0;
      |                ~~~~~~~~~~~~^~~~

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 0 / 10
• Subtask 4: 0 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 5 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10