Submission #974580

#	Time	Username	Problem	Language	Result	Execution time	Memory
974580		hariaakas646	곤돌라 (IOI14_gondola)	C++14	10 / 100	7 ms	1372 KiB

gondola

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

using namespace std;

#define scd(t) scanf("%d", &t)
#define sclld(t) scanf("%lld", &t)
#define forr(i, j, k) for (int i = j; i < k; i++)
#define frange(i, j) forr(i, 0, j)
#define all(cont) cont.begin(), cont.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
typedef long long int lli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<lli> vll;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef map<int, int> mpii;
typedef set<int> seti;
typedef multiset<int> mseti;
typedef long double ld;

int valid(int n, int inputSeq[])
{
  pii mi = mp(2e9, 1e9);
  frange(i, n) {
    mi = min(mi, mp(inputSeq[i], i));
  }
  if(mi.f > n) return 1;
  int v = mi.f;
  forr(i, mi.s+1, n) {
    if(inputSeq[i] <= n) {
      if(inputSeq[i] > v) v = inputSeq[i];
      else return 0;
    }
  }
  forr(i, 0, mi.s) {
    if(inputSeq[i] <= n) {
      if(inputSeq[i] > v) v = inputSeq[i];
      else 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: 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