Submission #110792

#	Time	Username	Problem	Language	Result	Execution time	Memory
110792		IVIosab	Gondola (IOI14_gondola)	C++17	20 / 100	15 ms	1280 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"

using namespace std;
int MOD = 1e9 + 7;

long long fast_power(long long base, long long power) {
    long long result = 1;
    while (power > 0) {
        if (power % 2 == 1) {
            result = (result * base) % MOD;
        }
        base = (base * base) % MOD;
        power = power / 2;
    }
    return result;
}

int valid(int n, int inputSeq[]) {
    bool first = false;
    int fx = 0;
    for (int i = 0; i < n; i++) {
        int x = inputSeq[i];
        if (x > n) {
            fx++;
            if (i) {
                if (inputSeq[i - 1] == n) {
                    inputSeq[i] = 1;
                } else {
                    inputSeq[i] = inputSeq[i - 1] + 1;
                }
            } else {
                first = true;
            }
        }
    }
    if (fx == n) {
        return 1;
    }
    if (first) {
        if (inputSeq[1] == 1) {
            inputSeq[0] = n;
        } else {
            inputSeq[0] = inputSeq[1] - 1;
        }
    }
    for (int i = 0; i < n; i++) {
        if (inputSeq[i] != 1) {
            if (i) {
                if (inputSeq[i] != inputSeq[i - 1] + 1) {
                    return 0;
                }
            } else {
                if (inputSeq[i] != inputSeq[n - 1] + 1) {
                    return 0;
                }
            }
        } else {
            if (i) {
                if (inputSeq[i - 1] != n) {
                    return 0;
                }
            } else {
                if (inputSeq[n - 1] != n) {
                    return 0;
                }
            }
        }
    }
    return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
    int ar[250005];
    memset(ar, 0, sizeof ar);
    int mx = 0;
    for (int i = 0; i < n; i++) {
        int x = gondolaSeq[i];
        mx = max(mx, x);
        ar[x] = 1;
    }
    int cnt = 0;
    for (int i = 1; i <= mx; i++) {
        if (ar[i] == 0) {
            replacementSeq[cnt] = i;
            cnt++;
        }
    }
    return cnt;
}

int countReplacement(int n, int inputSeq[]) {
    int mx = 0;
    long long ret = 1;
    vector<int> flex;
    flex.push_back(-1);
    int fx = 0;
    for (int i = 0; i < n; i++) {
        int x = inputSeq[i];
        mx = max(mx, x);
        if (x > n) {
            fx++;
            flex.push_back(x - n);
        }
    }
    int val = valid(n, inputSeq);
    if (val) {
        if (mx == n) {
            return 1;
        }
    } else {
        return 0;
    }
    if (fx == n) {
        return fx;
    }
    int mul = flex.size() -1 ;
    sort(flex.begin(), flex.end());
    for (int i = 1; i < flex.size(); i++) {
        int x = flex[i - 1] + 1;
        ret *= fast_power(mul, ((flex[i] - x) - 1));
        ret %= MOD;
    }
    return ret % MOD;
}

Compilation message (stderr)

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:119:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 1; i < flex.size(); i++) {
                     ~~^~~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 0 / 10
• Subtask 4: 5 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 5 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10