제출 #1340312

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

gondola

#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;

int valid(int n, int a[]) {
	vector<int> bf, after;
	bool found=false;
	map<int, int> mp;
	for (int i=0; i<n; i++) {
		mp[a[i]]++;
		if (a[i] == 1) {
			found = true;
		}
		if (found) after.push_back(a[i]);
		else bf.push_back(a[i]);
	}
	for (auto [x, val] : mp) {
		if (val>=2) {
			return 0;
		}
	}
	vector<int> c;
	for (auto x : after) {
		c.push_back(x);
	}
	for (auto x : bf) {
		c.push_back(x);
	}
	vector<int> b = c;
	sort(b.begin(), b.end());
	return c==b;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
	return 0;
}
int countReplacement(int n, int inputSeq[]) {
	return 0;
}

• 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