Submission #960152

#	Time	Username	Problem	Language	Result	Execution time	Memory
960152		Nelt	Gondola (IOI14_gondola)	C++17	55 / 100	27 ms	5852 KiB

gondola

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

#define ll long long
#define endl "\n"

using namespace std;

int valid(int n, int a[])
{
    set<ll> s;
    for (ll i = 0; i < n; i++)
        s.insert(a[i]);
    if (s.size() != n)
        return 0;
    ll st = -1, b[n];
    for (ll i = 0; i < n; i++)
        if (a[i] <= n)
            st = i;
    if (st == -1)
        return 1;
    b[st] = a[st];
    for (ll i = st + 1; i < st + n; i++)
        b[i % n] = b[(i - 1 + n) % n] % n + 1;
    // for (ll i = 0; i < n; i++)
    //     cout << b[i] << " ";
    // cout << endl;
    for (ll i = 0; i < n; i++)
        if (a[i] <= n and a[i] != b[i])
            return 0;
    return 1;
}

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

int replacement(int n, int a[], int replacementSeq[])
{
    ll st = -1, b[n];
    for (ll i = 0; i < n; i++)
        if (a[i] <= n)
            st = i;
    if (st == -1)
        iota(b, b + n, 1);
    else
    {
        b[st] = a[st];
        for (ll i = st + 1; i < st + n; i++)
            b[i % n] = b[(i - 1 + n) % n] % n + 1;
    }
    ll ptr = 0, mx = max_element(a, a + n) - a;
    ll ind[a[mx] + 1];
    for (ll i = 0; i <= a[mx]; i++)
        ind[i] = -1;
    for (ll i = 0; i < n; i++)
        ind[a[i]] = i;
    for (ll i = n + 1; i <= a[mx]; i++)
        if (ind[i] != -1)
            replacementSeq[ptr++] = b[ind[i]], b[ind[i]] = i;
        else
            replacementSeq[ptr++] = b[mx], b[mx] = i;
    return ptr;
}

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

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

Compilation message (stderr)

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

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