Submission #16432

#TimeUsernameProblemLanguageResultExecution timeMemory
16432atomzenoFriend (IOI14_friend)C++98
Compilation error
0 ms0 KiB
#include "gondola.h" #include<algorithm> using namespace std; #define MX 250001 int d[MX],check[MX]; int l,ind; int valid(int n, int inputSeq[]){ int i,cnt=0,ind; for(i=0;i<=250000;i++){ check[i]=0; } for(i=0;i<n;i++){ if(inputSeq[i]<=n){ cnt=1; ind=(inputSeq[i]-1-i)+n; ind%=n; break; } } for(i=0;i<n;i++){ check[inputSeq[i]]++; if(check[inputSeq[i]]>=2){return 0;} } if(cnt==0){return 1;} for(i=0;i<n;i++){ d[(ind+i)%n]=inputSeq[i]; } for(i=0;i<n;i++){ if(d[i]<=n&&d[i]!=(i+1)){ return 0; } } return 1; } struct DT{ int x,y; bool operator<(const DT&r)const{ return r.x>x; } }make[MX]; int replacement(int n, int gondolaSeq[], int replacementSeq[]){ int ll=0,o=n,flag=0,indin,i,j; for(i=0;i<n;i++){ if(gondolaSeq[i]<=n){ flag=1; indin=gondolaSeq[i]; break; } } if(flag==0){indin=1;} for(j=i;j<i+n;j++){ make[j%n].x=gondolaSeq[j%n]; if(indin>n){indin-=n;} make[j%n].y=indin++; } sort(make,make+n); for(i=0;i<n;){ if(make[i].y>=make[i].x){ i++; continue; } replacementSeq[ll++]=make[i].y; make[i].y=++o; } return ll; } //---------------------- int countReplacement(int n, int inputSeq[]){ return -3; }

Compilation message (stderr)

friend.cpp:1:21: fatal error: gondola.h: 그런 파일이나 디렉터리가 없습니다
 #include "gondola.h"
                     ^
compilation terminated.