제출 #1212173

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1212173		LIA	Gondola (IOI14_gondola)	C++17	10 / 100	6 ms	1728 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef tuple<ll, ll, ll> plll;
typedef vector<plll> vplll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
typedef vector<vector<pll>> vvpll;
typedef vector<vector<ll>> vvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
#define loop(i, s, e) for (ll i = (s); i < (e); ++i)
#define loopr(i, e, s) for (ll i = (e)-1; i >= (s); --i)
#define all(a) a.begin(), a.end()
const ll inf = 1e9 + 7;

int valid(int n, int inputSeq[]) {
  bool b = 1;
  ll cnt = 0;
  vll bigger;
  vll inp;
  loop(i,0,n) {
    if (inputSeq[i] <=n) inp.push_back(inputSeq[i]);
  }
  vb vis;
  loop(i,1,n) {
    if (inp[i] < inp[i-1] && cnt!= 0 ) b = false;
    if (inp[i] < inp[i-1]) cnt++;
  }
  return (b==1 ? 1: 0);
}

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

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