제출 #285505

#제출 시각아이디문제언어결과실행 시간메모리
285505erd1곤돌라 (IOI14_gondola)C++14
20 / 100
42 ms4728 KiB
#include "gondola.h" #include<bits/stdc++.h> using namespace std; int valid(int n, int inputSeq[]) { set<int> uses, xs; for(int i = 0; i < n; i++)xs.insert(inputSeq[i]); if(xs.size() != n)return 0; if(*xs.begin() > n)return 1; rotate(inputSeq, find(inputSeq, inputSeq+n, *xs.begin()), inputSeq+n); assert(*xs.begin() == inputSeq[0]); if(*xs.begin() != 1) rotate(inputSeq, inputSeq+(n-*xs.begin()+1), inputSeq+n); for(int i = 0; i < n; i++) if(inputSeq[i] == i+1) continue; else if(inputSeq[i] <= n)return 0; else if(uses.count(inputSeq[i])) return 0; else uses.insert(inputSeq[i]); 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::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
    8 |   if(xs.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...