Submission #1305000

#	Time	Username	Problem	Language	Result	Execution time	Memory
1305000		mlecio	곤돌라 (IOI14_gondola)	C++20	0 / 100	1 ms	344 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
int valid(int n, int inputSeq[])
{
   set<int>a;
   long long mini=1e18;
   int indeks=-2137;
   for(int i=0;i<n;i++){
    int x=inputSeq[i];
    if(x<mini)
    {
        x=mini;
        indeks=i;
    }
    if(a.count(x)){
        return 0;
    }
    a.insert(x);
   }
   vector<int>b;
   for(int i=indeks;i<n;i++){
    b.push_back(inputSeq[i]);
   }
   for(int i=0;i<indeks;i++){
    b.push_back(inputSeq[i]);
   }
   int pop=0;
   for(int i=0;i<n-1;i++){
    if(b[i]>n)
        continue;
    if(pop>b[i])
        return 0;
        pop=b[i];
   }
   return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{

}

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

}

Compilation message (stderr)

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

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 10
• Subtask 4: 0 / 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