제출 #955097

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
955097		4QT0R	곤돌라 (IOI14_gondola)	C++17	25 / 100	24 ms	5216 KiB

gondola

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

int valid(int n, int inputSeq[]){
	set<int> s(inputSeq,inputSeq+n);
	if ((int)s.size()<n)return 0;
	pii mn={n+1,-1};
	for (int i = 0; i<n; i++){
		if (inputSeq[i]<mn.first)mn={inputSeq[i],i};
	}
	int cur=mn.first;
	for (int i = mn.second+1; i<n; i++){
		if (inputSeq[i]<=n && inputSeq[i]!=++cur)return 0;
	}
	for (int i = 0; ++cur<=n; i++){
		if (inputSeq[i]<=n && inputSeq[i]!=cur)return 0;
	}
	return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
	int st=0;
	for (int i = 0; i<n; i++){
		if (gondolaSeq[i]<=n){
			st=(i-gondolaSeq[i]+1+n)%n;
			break;
		}
	}
	vector<int> kol(n);
	for (int i = st; i<n+st; i++)kol[i-st]=gondolaSeq[i%n];
	priority_queue<pii,vector<pii>,greater<pii>> pq;
	int mx=0;
	int l=0;
	for (int i = 0; i<n; i++){
		if (kol[i]>n)pq.push({kol[i],i+1});
		mx=max(mx,kol[i]);
	}
	while(pq.size()){
		pii now=pq.top();
		pq.pop();
		replacementSeq[l++]=now.second;
		if (pq.empty())break;
		if (pq.top().first>now.first+1)pq.push({now.first+1,now.first});
	}
	return l;
}
int countReplacement(int n, int inputSeq[]){
	if (!valid(n,inputSeq))return 0;
	return 1;
}

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