제출 #568632

#제출 시각아이디문제언어결과실행 시간메모리
568632n0sk1ll곤돌라 (IOI14_gondola)C++14
20 / 100
35 ms5172 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; long long int typedef li; int valid(int n, int inputSeq[]) { set<int> gondola; for (int i=0;i<n;i++) gondola.insert(inputSeq[i]); if (gondola.size()!=n) return 0; for (int i=0;i<n-1;i++) if ((inputSeq[i+1]-1-inputSeq[i])%n!=0) return 0; if ((inputSeq[0]-1-inputSeq[n-1])%n!=0) return 0; 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:12:23: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   12 |     if (gondola.size()!=n) return 0;
      |         ~~~~~~~~~~~~~~^~~
#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...