Submission #288302

#	Time	Username	Problem	Language	Result	Execution time	Memory
288302		Atill83	Gondola (IOI14_gondola)	C++14	20 / 100	16 ms	1704 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN = (int) 3e5 + 5;
int yer[MAXN];
int valid(int n, int inputSeq[])
{
  for(int i = 1; i <= n; i++){
    yer[i] = -1;
  }
  vector<int> ot;
  for(int i = 0; i < n; i++){
    if(inputSeq[i] <= n){ if(yer[inputSeq[i]] != -1) return 0; yer[inputSeq[i]] = i;}
    else{
      ot.push_back(inputSeq[i]);
    }
  }
  sort(ot.begin(), ot.end());
  int bas = n;
  for(int i: ot){
    if(i != bas + 1){
      return 0;
    }else bas++;
  }
  int last = 0;
  int deg = 0;
  for(int i = 1; i <= n; i++){
    if(yer[i] == -1) continue;
    if(yer[i] < last){
      last = yer[i];
      if(deg) return 0;
      deg = 1;
    }
    last = yer[i];
  }

  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