Submission #798620

#TimeUsernameProblemLanguageResultExecution timeMemory
798620LiudasGondola (IOI14_gondola)C++17
10 / 100
21 ms5632 KiB
#include <bits/stdc++.h> #include "gondola.h" using namespace std; int valid(int N, int seq[]){ vector<int> s(2 * N); set<int> ss; int val = true; for(int i = 0; i < N; i ++){ ss.insert(seq[i]); s[i] = seq[i]; s[i + N] = seq[i]; } if(ss.size()!=N)val = false; int start = min_element(s.begin(), s.begin() + N) - s.begin(); int last = 0; for(int i = start; i < start + N; i ++){ if(s[i] <= N){ if(last < s[i])last = s[i]; else val = false; } } return val; } int replacement(int N, int seq[], int rseq[]){ return 0; } int countReplacement(int N, int seq[]){ return 0; }

Compilation message (stderr)

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:13:17: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   13 |     if(ss.size()!=N)val = false;
      |        ~~~~~~~~~^~~
#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...