제출 #1344047

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1344047		tkm_algorithms	곤돌라 (IOI14_gondola)	C++20	10 / 100	6 ms	1216 KiB

gondola

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

using namespace std;
using ll = long long;
using P = pair<int, int>;
#define all(x) x.begin(), x.end()
#define rep(i, l, n) for (int i = l; i < (n); ++i)
#define sz(x) (int)x.size()
const char nl = '\n';

int valid(int n, int a[])
{
	int f = 3e5, id = -1;
	vector<int> g[2];
	rep(i, 0, n) {
		if (a[i] > n)continue;
		if (a[i] < f) {
			if (id == 1)return 0;
			f = a[i];
			g[++id].push_back(a[i]);
		} else {
			g[id].push_back(a[i]);
		}
	}
	if (id == 1) {
		if (g[1].back() < g[0].front())return 1;
		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