Submission #469568

#	Time	Username	Problem	Language	Result	Execution time	Memory
469568		Soumya1	Gondola (IOI14_gondola)	C++17	55 / 100	47 ms	4584 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
int valid(int n, int a[]) {
  bool ok = true;
  map<int, bool> mp;
  for (int i = 0; i < n; i++) {
    ok &= (!mp[a[i]]);
    mp[a[i]] = true;
  }
  int pos = -1, val = -1;
  for (int i = 0; i < n; i++) {
    if (a[i] <= n) {
      val = a[i];
      pos = i;
      break;
    }
  }
  val++;
  if (val > n) val = 1;
  for (int i = pos + 1; i < n; i++) {
    if (a[i] <= n) {
      ok &= (a[i] == val);
    }
    val++;
    if (val > n) val = 1;
  }
  for (int i = 0; i < pos; i++) {
    if (a[i] <= n) {
      ok &= (a[i] == val);
    }
    val++;
    if (val > n) val = 1;
  }
  return (int) ok;
}
int replacement(int n, int a[], int ans[]) {
  int pos = -1, val = -1;
  for (int i = 0; i < n; i++) {
    if (a[i] <= n) {
      pos = i;
      val = a[i];
      break;
    }
  }
  vector<pair<int, int>> v;
  for (int i = 0; i < n; i++) {
    if (a[i] > n) v.push_back({a[i], i});
  }
  if (pos != -1) {
    for (int i = pos; i < n; i++) {
      a[i] = val++;
      if (val > n) val = 1;
    }
    for (int i = 0; i < pos; i++) {
      a[i] = val++;
      if (val > n) val = 1;
    }
  } else {
    for (int i = 0; i < n; i++) a[i] = i + 1;
  }
  int ptr = 0;
  sort(v.begin(), v.end());
  int cur = n + 1;
  for (int i = 0; i < v.size(); i++) {
    while (cur <= v[i].first) {
      ans[ptr++] = a[v[i].second];
      a[v[i].second] = cur++;
    }
  }
  return ptr;
}
int countReplacement(int n, int inputSeq[]) {
  return -3;
}

Compilation message (stderr)

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:65:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |   for (int i = 0; i < v.size(); i++) {
      |                   ~~^~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 10 / 10
• Subtask 6: 20 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10