제출 #878374

#제출 시각아이디문제언어결과실행 시간메모리
878374JakobZorz곤돌라 (IOI14_gondola)C++14
20 / 100
11 ms4700 KiB
#include"gondola.h" #include<iostream> #include<unordered_set> using namespace std; int valid(int n,int inputSeq[]){ unordered_set<int>s(inputSeq,inputSeq+n); if(s.size()!=n) return 0; int curr=-1; for(int i=0;i<2*n;i++){ if(curr==-1&&inputSeq[i%n]<=n) curr=inputSeq[i%n]; if(inputSeq[i%n]<=n&&curr!=inputSeq[i%n]) return 0; curr++; if(curr==n+1) curr=1; } return 1; } //---------------------- int replacement(int n,int gondolaSeq[],int replacementSeq[]){ return -2; } //---------------------- int countReplacement(int n,int inputSeq[]){ return -3; }

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

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:8:16: warning: comparison of integer expressions of different signedness: 'std::unordered_set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
    8 |     if(s.size()!=n)
      |        ~~~~~~~~^~~
#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...