Submission #900264

#TimeUsernameProblemLanguageResultExecution timeMemory
900264Darren0724Gondola (IOI14_gondola)C++17
20 / 100
7 ms2396 KiB
#include "gondola.h" #include<bits/stdc++.h> //#include "grader.cpp" using namespace std; const int INF=1e9; const int mod=1e9+9; int valid(int n, int v[]){ int mn=INF,idx=-1; vector<int> a(300000); for(int i=0;i<n;i++){ a[v[i]]++; if(a[v[i]]>1){ return 0; } 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:39:1: warning: no return statement in function returning non-void [-Wreturn-type]
   39 | }
      | ^
#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...