Submission #706149

#TimeUsernameProblemLanguageResultExecution timeMemory
706149LLLLLLLLLLLLLLLLLLLLLLLGondola (IOI14_gondola)C++14
Compilation error
0 ms0 KiB
#include <bits/stdc++.h> // #include "gondola.h" using namespace std; const int MOD = 1e9 + 9; const int INF = 0x3f3f3f3f; int valid(int n, int v[]){ set<int> s(v, v + n); if((int) s.size() != n) return 0; for(int i = 0; i < n; i++){ if(v[i] > n) continue; int left = (v[i] == 1 ? n : v[i] - 1), right = (v[i] == n ? 1 : v[i] + 1); int lefViz = (i == 0 ? v[n - 1] : v[i - 1]); int rigViz = (i == n - 1 ? v[0] : v[i + 1]); if((lefViz != left && lefViz <= n) || (rigViz != right && rigViz <= n)) return 0; } return 1; } int countReplacement(int n, int v[]){ if(!valid(n, v)) return 0; return 1; } int replacement(int n, int v[], int answer[]){ vector<int> order(n); vector<pair<int, int>> aux; int mn = INF, mnidx = 0; for(int i = 0; i < n; i++) if(v[i] < mn){ mn = v[i]; mnidx = i; } if(mn > n) mnidx = 0, mn = 1; for(int i = 0; i < n; i++){ order[(i + mnidx) % n] = mn; mn = (mn == n ? 1 : mn + 1); } for(int i = 0; i < n; i++) if(v[i] > n) aux.push_back({v[i], order[i]}); sort(aux.begin(), aux.end()); int numOp = 0; for(int i = 0, val = n; i < aux.size(); i++){ answer[numOp++] = aux[i].second; val++; while(val < aux[i].first) answer[numOp++] = val++; } return numOp; }

Compilation message (stderr)

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:54:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |     for(int i = 0, val = n; i < aux.size(); i++){
      |                             ~~^~~~~~~~~~~~
/usr/bin/ld: /tmp/ccCT9uIP.o: in function `main':
grader.cpp:(.text.startup+0xb6): undefined reference to `valid'
/usr/bin/ld: grader.cpp:(.text.startup+0x108): undefined reference to `countReplacement'
/usr/bin/ld: grader.cpp:(.text.startup+0x132): undefined reference to `replacement'
collect2: error: ld returned 1 exit status