제출 #602697

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
602697		Vanilla	곤돌라 (IOI14_gondola)	C++17	75 / 100	17 ms	9684 KiB

gondola

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

int valid(int n, int a[]){
	const int maxv = 2e5 + 5e4 + 3;

	int mp [maxv] = {};
	int in [n] = {};
	int ps = -1;
	for (int i = 0; i < n; i++){
		if (a[i] <= n) ps = i;
	}
	if (ps == -1){
		for (int i = 0; i < n; i++) in[i] = i + 1;
	}
	else {
		for (int i = ps, v = a[ps]; !in[i]; i = (i + 1) % n, v = v % n + 1) in[i] = v;
	}
	for (int i = 0; i < n; i++){
		mp[a[i]]++;
		if (mp[a[i]] > 1) return 0;
	}
	if (ps == -1) return 1;
	for (int i = 0; i < n; i++){
		if (a[i] <= n && a[i] != in[i]) return 0;
	}
	return 1;
}

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

int replacement(int n, int a[], int rs[]){
	const int maxv = 2e5 + 5e4;

	int in[n] = {};
	int l = 0;
	int ct = n + 1;
	int ps = -1;
	vector <pair <int, int> > v;
	for (int i = 0; i < n; i++){
		v.push_back({a[i], i});
		if (a[i] <= n) ps = i;
	}
	sort(v.begin(), v.end());
	if (ps == -1){
		for (int i = 0; i < n; i++) in[i] = i + 1;
	}
	else {
		for (int i = ps, v = a[ps]; !in[i]; i = (i + 1) % n, v = v % n + 1) in[i] = v;
	}
	for (auto [val, pos]: v) {
		while (in[pos] != val) {
			rs[l++] = in[pos];
			in[pos] = ct++;
		}
	}

	return l;
}

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

const int maxv = 1e6 + 2;
const int64 mod = 1e9 + 9;
int64 pref [maxv] = {};
bitset <maxv> is;
int countReplacement(int n, int a[]){
	if (!valid(n, a)) return 0;
	bool low = 0;
	for (int i = 0; i < n; i++){
		pref[a[i]] = 1;
		is[a[i]] = 1;
		if (a[i] <= n) low = 1;
	}
	for (int i = 1; i < maxv; i++) pref[i] += pref[i-1];
	int64 rs = 1;
	for (int i = n + 1; i < maxv; i++){
		if (is[i]) continue;
		int64 h = n - pref[i - 1];
		if (h == 0) break;
		rs = rs * h % mod;
	}
	if (!low) for (int64 i = 1; i <= n; i++) rs = rs * i % mod;
	return rs;
}

컴파일 시 표준 에러 (stderr) 메시지

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:35:12: warning: unused variable 'maxv' [-Wunused-variable]
   35 |  const int maxv = 2e5 + 5e4;
      |            ^~~~

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 10 / 10
• Subtask 6: 20 / 20
• Subtask 7: 5 / 5
• Subtask 8: 15 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10