# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
53105 | 2018-06-28T11:58:41 Z | zetapi | 곤돌라 (IOI14_gondola) | C++14 | 0 ms | 0 KB |
#include "gondola.h" #include "bits/stdc++.h" using namespace std; #define ll long long const int MAX=1e6; const int mod=1e9; int arr[MAX],fre[MAX]; ll power(ll base,ll exp) { ll res=1; while(exp) { if(exp%2) res*=base; base*=base; res%=mod; base%=mod; exp/=2; } return res; } int valid(int n, int inputSeq[]) { int N=n,ok=1; for(int A=0;A<N;A++) { fre[inputSeq[A]]++; if(fre[inputSeq[A]]>1) return 0; } for(int A=0;A<N;A++) { if(inputSeq[A]<=N) { ok=0; inputSeq[A]--; for(int B=A;B>=0;B--) { arr[B]=inputSeq[A]; inputSeq[A]--; if(inputSeq[A]<0) inputSeq[A]+=N; } inputSeq[A]=arr[A]; for(int B=A+1;B<N;B++) { inputSeq[A]++; if(inputSeq[A]>=N) inputSeq[A]=0; arr[B]=inputSeq[A]; } inputSeq[A]=arr[A]+1; break; } } if(ok) return 1; for(int A=0;A<N;A++) arr[A]++; for(int A=0;A<N;A++) { if(inputSeq[A]<=N and arr[A]!=inputSeq[A]) return 0; } return 1; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return -2; } //---------------------- long long int countReplacement(int n, int inputSeq[]) { if(!valid(n,inputSeq)) return 0; sort(inputSeq,inputSeq+n); vector<ll> vec; for(int A=0;A<n;A++) if(inputSeq[A]>n) vec.push_back(inputSeq[A]); sort(vec.begin(),vec.end()); ll res=1,ptr=0,cnt=vec.size(); while(ptr<n and inputSeq[ptr]<=n) ++ptr; for(int A=0;A<vec.size()-1;A++) { while(ptr<n and inputSeq[ptr]<=vec[A]) ++ptr,--cnt; //cout<<ptr<<"\n"; if(vec[A+1]-vec[A]>1) { res*=power(cnt,vec[A+1]-vec[A]-1); res%=mod; } } if(vec[0]!=n+1) { res*=vec.size(); res%=mod; } if(inputSeq[0]>n) { res*=n; res%=mod; } return res; } /*signed main() { ios_base::sync_with_stdio(false); int arr[]={3,4}; cout<<countReplacement(2,arr); return 0; }*/