oj.uz

Submission #936486

# Submission time Handle Problem Language Result Execution time Memory
936486 2024-03-02T00:57:26 Z peterandvoi Gondola (IOI14_gondola) C++17
75 / 100
 29 ms 7504 KB 
#include <bits/stdc++.h>

#include "gondola.h"

using namespace std;

#ifdef ngu
#include "debug.h"
#else
#define debug(...) 42
#endif

const int N = 250005;

int cnt[N];

int shift(int i, int j, int n) {
    i += j;
    if (i < 1) {
        i += n;
    }
    if (i > n) {
        i -= n;
    }
    return i;
}

int valid(int n, int inputSeq[]) {
    memset(cnt, 0, sizeof(cnt));
    for (int i = 0; i < n; ++i) {
        assert(inputSeq[i] < N);
        if (cnt[inputSeq[i]]) {
            return 0;
        }
        cnt[inputSeq[i]]++;
    }
    int delta = 0;
    for (int i = 0; i < n; ++i) {
        if (inputSeq[i] <= n) {
            int j = inputSeq[i];
            delta = j - i - 1;
            break;
        }
    }
    for (int i = 0; i < n; ++i) {
        if (inputSeq[i] <= n) {
            int j = shift(i + 1, delta, n);
            if (j != inputSeq[i]) {
                return 0;
            }
        }
    }
    return 1;
}

int pos[N];

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
    memset(pos, -1, sizeof(pos));
    for (int i = 0; i < n; ++i) {
        pos[gondolaSeq[i]] = i;
    }
    set<int> cur;
    for (int i = 0; i < n; ++i) {
        cur.insert(i);
    }
    for (int i = 0; i < n; ++i) {
        if (gondolaSeq[i] <= n) {
            cur.erase(i);
        }
    }
    int delta = 0;
    for (int i = 0; i < n; ++i) {
        if (gondolaSeq[i] <= n) {
            int j = gondolaSeq[i];
            delta = j - i - 1;
            break;
        }
    }
    for (int i = 0; i < n; ++i) {
        gondolaSeq[i] = shift(i + 1, delta, n);
    }
    int m = -1;
    for (int i = n + 1; i < N; ++i) {
        if (!cur.size()) {
            break;
        }
        int j = *cur.begin();
        if (pos[i] != -1) {
            j = pos[i];
            cur.erase(j);
        }
        replacementSeq[++m] = gondolaSeq[j];
        gondolaSeq[j] = i;
    }
    return m + 1;
}

const int MOD = (int) 1e9 + 9;

int bin_pow(int a, int b) {
    int res = 1;
    for (; b; b >>= 1, a = 1LL * a * a % MOD) {
        if (b & 1) {
            res = 1LL * res * a % MOD;
        }
    }
    return res;
}

int countReplacement(int n, int inputSeq[]) {
    set<int> pos;
    for (int i = 0; i < n; ++i) {
        if (pos.find(inputSeq[i]) != pos.end()) {
            return 0;
        }
        pos.insert(inputSeq[i]);
    }
    int cnt = n;
    for (int i = 0; i < n; ++i) {
        if (inputSeq[i] <= n) {
            cnt--;
            pos.erase(inputSeq[i]);
        }
    }
    int res = 1;
    int delta = 0;
    for (int i = 0; i < n; ++i) {
        if (inputSeq[i] <= n) {
            int j = inputSeq[i];
            delta = j - i - 1;
            break;
        }
    }
    for (int i = 0; i < n; ++i) {
        if (inputSeq[i] <= n && inputSeq[i] != shift(i + 1, delta, n)) {
            return 0;
        }
        inputSeq[i] = shift(i + 1, delta, n);
    }
    if (cnt == n) {
        for (int i = 1; i <= n; ++i) {
            res = 1LL * res * i % MOD;
        }
    }
    int p = n;
    for (int j : pos) {
        res = 1LL * res * bin_pow(cnt, j - 1 - p) % MOD;
        p = j;
        cnt--;
    }
    return res;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 3 ms 2628 KB Output is correct
7 Correct 6 ms 3164 KB Output is correct
8 Correct 5 ms 3176 KB Output is correct
9 Correct 2 ms 2652 KB Output is correct
10 Correct 6 ms 3128 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 3 ms 2904 KB Output is correct
7 Correct 6 ms 3164 KB Output is correct
8 Correct 6 ms 3164 KB Output is correct
9 Correct 2 ms 2648 KB Output is correct
10 Correct 6 ms 3164 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2660 KB Output is correct
13 Correct 3 ms 2876 KB Output is correct
14 Correct 1 ms 2404 KB Output is correct
15 Correct 7 ms 3172 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 2 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 21 ms 6908 KB Output is correct
12 Correct 23 ms 7504 KB Output is correct
13 Correct 19 ms 4948 KB Output is correct
14 Correct 20 ms 7004 KB Output is correct
15 Correct 20 ms 4956 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.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 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #9
0 / 15.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 444 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 600 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 444 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 28 ms 4440 KB Output is correct
10 Correct 23 ms 3672 KB Output is correct
11 Correct 8 ms 1636 KB Output is correct
12 Correct 10 ms 1852 KB Output is correct
13 Incorrect 2 ms 612 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 356 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Correct 0 ms 356 KB Output is correct
4 Correct 0 ms 356 KB Output is correct
5 Correct 0 ms 356 KB Output is correct
6 Correct 0 ms 356 KB Output is correct
7 Correct 0 ms 356 KB Output is correct
8 Correct 0 ms 608 KB Output is correct
9 Correct 29 ms 4416 KB Output is correct
10 Correct 23 ms 3900 KB Output is correct
11 Correct 8 ms 1740 KB Output is correct
12 Correct 10 ms 2000 KB Output is correct
13 Incorrect 2 ms 760 KB Output isn't correct
14 Halted 0 ms 0 KB -