제출 #530271

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
530271		gg123_pe	곤돌라 (IOI14_gondola)	C++14	90 / 100	43 ms	5996 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"
using namespace std; 

typedef long long ll; 
#define f(i,a,b) for(int i = a; i < b; i++)
const int N = 250005; 
const ll mod = 1e9 + 9; 

int cant[N], m[N]; 
bool on[N];

int valid(int n, int X[]){
    int mini = X[0]; 
    f(i,0,n) mini = min(mini, X[i]);

    if(mini > n){
        set <int> s; 
        f(i,0,n) s.insert(X[i]); 
        if(s.size() == n) return 1; 
        return 0; 
    }
    int id; 
    f(i,0,n) if(X[i] <= n) id = i; 
    vector <int> a, v1, v2;

    int pr = X[id]-1;
    f(i,0,n-id){
        pr++; 
        if(pr == n+1) pr = 1;
        v2.push_back(pr);
    }
    f(i,0,id){
        pr++; 
        if(pr == n+1) pr = 1;
        v1.push_back(pr); 
    }
    for(int x: v1) a.push_back(x);
    for(int x: v2) a.push_back(x);
    int ans = 1; 
    f(i,0,n) if(X[i] <= n and a[i] != X[i]) ans = 0;
    return ans; 
}

int replacement(int n, int X[], int res[]){
    int id = -1; 
    f(i,0,n) if(X[i] <= n) id = i;
    vector <int> a, v1, v2;

    if(id != -1){ 
        int pr = X[id]-1;
        f(i,0,n-id){
            pr++; 
            if(pr == n+1) pr = 1;
            v2.push_back(pr);
        }
        f(i,0,id){
            pr++; 
            if(pr == n+1) pr = 1;
            v1.push_back(pr); 
        }
        for(int x: v1) a.push_back(x);
        for(int x: v2) a.push_back(x);
    }
    else f(i,0,n) a.push_back(i+1);

    int maxi = 0; 
    f(i,0,n) {
        if(X[i] > n) m[X[i]] = a[i], on[X[i]] = 1;
        maxi = max(maxi, X[i]);
    }
    vector <int> ans; 
    id = n+1;
    while(id <= maxi){
        int l = id;
        while(!on[id]) id++;
        ans.push_back(m[id]);
        f(i,l,id) ans.push_back(i);
        id++;  
    }
    int l = ans.size();
    f(i,0,l) res[i] = ans[i]; 
    return l;
}
ll bp(ll x, ll y){
    if(y == 0) return 1; 
    ll ans = bp(x, y/2); ans = (ans*ans)%mod; 
    if(y%2 == 0) return ans; 
    return (ans*x)%mod; 
}
int countReplacement(int n, int X[]){
    if(!valid(n, X)) return 0;
    ll ans = 1;
    vector <ll> v = {n};  
    f(i,0,n) if(X[i] > n) v.push_back(X[i]); 

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

    ll l = v.size(); 
    for(ll i = 1; i < l; i++) ans = (ans*bp(l-i, v[i]-v[i-1]-1LL))%mod;
    if(v.size() > n) {
        ll wi = n; 
        ans = (ans*wi)%mod; 
    }
    return ans;
}

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

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:20:21: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   20 |         if(s.size() == n) return 1;
      |            ~~~~~~~~~^~~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:101:17: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  101 |     if(v.size() > n) {
      |        ~~~~~~~~~^~~
gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:27:16: warning: 'id' may be used uninitialized in this function [-Wmaybe-uninitialized]
   27 |     int pr = X[id]-1;
      |                ^~

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 0 / 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