oj.uz

Submission #1007515

# Submission time Handle Problem Language Result Execution time Memory
1007515 2024-06-25T05:38:40 Z The_Samurai Gondola (IOI14_gondola) C++17
75 / 100
 35 ms 5208 KB 
#include "gondola.h"
#include "bits/stdc++.h"
using namespace std;
using ll = long long;

int valid(int n, int a[]) {
    int last = -1;
    set<int> st;
    for (int i = 0; i < 2 * n; i++) {
        if (a[i % n] > n) continue;
        st.insert(a[i % n]);
        if (last != -1 and (a[last % n] + i - last - 1) % n != a[i % n] - 1) return 0;
        last = i;
    }
    return st.size() == n;
}

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

int replacement(int n, int a[], int replacementSeq[]) {
    const int N = 2e5 + 5;
    vector<int> owns(N, -1), old(n);
    int any = -1, last = -1;
    for (int i = 0; i < n; i++) {
        if (a[i] <= n) continue;
        owns[a[i]] = i;
        if (any == -1 or a[any] < a[i]) any = i;
    }
    for (int i = 0; i < 2 * n; i++) {
        if (a[i % n] <= n) last = i;
        if (last == -1) continue;
        old[i % n] = (a[last % n] + i - last - 1) % n + 1;
    }
    if (last == -1) {
        for (int i = 0; i < n; i++) old[i] = i + 1;
    }
    int mx = *max_element(a, a + n), z = 0;
    for (int i = n + 1; i <= mx; i++) {     
        if (owns[i] != -1) {
            replacementSeq[z++] = old[owns[i]];
            old[owns[i]] = i;
        } else {
            replacementSeq[z++] = old[any];
            old[any] = i;
        }
    }
    return z;
}

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

const int mod = 1e9 + 9;

int countReplacement(int n, int a[]) {
    int last = -1;
    set<int> st;
    for (int i = 0; i < 2 * n; i++) {
        st.insert(a[i % n]);
        if (a[i % n] > n) continue;
        if (last != -1 and (a[last % n] + i - last - 1) % n != a[i % n] - 1) return 0;
        last = i;
    }
    if (st.size() != n) return 0;
    const int N = 3e5 + 5;
    vector<int> owns(N, -1);
    ll ans = 1, left = 0;
    for (int i = 0; i < n; i++) {
        if (a[i] > n) owns[a[i]] = i, left++;
    }
    int mx = *max_element(a, a + n);
    for (int i = n + 1; i <= mx; i++) {
        if (owns[i] != -1) left--;
        else ans = ans * left % mod;
    }
    if (*min_element(a, a + n) > n) {
        for (int i = 2; i <= n; i++) ans = ans * i % mod;
    }
    return ans;
}

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:15:22: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   15 |     return st.size() == n;
      |            ~~~~~~~~~~^~~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:63:19: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   63 |     if (st.size() != n) return 0;
      |         ~~~~~~~~~~^~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 9 ms 2140 KB Output is correct
7 Correct 10 ms 628 KB Output is correct
8 Correct 15 ms 3928 KB Output is correct
9 Correct 5 ms 1372 KB Output is correct
10 Correct 21 ms 4452 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 8 ms 2236 KB Output is correct
7 Correct 5 ms 600 KB Output is correct
8 Correct 15 ms 3932 KB Output is correct
9 Correct 5 ms 1372 KB Output is correct
10 Correct 21 ms 4480 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 5 ms 604 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 0 ms 1116 KB Output is correct
5 Correct 0 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 6 ms 1628 KB Output is correct
12 Correct 7 ms 1884 KB Output is correct
13 Correct 7 ms 1772 KB Output is correct
14 Correct 6 ms 1628 KB Output is correct
15 Correct 11 ms 2320 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1372 KB Output is correct
2 Correct 1 ms 1628 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 1 ms 1580 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct
6 Correct 1 ms 1628 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1628 KB Output is correct

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1628 KB Output is correct
2 Correct 1 ms 1628 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1628 KB Output is correct
8 Correct 1 ms 1628 KB Output is correct
9 Correct 31 ms 5208 KB Output is correct
10 Correct 24 ms 4700 KB Output is correct
11 Correct 9 ms 2648 KB Output is correct
12 Correct 10 ms 2904 KB Output is correct
13 Incorrect 4 ms 1880 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1628 KB Output is correct
2 Correct 0 ms 1628 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 0 ms 1628 KB Output is correct
5 Correct 0 ms 1628 KB Output is correct
6 Correct 1 ms 1628 KB Output is correct
7 Correct 1 ms 1628 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 35 ms 5196 KB Output is correct
10 Correct 25 ms 4700 KB Output is correct
11 Correct 9 ms 2652 KB Output is correct
12 Correct 10 ms 2904 KB Output is correct
13 Incorrect 3 ms 1884 KB Output isn't correct
14 Halted 0 ms 0 KB -