oj.uz

답안 #261274

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
261274 2020-08-11T15:45:02 Z A02 곤돌라 (IOI14_gondola) C++14
75 / 100
 30 ms 3084 KB 
#include "gondola.h"
#include <algorithm>
#include <set>
#include <iostream>
#include <vector>
#include <utility>

using namespace std;

int valid(int n, int inputSeq[])
{

    vector<int> occurences (250001, 0);
    vector<int> index (n, -1);


    for (int i = 0; i < n; i++){
        occurences[inputSeq[i]]++;
        if (inputSeq[i] <= n){
            //cout << i << ' ' << reduced_sequence[i] << endl;
            index[inputSeq[i] - 1] = i;
        }
    }

    for (int i = 0; i < occurences.size(); i++){
        if (occurences[i] > 1){
            return 0;
        }
    }

    int lowest_g;
    for (int i = 0; i < n; i++){
        if (index[i] != -1){
            lowest_g = i;
            break;
        }
    }

    for (int i = lowest_g; i < n; i++){
        if (index[i] != -1){
            //cout << i << ' ' << index[i] << endl;
            if ((index[lowest_g] + i - lowest_g) % n != index[i]){
                return 0;
            }
        }
    }

    return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{

    int first_original = 0;
    int first_value = 1;
    for (int i = 0; i < n; i++){
        if (gondolaSeq[i] <= n){
            first_original = i;
            first_value = gondolaSeq[i];
        }
    }

    vector<pair<int, int> > to_replace;

    for (int i = 0; i < n; i++){
        int current_pos = (i + first_original) % n;
        int current_original_value = (i + first_value);
        if (current_original_value > n){
            current_original_value -= n;
        }

        int target_value = gondolaSeq[current_pos];
        //cout << first_value << ' ' << i << ' ' << gondolaSeq[i] << endl;
        if (target_value != current_original_value){
            to_replace.push_back(make_pair(target_value, current_original_value));
        }
    }

    sort(to_replace.begin(), to_replace.end());

    int current_unused = n + 1;
    int current_replacement = 0;
    //cout << to_replace.size() << endl;
    for (int i = 0; i < to_replace.size(); i++){
        int c_value = to_replace[i].second;

        while (c_value != to_replace[i].first){
            replacementSeq[current_replacement] = c_value;
            c_value = current_unused;
            current_replacement++;
            current_unused++;
        }
    }

    return current_replacement;
}

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

long long fast_pow(long long a, long long k, long long p){

    if (a == 0){
        return 0;
    }

    if (k == 0){
        return 1;
    }

    if (k % 2 == 1){
        long long b = fast_pow(a, k / 2, p);
        return (b * b * a) % p;
    }

    long long b = fast_pow(a, k / 2, p);
    return (b * b) % p;
}

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

    long long p = 1000000009;

    if (valid(n, inputSeq) == 0){
        cout << 'a' << endl;
        return 0;
    }

    long long first_original = 0;
    long long first_value = 1;
    for (int i = 0; i < n; i++){
        if (inputSeq[i] <= n){
            first_original = i;
            first_value = inputSeq[i];
        }
    }

    vector<pair<long long, long long> > to_replace;

    to_replace.push_back(make_pair(n, 0));

    for (long long i = 0; i < n; i++){
        long long current_pos = (i + first_original) % n;
        long long current_original_value = (i + first_value);
        if (current_original_value > n){
            current_original_value -= n;
        }

        long long target_value = inputSeq[current_pos];
        //cout << first_value << ' ' << i << ' ' << gondolaSeq[i] << endl;
        if (target_value != current_original_value){
            to_replace.push_back(make_pair(target_value, current_original_value));
        }
    }

    sort(to_replace.begin(), to_replace.end());

    long long total = 1;

    long long current_options = to_replace.size() - 1;

    for (int i = 0; i < to_replace.size() - 1; i++){
        //cout << current_options << ' ' << to_replace[i + 1].first << ' ' << to_replace[i].first << endl;
        total = (total * fast_pow(current_options, to_replace[i + 1].first - to_replace[i].first - 1, p)) % p;

        current_options--;
    }

    return total;
}

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:25:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < occurences.size(); i++){
                     ~~^~~~~~~~~~~~~~~~~~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:86:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < to_replace.size(); i++){
                     ~~^~~~~~~~~~~~~~~~~~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:164:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < to_replace.size() - 1; i++){
                     ~~^~~~~~~~~~~~~~~~~~~~~~~
gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:31:9: warning: 'lowest_g' may be used uninitialized in this function [-Wmaybe-uninitialized]
     int lowest_g;
         ^~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1280 KB Output is correct
2 Correct 2 ms 1280 KB Output is correct
3 Correct 2 ms 1280 KB Output is correct
4 Correct 1 ms 1280 KB Output is correct
5 Correct 1 ms 1280 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1280 KB Output is correct
2 Correct 1 ms 1280 KB Output is correct
3 Correct 2 ms 1280 KB Output is correct
4 Correct 1 ms 1280 KB Output is correct
5 Correct 1 ms 1280 KB Output is correct
6 Correct 10 ms 1792 KB Output is correct
7 Correct 15 ms 2432 KB Output is correct
8 Correct 12 ms 2304 KB Output is correct
9 Correct 5 ms 1664 KB Output is correct
10 Correct 14 ms 2432 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1280 KB Output is correct
2 Correct 1 ms 1280 KB Output is correct
3 Correct 2 ms 1280 KB Output is correct
4 Correct 1 ms 1280 KB Output is correct
5 Correct 1 ms 1280 KB Output is correct
6 Correct 7 ms 1792 KB Output is correct
7 Correct 15 ms 2432 KB Output is correct
8 Correct 15 ms 2304 KB Output is correct
9 Correct 5 ms 1664 KB Output is correct
10 Correct 14 ms 2432 KB Output is correct
11 Correct 1 ms 1280 KB Output is correct
12 Correct 2 ms 1280 KB Output is correct
13 Correct 7 ms 1792 KB Output is correct
14 Correct 1 ms 1280 KB Output is correct
15 Correct 22 ms 2432 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 12 ms 1024 KB Output is correct
12 Correct 14 ms 1152 KB Output is correct
13 Correct 18 ms 1544 KB Output is correct
14 Correct 12 ms 1024 KB Output is correct
15 Correct 26 ms 2424 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1280 KB Output is correct
2 Correct 2 ms 1280 KB Output is correct
3 Correct 3 ms 1280 KB Output is correct

Subtask #8
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1280 KB Output is correct
2 Correct 2 ms 1280 KB Output is correct
3 Correct 1 ms 1280 KB Output is correct
4 Correct 2 ms 1280 KB Output is correct
5 Correct 2 ms 1280 KB Output is correct
6 Correct 2 ms 1280 KB Output is correct
7 Correct 1 ms 1280 KB Output is correct
8 Correct 2 ms 1280 KB Output is correct

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1280 KB Output is correct
2 Correct 1 ms 1280 KB Output is correct
3 Correct 2 ms 1280 KB Output is correct
4 Correct 2 ms 1308 KB Output is correct
5 Correct 2 ms 1408 KB Output is correct
6 Correct 1 ms 1280 KB Output is correct
7 Correct 2 ms 1280 KB Output is correct
8 Correct 2 ms 1280 KB Output is correct
9 Incorrect 30 ms 3084 KB Integer -667809712 violates the range [0, 1000000008]
10 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1280 KB Output is correct
2 Correct 1 ms 1280 KB Output is correct
3 Correct 2 ms 1280 KB Output is correct
4 Correct 2 ms 1280 KB Output is correct
5 Correct 2 ms 1280 KB Output is correct
6 Correct 2 ms 1280 KB Output is correct
7 Correct 2 ms 1280 KB Output is correct
8 Correct 1 ms 1280 KB Output is correct
9 Incorrect 22 ms 3084 KB Integer -667809712 violates the range [0, 1000000008]
10 Halted 0 ms 0 KB -