Submission #537057

#TimeUsernameProblemLanguageResultExecution timeMemory
537057timreizinGondola (IOI14_gondola)C++17
20 / 100
37 ms4952 KiB
#include "gondola.h" #include <vector> #include <algorithm> #include <set> using namespace std; int valid(int n, int inputSeq[]) { vector<int> a(n); int ind = min_element(inputSeq, inputSeq + n) - inputSeq; for (int i = 0; i < n; ++i) a[(i - ind + n) % n] = inputSeq[i] - 1; if (set<int>(a.begin(), a.end()).size() != n) return 0; for (int i = 0; i < n; ++i) if (a[i] < n && a[i] != i) return 0; return 1; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return -2; } //---------------------- int countReplacement(int n, int inputSeq[]) { return -3; }

Compilation message (stderr)

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:13:45: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   13 |     if (set<int>(a.begin(), a.end()).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...