제출 #307740

#제출 시각아이디문제언어결과실행 시간메모리
307740juggernautGondola (IOI14_gondola)C++14
20 / 100
20 ms640 KiB
#include"gondola.h" #include<bits/stdc++.h> //#include"grader.cpp" using namespace std; bool vis[250005]; int valid(int n,int a[]){ int i=0,need; while(i<n&&a[i]>n)i++; need=a[i]; while(i<n){ if(a[i]<=n&&a[i]!=need)return 0; if(need==n)need=1; else need++; i++; } sort(a,a+n); for(i=1;i<n;i++)if(a[i]==a[i-1])return 0; return 1; } int replacement(int n,int gondolaSeq[],int replacementSeq[]){ } int countReplacement(int n,int inputSeq[]){ return -3; }

컴파일 시 표준 에러 (stderr) 메시지

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:22:1: warning: no return statement in function returning non-void [-Wreturn-type]
   22 | }
      | ^
#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...