Submission #967162

#	Time	Username	Problem	Language	Result	Execution time	Memory
967162		VMaksimoski008	Gondola (IOI14_gondola)	C++14	100 / 100	36 ms	6492 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
const int mod = 1e9 + 9;

int valid(int n, int inputSeq[]) {
    int ans = 1;
    int cnt = 0;
    set<int> s;

    int big = 0;
    for(int i=0; i<n; i++) {
      if(inputSeq[i] > n) big++;
    }

    vector<int> v(n);
    int pos = -1;
    for(int i=0; i<n; i++) {
      if(inputSeq[i] <= n) {
        pos = i;
        v[i] = inputSeq[i];
        break;
      }
    }

    for(int i=pos+1; i<n; i++) {
      v[i] = v[i-1] + 1;
      //if(v[i] > n) v[i] -= n;
    }

    for(int i=pos-1; i>=0; i--) {
      v[i] = v[i+1] - 1;
      //if(v[i] <= 0) 
    }

    for(int i=0; i<n; i++) {
      if(v[i] > n) v[i] -= n;
      else if(v[i] <= 0) v[i] += n;
    }

    for(int i=0; i<n; i++) {
      if(inputSeq[i] > n) continue;
      if(inputSeq[i] != v[i]) return 0;
    }

    for(int i=0; i<n; i++) s.insert(inputSeq[i]);
    if(s.size() < n) return 0;

    return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
  int cnt = 0, big = 0, arr[n];
  for(int i=0; i<n; i++) arr[i] = gondolaSeq[i];

  for(int i=0; i<n; i++) big += (arr[i] > n);

  if(big == n) {
    vector<pair<int, int> > v;
    for(int i=0; i<n; i++) v.push_back({ arr[i], i + 1 });
    sort(v.begin(), v.end());

    int curr = n + 1;
    for(int i=0; i<n; i++) {
      int a = v[i].second, b = v[i].first;
      replacementSeq[cnt++] = a;
      while(curr != b) {
        replacementSeq[cnt++] = curr++;
      }
      curr++;
    }
  } else {
    vector<int> v(n);
    int pos = -1;
    for(int i=0; i<n; i++) {
      if(arr[i] <= n) {
        pos = i;
        v[i] = arr[i];
        break;
      }
    }

    for(int i=pos+1; i<n; i++) v[i] = v[i-1] + 1;
    for(int i=pos-1; i>=0; i--) v[i] = v[i+1] - 1;

    for(int i=0; i<n; i++) {
      if(v[i] > n) v[i] -= n;
      else if(v[i] <= 0) v[i] += n;
    }

    vector<pair<int, int> > ord;
    for(int i=0; i<n; i++) 
      if(arr[i] > n) ord.push_back({ arr[i], v[i] });
    sort(ord.begin(), ord.end());

    int curr = n + 1;
    for(auto &[b, a] : ord) {
      replacementSeq[cnt++] = a;
      while(curr != b) replacementSeq[cnt++] = curr++;
      curr++;
    }
  }

  return cnt;
}

ll exp(ll a, ll b) {
  ll ans = 1;
  while(b) {
    if(b & 1) ans = (ans * a) % mod;
    a = (a * a) % mod;
    b /= 2;
  }
  return ans;
}

int countReplacement(int n, int inputSeq[]) {
  if(!valid(n, inputSeq)) return 0;
  ll ans = 1;

  vector<int> v;
  for(int i=0; i<n; i++)
    if(inputSeq[i] > n) v.push_back(inputSeq[i]);
  if(v.size() == 0) return 1;
  sort(v.begin(), v.end());

  int mx = v.back();
  int sz = v.size();
  ll curr = n + 1;
  for(int i=0; i<sz; i++) {
    ans = (ans * exp(sz - i, v[i] - curr + ((sz - i) == n))) % mod;
    curr = v[i] + 1;
  }

  return (int)ans;
}

Compilation message (stderr)

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:49:17: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   49 |     if(s.size() < n) return 0;
      |        ~~~~~~~~~^~~
gondola.cpp:9:9: warning: unused variable 'ans' [-Wunused-variable]
    9 |     int ans = 1;
      |         ^~~
gondola.cpp:10:9: warning: unused variable 'cnt' [-Wunused-variable]
   10 |     int cnt = 0;
      |         ^~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:99:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   99 |     for(auto &[b, a] : ord) {
      |               ^
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:129:7: warning: unused variable 'mx' [-Wunused-variable]
  129 |   int mx = v.back();
      |       ^~

• 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: 5 / 5
• Subtask 8: 15 / 15
• Subtask 9: 15 / 15
• Subtask 10: 10 / 10