Submission #684915

#	Time	Username	Problem	Language	Result	Execution time	Memory
684915		beaconmc	Gondola (IOI14_gondola)	C++14	10 / 100	9 ms	1092 KiB

gondola

#include "gondola.h"


#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

typedef long long ll;
using namespace std;
//using namespace __gnu_pbds;

#define FOR(i, x, y) for(ll i=x; i<y; i++)
#define FORNEG(i, x, y) for(ll i=x; i>y; i--)
//#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL)



int valid(int n, int inputSeq[])
{
  ll sus = -1;
  FOR(i,0,n){
    if (inputSeq[i] <= n){
      sus = i;
    }
  }
  if (sus==-1) return 1;
  ll cnt = inputSeq[sus];
  FOR(i, sus, sus+n){
    if (cnt > n) cnt -= n;
    ll imp = i;
    if (imp>=n) imp -= n;
    if (inputSeq[imp] != cnt && inputSeq[imp] <= n) return 0;
    cnt++;
  }
  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: 0 / 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