제출 #576850

#제출 시각아이디문제언어결과실행 시간메모리
576850mosiashvililuka곤돌라 (IOI14_gondola)C++14
20 / 100
19 ms2900 KiB
#include "gondola.h" #include<bits/stdc++.h> using namespace std; long long a,b,c,d,e,i,j,ii,jj,zx,xc,f[300009],fx[300009],pi; int valid(int Nn, int inputSeq[]) { a=Nn; for(i=1; i<=a; i++) f[i]=inputSeq[i-1]; set <int> SAE; for(i=1; i<=a; i++){ if(f[i]<=a){ c=f[i]-i+a*2;c%=a; SAE.insert(c); } } if(SAE.size()>=2) return 0; for(i=1; i<=a; i++){ if(fx[f[i]]!=0) return 0; fx[f[i]]=1; } return 1; } //---------------------- int replacement(int Nn, int gondolaSeq[], int replacementSeq[]) { a=Nn; for(i=1; i<=a; i++){ f[i]=gondolaSeq[i-1]; } for(i=1; i<=a; i++){ //if() } } //---------------------- int countReplacement(int Nn, int inputSeq[]) { return -3; }

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

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