제출 #229339

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
229339		osaaateiasavtnl	곤돌라 (IOI14_gondola)	C++14	100 / 100	69 ms	6008 KiB

gondola

#include<bits/stdc++.h>
using namespace std;
 
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
 
#include "gondola.h"
 
signed valid(signed n, signed a[])
{
    set <int> ms;
    for (int i = 0; i < n; ++i)
        ms.insert(a[i]);
    if (ms.size() < n)
        return 0;
 
    int pos = -1;
    for (int i = 0; i < n; ++i) {
        if (a[i] <= n) {
            pos = i;
            break;
        }
    }   
 
    if (pos == -1) 
        return 1;
    else {
        for (int sh = 0; sh < n; ++sh) {
            int i = (pos + sh) % n;
            int val = a[pos] + sh;
            if (val > n)
                val -= n;
            if (a[i] <= n && a[i] != val)
                return 0;
        }
        return 1;
    }   
 
}
 
//----------------------
 
signed replacement(signed n, signed a[], signed ans[])
{
 
    int pos = -1, S;
    for (int i = 0; i < n; ++i) {
        if (a[i] <= n) {
            pos = i;
            S = a[i];
            break;
        }
    }   

    if (pos == -1) {
        pos = 0;
        S = 1;
    }   

    vector <ii> ar;
    for (int sh = 0; sh < n; ++sh) {
        int i = (pos + sh) % n;
        int val = S + sh;
        if (val > n)
            val -= n;
        if (a[i] > n) {
            ar.app(mp(a[i], val));
        }   
    }
    sort(all(ar));
    int ptr = 0;
    int xp = n + 1;
    for (auto e : ar) {
        int cur = e.s;
        while (xp <= e.f) {
            //cout << cur << "->" << xp << endl;
            ans[ptr++] = cur;
            cur = xp++;
        }                           
    }   
    return ptr;
}
 
//----------------------

const ll MOD = 1000 * 1000 * 1000 + 9; 
ll mod(ll n) {
    n %= MOD;
    if (n < 0) return n + MOD;
    else return n;
}   
ll fp(ll a, ll p) {
    ll ans = 1, c = a;
    for (int i = 0; (1ll << i) <= p; ++i) {
        if ((p >> i) & 1) ans = mod(ans * c);
        c = mod(c * c);
    }   
    return ans;
}   
ll dv(ll a, ll b) { return mod(a * fp(b, MOD - 2)); }

signed countReplacement(signed n, signed a[])
{ 
    if (!valid(n, a))
        return 0;

    int pos = -1;
    for (int i = 0; i < n; ++i) {
        if (a[i] <= n) {
            pos = i;
            break;
        }
    }

    vector <int> ar = {n};
    for (int i = 0; i < n; ++i)
        if (a[i] > n)
            ar.app(a[i]);
    sort(all(ar));

    ll ans = 1;
    int r = 0;
    for (int i = (int)ar.size() - 2; i >= 0; --i) {
        ++r;
        int len = ar[i + 1] - ar[i] - 1;
        ans = mod(ans * fp(r, len));
    }   

    if (pos == -1)
        ans = mod(ans * n);

    return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:21:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if (ms.size() < n)
         ~~~~~~~~~~^~~

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