제출 #818192

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
818192		andecaandeci	곤돌라 (IOI14_gondola)	C++17	60 / 100	28 ms	4880 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
#define ll long long
#define ld long double
#define ull unsigned long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second

const int N = 3e5 + 5;
const int mod = 1e9 + 7;

// int gondolaSequence[100001];
// int replacementSequence[250001];
int ans[N];
set<int> s;

ll binpow(ll x, ll y) {
    if (y == 0) return 1;
    ll res = binpow(x, y / 2);
    res = (res * res) % mod;
    if (y % 2) res = (res * x) % mod;
    return res;
}

int valid(int n, int inputSeq[]) {
    int id1 = 0, id2 = 0;
    for (int i = 0; i < n; i++) {
        if (s.count(inputSeq[i])) return 0;
        s.insert(inputSeq[i]);
    }
    for (int i = 0; i < n; i++) {
        if (inputSeq[i] <= n) {
            id1 = inputSeq[i];
            id2 = i;
            break;
        }
    }
    if (id1 == 0) return 1;
    id2 -= id1 - 1;
    if (id2 < 0) id2 += n;
    for (int i = id2; i < id2 + n; i++) {
        if (inputSeq[i % n] > n) continue;
        if (i - id2 != inputSeq[i % n] - 1) return 0;
    }
    return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
    int id1 = 1, id2 = 0;
    for (int i = 0; i < n; i++) {
        if (gondolaSeq[i] <= n) {
            id1 = gondolaSeq[i];
            id2 = i;
            break;
        }
    }
    id2 -= id1 - 1;
    if (id2 < 0) id2 += n;
    int len = 0, id3 = -1, mx = 0;
    for (int i = 0; i < n; i++) {
        if (gondolaSeq[i] <= n) continue;
        mx = max(mx, gondolaSeq[i]);
        if (gondolaSeq[i] == mx) id3 = i;
        ans[gondolaSeq[i]] = ((i + n - id2) % n) + 1;
    }
    if (id3 == -1) return 0;
    ans[gondolaSeq[id3]] = 0;
    id3 = ((id3 + n - id2) % n) + 1;
    int ans2 = id3, target = n + 1;
    while (target <= mx) {
        if (ans[target] == 0) {
            replacementSeq[len] = ans2;
            ans2 = target; 
        } 
        else replacementSeq[len] = ans[target];
        len++, target++;
    }
    return len;
}

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

int countReplacement(int n, int inputSeq[]) {
    if (!valid(n, inputSeq)) return 0;
    vector<int> v;
    for (int i = 0; i < n; i++) if (inputSeq[i] > n) v.push_back(inputSeq[i]);
    sort(v.begin(), v.end());
    ll answ = 1, cnt = (int)v.size(), tmp = n + 1;
    if (cnt == n) {
        for (ll i = 2; i <= n; i++) answ = (answ * i) % mod;
    }   
    for (auto x : v) {
        answ *= binpow(cnt, x - tmp);
        answ %= mod;
        cnt--;
    }
    return answ;
}


// int main()
// {
//   int i, n, tag;
//   int nr; 
//   assert(scanf("%d", &tag)==1);
//   assert(scanf("%d", &n)==1);
//   for(i=0;i< n;i++)
//     assert( scanf("%d", &gondolaSequence[i]) ==1);
  
//   switch (tag){
//   case 1: case 2: case 3:
//     printf("%d\n", valid(n, gondolaSequence));
//     break;

//   case 4: case 5: case 6:
//     nr = replacement(n, gondolaSequence, replacementSequence);
//     printf("%d ", nr);
//     if (nr > 0)
//       {
//     for (i=0; i<nr-1; i++)
//       printf("%d ", replacementSequence[i]);
//     printf("%d\n", replacementSequence[nr-1]);
//       }  
//     else printf("\n");
//     break;

//   case 7: case 8: case 9: case 10:
//     printf("%d\n",  countReplacement(n, gondolaSequence));  
//     break;
//   }

//   return 0;
// }

• 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: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10