Submission #431651

#TimeUsernameProblemLanguageResultExecution timeMemory
431651MilosMilutinovicGondola (IOI14_gondola)C++14
Compilation error
0 ms0 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; int valid(int N, int A[]) { int j = -1; for (int i = 0; i < N; i++) if (A[i] >= 1 && A[i] <= N) { j = i; break; } set<int> vals; for (int i = 0; i < N; i++) vals.insert(A[i]); if (vals.size() != N) return 0; if (j == -1) return 1; int val = A[j]; for (int i = 0; i < N; i++) { int id = (i + j) % N; if (A[id] >= 1 && A[id] <= N && A[id] != val) return 0; val++; if (val == N + 1) val = 1; } return 1; } int replacement(int N, int A[], int ans[]) { vector<int> B; for (int i = 0; i < N; i++) if (A[i] > N) B.push_back(i); int start_id = -1; for (int i = 0; i < N; i++) if (A[i] >= 1 && A[i] <= N) { start_id = i; break; } if (start_id == -1) start_id = min_element(A, A + N) - A; vector<int> start_val(N); for (int i = 0; i < N; i++) { int index = (start_id + i) % N; int val = A[start_id] + i; if (val > N) val -= N; start_val[index] = val; } sort(B.begin(), B.end(), [&](int i, int j){ return A[i] < A[j]; }); int index = 0; for (int i : B) { ans[index++] = start_val[i]; while (last < A[i]) ans[index++] = last++; } return index; } int countReplacement(int N, int A[]) { return valid(N, A); }

Compilation message (stderr)

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:17:21: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   17 |     if (vals.size() != N)
      |         ~~~~~~~~~~~~^~~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:73:16: error: 'last' was not declared in this scope
   73 |         while (last < A[i])
      |                ^~~~