Submission #413940

#	Time	Username	Problem	Language	Result	Execution time	Memory
413940		dxz05	Gondola (IOI14_gondola)	C++14	20 / 100	39 ms	6140 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 3e5 + 2e2;

int a[MAXN];

int valid(int n, int inputSeq[]){
    for (int i = 0; i < 3 * n; i++) a[i] = inputSeq[i % n];

    set<int> s;
    for (int i = 0; i < n; i++) s.insert(a[i]);

    if (s.size() != n) return 0;

    int ind = -1;
    for (int i = n; i < 2 * n; i++){
        if (a[i] <= n){
            ind = i;
            break;
        }
    }

    if (ind == -1) return 1;

    for (int i = ind - a[ind] + 1; i <= ind - a[ind] + n; i++){
        if (a[i] > n) continue;
        if (a[i] - a[ind] != i - ind) return 0;
    }

    return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
    return -2;
}

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

int countReplacement(int n, int inputSeq[]){
    return -3;
}

Compilation message (stderr)

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:16:18: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   16 |     if (s.size() != n) return 0;
      |         ~~~~~~~~~^~~~

• 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