제출 #28910

#제출 시각아이디문제언어결과실행 시간메모리
28910top34051곤돌라 (IOI14_gondola)C++14
20 / 100
16 ms4364 KiB
#include "gondola.h" #include<bits/stdc++.h> using namespace std; int cnt[250005]; int valid(int n, int p[]) { int i,x; x = 0; for(i=0;i<n;i++) if(p[x]>p[i]) x = i; for(i=0;i<n;i++) { cnt[p[i]]++; if(cnt[p[i]]>1) return 0; } for(i=0;i<n;i++) if(p[(x+i)%n] <= n && p[(x+i)%n] != p[x]+i) return 0; return 1; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { } //---------------------- int countReplacement(int n, int inputSeq[]) { }

컴파일 시 표준 에러 (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]
 }
 ^
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:27:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
#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...