oj.uz

Submission #744768

# Submission time Handle Problem Language Result Execution time Memory
744768 2023-05-19T05:05:13 Z PixelCat Gondola (IOI14_gondola) C++14
90 / 100
 1000 ms 3140 KB 
#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;
const int MOD = 1000000009;

int32_t valid(int32_t n, int32_t inputSeq[]) {
    vector<int> owo;
    vector<int> al;
    int p = -1;
    For(i, 0, n - 1) {
        int x = inputSeq[i];
        if(x <= n) p = i;
        al.eb(x);
    }
    sort(all(al));
    if(unique(all(al)) != al.end()) return 0;
    if(p == -1) return 1;
    For(i, 0, n - 1) {
        int j = (p + i) % n;
        int vj = (inputSeq[p] - 1 + i) % n + 1;
        if(inputSeq[j] <= n && inputSeq[j] != vj) return 0;
    }
    return 1;
}

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

int32_t replacement(int32_t n, int32_t a[], int32_t res[]) {
    assert(valid(n, a));

    vector<pii> v; // {index, value}
    vector<int> b(n);
    int p = -1;
    For(i, 0, n - 1) {
        if(a[i] > n) v.eb(i, a[i]);
        else p = i;
    }
    sort(all(v), [&](pii p1, pii p2) {
        return p1.S < p2.S;
    });
    if(p < 0) {
        For(i, 0, n - 1) b[i] = i + 1;
    } else {
        For(i, 0, n - 1) b[(p + i) % n] = (a[p] + i - 1) % n + 1;
    }

    int last = n;
    int ptr = 0;
    for(auto &it:v) {
        int t = b[it.F];
        For(i, last + 1, it.S) {
            res[ptr] = (int32_t)t; ptr++;
            t = i;
        }
        last = it.S;
    }
    return (int32_t)ptr;
}

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

int32_t countReplacement(int32_t n, int32_t a[]) {
    if(!valid(n, a)) return 0;

    vector<int> v;
    int oao = n;
    For(i, 0, n - 1) {
        if(a[i] > n) v.eb(a[i]);
        else oao = 1;
    }
    sort(all(v));
    reverse(all(v));

    if(!sz(v)) return 1;
    int res = 1;
    int hi = v[0];
    For(i, n + 1, hi) {
        if(i == v.back()) {
            v.pop_back();
        } else {
            res = res * sz(v) % MOD;
        }
    }
    res = res * oao % MOD;
    return (int32_t)res;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1104 KB Output is correct
7 Correct 14 ms 1740 KB Output is correct
8 Correct 10 ms 1684 KB Output is correct
9 Correct 5 ms 724 KB Output is correct
10 Correct 13 ms 1740 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 280 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 9 ms 1104 KB Output is correct
7 Correct 15 ms 1712 KB Output is correct
8 Correct 12 ms 1644 KB Output is correct
9 Correct 5 ms 724 KB Output is correct
10 Correct 16 ms 1740 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 9 ms 976 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 17 ms 1728 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 224 KB Output is correct
3 Correct 0 ms 224 KB Output is correct
4 Correct 1 ms 216 KB Output is correct
5 Correct 1 ms 224 KB Output is correct
6 Correct 1 ms 224 KB Output is correct
7 Correct 1 ms 216 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 13 ms 1756 KB Output is correct
12 Correct 14 ms 1740 KB Output is correct
13 Correct 17 ms 1992 KB Output is correct
14 Correct 11 ms 1740 KB Output is correct
15 Correct 21 ms 2320 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct

Subtask #8
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 232 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 216 KB Output is correct

Subtask #9
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 216 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 17 ms 1668 KB Output is correct
10 Correct 16 ms 1332 KB Output is correct
11 Correct 11 ms 820 KB Output is correct
12 Correct 10 ms 888 KB Output is correct
13 Correct 3 ms 340 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 17 ms 1740 KB Output is correct
10 Correct 15 ms 1348 KB Output is correct
11 Correct 8 ms 784 KB Output is correct
12 Correct 13 ms 888 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Execution timed out 1083 ms 3140 KB Time limit exceeded
15 Halted 0 ms 0 KB -