oj.uz

Submission #1064977

# Submission time Handle Problem Language Result Execution time Memory
1064977 2024-08-18T20:42:14 Z kkzyr Gondola (IOI14_gondola) C++17
50 / 100
 11 ms 2908 KB 
#include <iostream>
#include <algorithm>
#include <gondola.h>
using namespace std;

int valid(int n, int inputSeq[]);
int replacement(int n, int gondolaSeq[], int replacementSeq[]);
int countReplacement(int n, int inputSeq[]);

const int mod = 1e9 + 7;

//int input[100000];

bool has[100001];

int original[100001];
int index[250001];

//int use_for_replacement[100000];

long long binary_exponentiation(int a, int b){
    if (b == 0){
        return 1;
    }
    long long cache = binary_exponentiation(a, b/2);
    long long ans = cache * cache;
    ans %= mod;
    if (b % 2 == 1){
        ans *= a;
        ans %= mod;
    }
    return ans;
}

int valid(int n, int inputSeq[]){
    for (int i = 0;i < n;i++){
        if (i <= n){
            if (has[i]){
                return 0;
            }
            has[i] = true;
        }
    }
    int first_original = -1;
    for (int i = 0;i < n;i++){
        if (inputSeq[i] <= n){
            first_original = i;
            break;
        }
    }
    if (first_original == -1){
        return 1;
    }
    for (int i = 0;i < n;i++){
        if (inputSeq[i] <= n){
            int diff1 = i - first_original;
            int diff2 = inputSeq[i] - inputSeq[first_original];
            if (diff2 < 0){
                diff2 += n;
            }
            if (diff1 != diff2){
                return 0;
            }
        }
    }
    return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
    int has_index = -1;
    int max_num = -1;
    for (int i = 0;i < n;i++){
        if (gondolaSeq[i] <= n){
            has_index = i;
        }
        max_num = max(max_num, gondolaSeq[i]);
        index[gondolaSeq[i]] = i;
    }
    if (has_index == -1){
        for (int i = 0;i < n;i++){
            original[i] = i + 1;
        }
    }
    else{
        int first = gondolaSeq[has_index] - has_index;
        if (first < 0){
            first += n;
        }
        for (int i = 0;i < n;i++){
            original[i] = (first + i) % n;
            if (original[i] == 0){
                original[i] = n;
            }
        }
    }
    int length = 0;
    for (int i = n + 1;i <= max_num;i++){
        if (index[i] != 0 or gondolaSeq[0] == i){
            replacementSeq[length] = original[index[i]];
            length++;
            original[index[i]] = i;
        }
        else{
            replacementSeq[length] = original[index[max_num]];
            length++;
            original[index[max_num]] = i;
        }
    }
    return length;
}

int countReplacement(int n, int inputSeq[]){
    if (valid(n, inputSeq) == 0){
        return 0;
    }
    sort(inputSeq, inputSeq + n);
    long long ans = 1;
    if (inputSeq[0] > n){
        ans = n;
    }
    for (int i = 0;i < n - 1;i++){
        if (inputSeq[i + 1] > n){
            ans *= binary_exponentiation(n - 1 - i, inputSeq[i + 1] - max(inputSeq[i], n) - 1);
            ans %= mod;
        }
    }
    return ans;
}
/*
int main(){
    int t, n;
    cin >> t >> n;
    for (int i = 0;i < n;i++){
        cin >> input[i];
    }
    if (t <= 3){
        cout << valid(n, input) << '\n';
    }
    else if (t <= 6){
        int length = replacement(n, index, use_for_replacement);
        cout << length << '\n';
        for (int i = 0;i < length;i++){
            cout << use_for_replacement[i] << ' ';
        }
        cout << '\n';
    }
    else{
        cout << countReplacement(n, input);
    }
    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 1 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 444 KB Output is correct
2 Correct 1 ms 344 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 2 ms 604 KB Output is correct
7 Correct 6 ms 1372 KB Output is correct
8 Correct 5 ms 984 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 5 ms 1116 KB Output is correct

Subtask #3
0 / 10.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 344 KB Output is correct
6 Correct 3 ms 676 KB Output is correct
7 Correct 10 ms 1372 KB Output is correct
8 Correct 5 ms 968 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 5 ms 1184 KB Output is correct
11 Incorrect 0 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
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

Subtask #5
10.0 / 10.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 444 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 6 ms 1628 KB Output is correct
12 Correct 6 ms 1884 KB Output is correct
13 Correct 8 ms 1884 KB Output is correct
14 Correct 6 ms 1624 KB Output is correct
15 Correct 11 ms 2908 KB Output is correct

Subtask #7
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

Subtask #8
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 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 348 KB Output is correct
7 Incorrect 0 ms 440 KB Output isn't correct
8 Halted 0 ms 0 KB -

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 344 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 604 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #10
0 / 10.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 0 ms 344 KB Output is correct
7 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -