Submission #1350832

#	Time	Username	Problem	Language	Result	Execution time	Memory
1350832		ElayV13	Gondola (IOI14_gondola)	C++20	100 / 100	30 ms	7112 KiB

gondola

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

#define ll long long
const ll mod=1e9+9;

ll pw(ll a,ll b){
      ll res=1;
      while(b>0){
            if(b&1){
                  res=(res*a)%mod;
                  b--;
            }
            a=(a*a)%mod;
            b/=2;
      }
      return res;
}

int valid(int n,int inputSeq[])
{
      vector<int>all;
      for(int i=0;i<n;i++) all.push_back(inputSeq[i]);
      for(int i=0;i<n;i++) all.push_back(inputSeq[i]);
      int mn=*min_element(all.begin(),all.end());
      int one=-1;
      for(int i=0;i<all.size();i++){
            if(all[i]==mn){
                  one=i;
                  break;
            }
      }
      int cur=one,val=1;
      for(int i=1;i<=n;i++){
            if(all[cur]!=val) return 0;
            ++cur;
            ++val;
      }
      return 1;
}

int replacement(int n,int gondolaSeq[],int replacementSeq[])
{
      vector<int>all;
      for(int i=0;i<n;i++) all.push_back(gondolaSeq[i]);
      int mn=*min_element(all.begin(),all.end());
      vector<int>vec;
      if(mn>n){
            for(int i=1;i<=n;i++) vec.push_back(i);
      }
      else{
            vec.assign(n,-1);
            for(int i=0;i<n;i++){
                  if(gondolaSeq[i]<=n){
                        int cur=gondolaSeq[i];
                        vec[i]=cur;
                        for(int j=i+1;j<n;j++){
                              cur++;
                              if(cur==n+1) cur=1;
                              vec[j]=cur;
                        }
                        cur=gondolaSeq[i];
                        for(int j=i-1;j>=0;j--){
                              cur--;
                              if(cur==0) cur=n;
                              vec[j]=cur;
                        }
                        break;
                  }
            }
      }
      vector<pair<int,int>>srt;
      for(int i=0;i<n;i++){
            if(vec[i]!=gondolaSeq[i]) srt.push_back({gondolaSeq[i],i});
      }
      sort(srt.begin(),srt.end());
      int cur=n+1;
      int po=0;
      for(int i=0;i<srt.size();i++){
            int id=srt[i].second;
            int val=srt[i].first;
            for(int j=cur;j<=val;j++){
                  replacementSeq[po++]=vec[id];
                  vec[id]=cur++;
            }
      }
      return po;
}

int countReplacement(int n,int inputSeq[])
{
      vector<int>all;
      set<int>st;
      for(int i=0;i<n;i++) all.push_back(inputSeq[i]),st.insert(inputSeq[i]);
      if(st.size()!=n) return 0;
      int mn=*min_element(all.begin(),all.end());
      vector<int>vec;
      if(mn>n){
            for(int i=1;i<=n;i++) vec.push_back(i);
      }
      else{
            vec.assign(n,-1);
            for(int i=0;i<n;i++){
                  if(inputSeq[i]<=n){
                        int cur=inputSeq[i];
                        vec[i]=cur;
                        for(int j=i+1;j<n;j++){
                              cur++;
                              if(cur==n+1) cur=1;
                              vec[j]=cur;
                        }
                        cur=inputSeq[i];
                        for(int j=i-1;j>=0;j--){
                              cur--;
                              if(cur==0) cur=n;
                              vec[j]=cur;
                        }
                        break;
                  }
            }
      }
      vector<pair<int,int>>srt;
      for(int i=0;i<n;i++){
            if(vec[i]!=inputSeq[i]) srt.push_back({inputSeq[i],i});
      }
      sort(srt.begin(),srt.end());
      ll rem=srt.size();
      int cur=n+1;
      ll res=1;
      for(int i=0;i<srt.size();i++){
            int id=srt[i].second;
            int val=srt[i].first;
            int cnt=val-cur+1;
            res=(res%mod*pw(rem,cnt-1)%mod)%mod;
            cur+=cnt;
            --rem;
      }
      if(mn>n){
            res=(res*n)%mod;
      }
      return res;
}

• 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