제출 #902852

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
902852		Sir_Ahmed_Imran	곤돌라 (IOI14_gondola)	C++17	100 / 100	45 ms	7204 KiB

gondola

                              ///~~~LOTA~~~///
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
#define ff first
#define ss second
#define ll long long 
#define append push_back
#define pii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define MAXN 100001
ll mod=1e9+9;
map<int,int> vis;
ll pwr(ll n,ll m){
    if(!m) return 1;
    ll o=pwr(n,m/2);
    o=(o*o)%mod;
    if(m%2) o=(o*n)%mod;
    return o;
}
int valid(int n, int a[]){
    for(int i=0;i<n;i++){
        if(vis[a[i]]) return 0;
        vis[a[i]]=1;
    }
    for(int i=0;i<n;i++){
        if(a[i]>n) continue;
        for(int j=i+1;j<i+n;j++){
            if(a[j%n]>n) continue;
            if(a[j%n]!=1+((a[i]+j-i-1)%n)) return 0;
        }
        return 1;
    }
    return 1;
}
int replacement(int n,int a[],int v[]){
    int m,o;
    set<pii> s;
    for(int i=m=o=0;i<n;i++){
        m=max(m,a[i]);
        if(a[i]>n) continue;
        for(int j=i+1;j<i+n;j++){
            m=max(m,a[j%n]);
            if(a[j%n]>n)
                s.insert({a[j%n],1+((a[i]+j-i-1)%n)});
        }
        o=1;
        break; 
    }
    pii pi;
    if(!o)
        for(int i=0;i<n;i++)
            s.insert({a[i],i+1});
    o=0;
    for(int i=n+1;i<=m;i++){
        pi=*s.begin();
        s.erase(s.begin());
        v[o]=pi.ss;
        pi.ss=i;
        o++;
        if(pi.ss!=pi.ff) 
            s.insert(pi);
    }
    return o;
}
int countReplacement(int n,int a[]){
    if(!valid(n,a)) return 0;
    vector<ll> v;
    for(int i=0;i<n;i++)
        if(a[i]>n) 
            v.append(a[i]); 
    ll o,m;
    m=v.size();
    o=1,
    v.append(n);
    sort(all(v));
    if(v.size()==n+1) o=n;
    for(int i=1;i<v.size();i++){
        o=(o*pwr(m,v[i]-v[i-1]-1))%mod;
        m--;
    }
    return o;
}

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

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:78:16: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   78 |     if(v.size()==n+1) o=n;
      |        ~~~~~~~~^~~~~
gondola.cpp:79:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |     for(int i=1;i<v.size();i++){
      |                 ~^~~~~~~~~

• 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