Submission #744722

#	Time	Username	Problem	Language	Result	Execution time	Memory
744722		PixelCat	Gondola (IOI14_gondola)	C++14	10 / 100	18 ms	2376 KiB

gondola

#include "gondola.h"
#ifdef NYAOWO
#include "grader.cpp"
#endif

#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define int LL
using namespace std;
using LL = long long;
using pii = pair<int, int>;

const int MAXN = 100010;

int32_t valid(int32_t n, int32_t inputSeq[]) {
    vector<int> owo;
    vector<int> al;
    For(i, 0, n - 1) {
        int x = inputSeq[i];
        if(x <= n) {
            owo.eb(x - i);
        }
        al.eb(x);
    }
    sort(all(al));
    if(unique(all(al)) != al.end()) return 0;
    if(!sz(owo)) return 1;
    vector<pii> v(1, pii(owo[0], 0));
    for(auto &i:owo) {
        if(i == v.back().F) v.back().S++;
        else v.eb(i, 1);
    }
    return sz(v) <= 2;
}

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

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

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

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

• 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: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10