# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
68808 | 2018-08-18T14:24:29 Z | Vahan | Gondola (IOI14_gondola) | C++17 | 0 ms | 0 KB |
#include "gondola.h" #include<vector> #include<algorithm> using namespace std; int x[200000],xx[200000]; int mod=1000000007; vector<int> g; int valid(int n, int inputSeq[]) { vector<int> v; for(int i=0;i<n;i++) xx[i]=inputSeq[i]; sort(xx,xx+n); int t=0; for(int i=1;i<n;i++) if(xx[i]==xx[i-1]) { t=1; break; } if(t==1) return 0; for(int i=0;i<n;i++) { if(inputSeq[i]<=n) { v.push_back(inputSeq[i]); x[inputSeq[i]]=i; } } t=0; for(int i=1;i<v.size();i++) { if(v[i-1]>v[i]) t++; } if(t>=2) return 0; if(t==1 && v.back()>v[0]) return 0; t=0; for(int i=1;i<v.size();i++) { if(v[i-1]<v[i]) { if(v[i]-v[i-1]!=x[v[i]]-x[v[i-1]]) { t=1; break; } } else if(v[i-1]>v[i]) { if((n-(v[i-1]-v[i]))!=x[v[i]]-x[v[i-1]]) { t=1; break; } } } if(t==1) return 0; return 1; } int binpow(int a,int b) { if(b==0) return 1; if(b%2==0) { int c=binpow(a,b/2); return (c*c)%mod; } else { int c=binpow(a,b/2); return (b*(c*c)%mod)%mod; } } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return -2; } //---------------------- int countReplacement(int n, int inputSeq[]) { if(valid(n,inputSeq)==0) return 0; for(int i=0;i<n;i++) { if(inputSeq[i]>n) g.push_back(inputSeq[i]); } sort(g.begin(),g.end()); if(g.size()==0) return 1; int k=g.size(); int pat=0; for(int i=0;i<g.size();i++) { int u; if(i==0) u=g[i]-n-1; else u=g[i]-g[i-1]-1; pat+=pow(k,u); k--; } return pat; }