Submission #900263

#TimeUsernameProblemLanguageResultExecution timeMemory
900263Darren0724Gondola (IOI14_gondola)C++17
10 / 100
7 ms1116 KiB
#include "gondola.h" #include<bits/stdc++.h> using namespace std; const int INF=1e9; const int mod=1e9+9; int valid(int n, int v[]){ int mn=INF,idx=-1; for(int i=0;i<n;i++){ if(v[i]<mn){ idx=i; mn=v[i]; } } if(mn>n){ return 1; } for(int j=0;j<n;j++){ int i=(j+idx)%n; if(v[i]<=n){ if(v[i]!=mn+j){ return 0; } } } return 1; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { } //---------------------- int countReplacement(int n, int inputSeq[]) { return -3; }

Compilation message (stderr)

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:33:1: warning: no return statement in function returning non-void [-Wreturn-type]
   33 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...