Submission #582201

#	Time	Username	Problem	Language	Result	Execution time	Memory
582201		drdilyor	Gondola (IOI14_gondola)	C++17	0 / 100	1 ms	212 KiB

gondola

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#ifdef ONPC
    #include "t_debug.cpp"
#else
    #define debug(...) 42
#endif
#define allit(a) (a).begin(), (a).end()
#define sz(a) ((int) (a).size())
#define cut(s) {cout << s << '\n'; return 0;}
#include "gondola.h"

using namespace std;
using ll = long long;
using vi = vector<int>;
namespace pd = __gnu_pbds;
template<typename K> using ordered_set = pd::tree<K, pd::null_type, less<K>, pd::rb_tree_tag, pd::tree_order_statistics_node_update>;
template<typename... T> using hash_table = pd::gp_hash_table<T...>;

const int INF = 1e9;
const ll INFL = 1e18;
const int N = 1e5;
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
mt19937 rng(RANDOM);

int valid(int n, int a[]) {
    int fix = -1, dupe = 0;
    set<int> saw;
    for (int i = 0; i < n; i++) {
        if (fix == -1 && a[i] == i+1) {
            fix = i;
        }
        if (saw.count(a[i]) > 0) dupe = 1;
        saw.insert(a[i]);
    }
    if (dupe) return 0;
    if (fix == -1) return 1;
    for (int i = 1; i <= n; i++) {
        int j = (i-1 + fix) % n;
        if (a[j] <= n && a[j] != i) return 0;
    }
    return 1;
}

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

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

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

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

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 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