제출 #582765

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
582765		drdilyor	곤돌라 (IOI14_gondola)	C++17	55 / 100	40 ms	4948 KiB

gondola

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#ifdef ONPC
    #define cerr cout
    #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 = 250000;
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
mt19937 rng(RANDOM);

int valid(int n, int* a_) {
    vi a(n);
    for (int i = 0; i < n; i++) a[i] = a_[i];

    set<int> visited;
    for (int i = 0; i < n; i++) {
        if (visited.count(a[i])) return 0;
        visited.insert(a[i]);
    }

    int start = -1;
    for (int i = 0; i < n; i++) {
        if (a[i] <= n) {
            start = i - a[i] + 1;
            if (start < 0) start += n;
            break;
        }
    }
    if (start == -1) return 0;

    rotate(a.begin(), a.begin()+start, a.end());
    for (int i = 0; i < n;  i++) {
        if (a[i] <= n && a[i] != i+1) return 0;
    }

    return 1;
}

int replacement(int n, int a_[], int b[]) {
    vi a(n), orig(n);
    int mxi = 0, start = 0;
    for (int i = 0; i < n; i++) {
        a[i] = a_[i];
        if (a[i] > a[mxi]) mxi = i;
        if (a[i] <= n) start = (i-a[i]+1 + n)%n;
        orig[i] = i+1;
    }
    rotate(orig.begin(), orig.begin()+(n-start), orig.end());

    int off = (n+1);
    memset(b, -1, sizeof(int) * (a[mxi] - n));
    for (int i = 0; i < n; i++) {
        if (a[i] != orig[i]) b[a[i]-off] = orig[i];
    }
    int spare = orig[mxi];
    for (int i = n+1; i <= a[mxi]; i++) {
        if (b[i-off] == -1) {
            b[i-off] = spare;
            spare = i;
        }
    }
    b[a[mxi]-off] = spare;
    return a[mxi] - n;
}

int countReplacement(int n, int inputSeq[]) {
}

컴파일 시 표준 에러 (stderr) 메시지

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:84:1: warning: no return statement in function returning non-void [-Wreturn-type]
   84 | }
      | ^

• 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