제출 #237157

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
237157		mode149256	곤돌라 (IOI14_gondola)	C++14	5 / 100	7 ms	1408 KiB

gondola

/*input

*/
#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;

namespace my_template {
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef vector<pi> vpi;
typedef vector<vpi> vpii;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
typedef vector<pd> vpd;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef std::string str;
typedef std::vector<str> vs;

#define x first
#define y second
#define debug(...) cout<<"["<<#__VA_ARGS__<<": "<<__VA_ARGS__<<"]\n"

const ld PI = 3.14159265358979323846264338327950288419716939937510582097494L;

template<typename T>
pair<T, T> operator+(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x + b.x, a.y + b.y); }
template<typename T>
pair<T, T> operator-(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x - b.x, a.y - b.y); }
template<typename T>
T operator*(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.x + a.y * b.y); }
template<typename T>
T operator^(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.y - a.y * b.x); }

template<typename T>
void print(vector<T> vec, string name = "") {
	cout << name;
	for (auto u : vec)
		cout << u << ' ';
	cout << '\n';
}
}
using namespace my_template;

const int MOD = 1000000007;
const ll INF = std::numeric_limits<ll>::max();
const int MX = 100101;

vi kur(250002);

int valid(int n, int inputSeq[])
{
	set<int> dabar;
	for (int i = 0; i < n; ++i)
	{
		if (dabar.find(inputSeq[i]) != dabar.end()) return 0;
		dabar.insert(inputSeq[i]);
	}

	set<int> nera;
	int did = *(--dabar.end());

	for (int i = 0; i < n; ++i)
		kur[inputSeq[i]] = i;

	for (int i = 1; i < did; ++i)
	{
		if (dabar.find(i) == dabar.end())
			nera.insert(i);
	}

	while (*(--dabar.end()) != n) {
		int c = *(--dabar.end());
		int n = *(--nera.end());

		inputSeq[kur[c]] = n;
		kur[n] = kur[c];

		dabar.erase(c);
		nera.erase(n);
		dabar.insert(n);
	}

	int pos = -1;

	for (int i = 0; i < n; ++i)
	{
		if (inputSeq[i] <= n) {
			pos = i - inputSeq[i] + 1;
			break;
		}
	}
	if (pos == -1) return 1;

	for (int i = 0; i < n; ++i)
	{
		if (inputSeq[(pos + i) % n] <= n and inputSeq[(pos + i) % n] != i + 1)
			return 0;
	}

	return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	vi inputSeq;
	for (int i = 0; i < n; ++i) inputSeq.emplace_back(gondolaSeq[i]);
	{
		set<int> dabar;
		for (int i = 0; i < n; ++i)
		{
			if (dabar.find(inputSeq[i]) != dabar.end()) return 0;
			dabar.insert(inputSeq[i]);
		}

		set<int> nera;
		int did = *(--dabar.end());

		for (int i = 0; i < n; ++i)
			kur[inputSeq[i]] = i;

		for (int i = 1; i < did; ++i)
		{
			if (dabar.find(i) == dabar.end())
				nera.insert(i);
		}

		while (*(--dabar.end()) != n) {
			int c = *(--dabar.end());
			int n = *(--nera.end());

			inputSeq[kur[c]] = n;
			kur[n] = kur[c];

			dabar.erase(c);
			nera.erase(n);
			dabar.insert(n);
		}
	}
	vpi sk; // {val, pos}


	for (int i = 0; i < n; ++i)
	{
		if (gondolaSeq[i] > n) {
			sk.emplace_back(gondolaSeq[i], i);
		}
	}

	sort(sk.begin(), sk.end());

	int piv = n + 1;

	// for (auto u : sk) printf("%d %d\n", u.x, u.y);
	int ind = 0;
	for (int i = 0; i < (int)sk.size(); ++i)
	{
		while (inputSeq[sk[i].y] != gondolaSeq[sk[i].y]) {
			replacementSeq[ind++] = inputSeq[sk[i].y];
			// sk[i].x = piv++;
			inputSeq[sk[i].y] = piv++;
		}
	}

	return ind;
}

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

int countReplacement(int n, int inputSeq[])
{
	return -3;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 10
• Subtask 4: 5 / 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