Submission #489287

#	Time	Username	Problem	Language	Result	Execution time	Memory
489287		QuantumK9	Gondola (IOI14_gondola)	C++17	20 / 100	30 ms	4924 KiB

gondola

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

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[])
{
  return -2;
}

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

int countReplacement(int n, int inputSeq[])
{
  return -3;
}

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