Submission #489294

#	Time	Username	Problem	Language	Result	Execution time	Memory
489294		QuantumK9	Gondola (IOI14_gondola)	C++17	60 / 100	31 ms	4504 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair

using namespace std;

int valid(int n, int inputSeq[]){

  ll mx = n;

  set<ll> memo;

  ll i = 0;
  ll expectedVal;
  while ( i < n ){

    ll use = inputSeq[i];
    i++;

    if ( memo.find(use) != memo.end() ){ return 0; }

    memo.insert( use );

    mx = max( mx, use );

    if ( use <= n ){ expectedVal = use; break; }
    
  }

  for ( ; i < n; i++ ){

    expectedVal++; if( expectedVal > n ){ expectedVal -= n; }

    //cout << inputSeq[i] << " " << expectedVal << endl;

    ll use = inputSeq[i];

    if ( use <= n ){
      if ( use != expectedVal ){ return 0; }
    }
    
    if ( memo.find(use) != memo.end() ){ return 0; }
    memo.insert( use );
    mx = max( mx, use );

  }

  //for( ll j = n+1; j <= mx; j++ ){ if ( memo.find(j) == memo.end() ){ return 0; } }


  return 1;
}

//----------------------

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
  
  vector< pair<ll, ll> > makeAyos;  // newVal, expectedVal

  ll i = 0;

  ll expectedVal = -1;

  while ( i < n ){
    ll u = gondolaSeq[i];

    if ( u <= n ){ expectedVal = u; break; }

    i++;
  }

  // case 1 -- > at least one default value remains
  if ( expectedVal != -1 ){
    expectedVal -= i;
    if ( expectedVal <= 0 ){ expectedVal += n; }
  }
  // case 2 -- > no more default values remain
  else{
    expectedVal = 1;
  }

  //cout << "ev: " << expectedVal << endl;

  for( int j = 0; j < n; j++ ){

    if ( gondolaSeq[j] != expectedVal ){
      makeAyos.pb ( mp( gondolaSeq[j], expectedVal ) );
    }

    expectedVal++; if ( expectedVal > n ){ expectedVal -= n; }
  }

  sort( makeAyos.begin(), makeAyos.end());

  // for( int l = 0; l < makeAyos.size(); l++ ){
  //   cout << makeAyos[l].first << " " << makeAyos[l].second << endl;
  // }

  ll cnt = 0;

  ll replacementVal = n+1;

  for( int k = 0; k < makeAyos.size(); k++ ){

    // at least one do-up
    replacementSeq[ cnt ] = makeAyos[k].second;
    cnt++;
    replacementVal++;

    while ( replacementVal <= makeAyos[k].first ){

      replacementSeq[ cnt ] = replacementVal-1;

      cnt++;

      replacementVal++;

    }

  }

  return cnt;

}

//----------------------

const ll MOD = 1000000007;

ll mod_pow( ll b, ll e ){

  if ( e == 0 ){ return 1; }
  if ( e == 1 ){ return b; }

  if ( e%2 ){ return (b*( mod_pow(b,e-1) )%MOD)%MOD; }
  else{ return mod_pow( (b*b)%MOD, e/2 )%MOD; }
}

ll solve( ll n, ll s, vector<ll> v ){

  ll fA = 1, cV = n;

  for( int i = 0; i < s; i++ ){

    ll daDistance = v[i] - cV;
    daDistance--;

    fA *= mod_pow( s-i, daDistance );
    fA %= MOD;

    cV = v[i];

    //cout << v[i] << " " << fA << endl;

  }

  return fA;
}

int countReplacement(int n, int inputSeq[]){

  if ( !valid(n, inputSeq) ){ return 0; }

  ll i = 0, expectedVal = -1;

  while ( i < n ){
    if ( inputSeq[i] <= n ){ expectedVal = inputSeq[i]; break; }
    i++;
  }

  // case 1 -- > at least one default value remains
  if ( expectedVal != -1 ){

    expectedVal -= i;
    if ( expectedVal <= 0 ){ expectedVal += n; }

    vector<ll> toSolve;

    for( int j = 0; j < n; j++ ){

      if ( inputSeq[j] != expectedVal ){ toSolve.pb ( inputSeq[j] ); }

      expectedVal++; 
      if ( expectedVal > n ){ expectedVal -= n; }

    }

    sort( toSolve.begin(), toSolve.end() );

    return solve( n, toSolve.size(), toSolve );

  }

  // case 2 -- > no more default values remain
  else{
    
    // for all expectedVal { 1 , n } --> solve
    return -3;

  }

}

Compilation message (stderr)

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

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