제출 #50469

#제출 시각아이디문제언어결과실행 시간메모리
50469mirbek01곤돌라 (IOI14_gondola)C++17
20 / 100
31 ms2284 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; int valid(int n, int inputSeq[]) { vector <pair <int, int> > v; for(int i = 0; i < n; i ++) if(inputSeq[i] <= n) v.push_back({inputSeq[i], i + 1}); sort(v.begin(), v.end()); for(int i = 1; i < v.size(); i ++){ int ab = v[i].first - v[i - 1].first, ds; if(v[i].second > v[i - 1].second){ ds = v[i].second - v[i - 1].second; } else { ds = v[i].second + (n - v[i - 1].second); } if(ds != ab) return 0; } sort(inputSeq, inputSeq + n); for(int i = 1; i < n; i ++){ if(inputSeq[i] == inputSeq[i - 1]) 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:11:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int i = 1; i < v.size(); i ++){
                      ~~^~~~~~~~~~
#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...