Submission #1350755

#	Time	Username	Problem	Language	Result	Execution time	Memory
1350755		ElayV13	Gondola (IOI14_gondola)	C++20	25 / 100	5 ms	1896 KiB

gondola

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

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[])
{
      int mx=-1;
      map<int,int>used;
      for(int i=0;i<n;i++) mx=max(mx,gondolaSeq[i]),used[gondolaSeq[i]]=1;
      int sz=0;
      for(int i=1;i<=mx;i++) if(!used[i]) replacementSeq[sz++]=i;
      return sz;
}

int countReplacement(int n,int inputSeq[])
{

}

Compilation message (stderr)

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:40:1: warning: no return statement in function returning non-void [-Wreturn-type]
   40 | }
      | ^

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10