Submission #30894

#	Time	Username	Problem	Language	Result	Execution time	Memory
30894		Navick	medians (balkan11_medians)	C++14	60 / 100	99 ms	13116 KiB

medians

#include <bits/stdc++.h>
#define F first
#define S second
#define pii pair<int, int>
#define pb push_back

using namespace std;

typedef long long ll;
typedef long double ld;

const int N = 2e5 + 10;

set<int> st;

int a[N], b[N];

int main(){
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n; cin >> n;
	for(int i=1; i<2*n; i++)
		st.insert(i);

	for(int i=0; i<n; i++){
		cin >> a[i];
		if(i == 0){
			b[i] = a[i];
			st.erase(a[i]);
		}
		else{
			if(st.find(a[i]) != st.end()){
				if(a[i] > a[i - 1]){
					b[2*i] = a[i];
					st.erase(a[i]);
					b[2*i - 1] = *(st.rbegin());
					st.erase(*st.rbegin());
				}else if(a[i] < a[i - 1]){
					b[2*i] = a[i];
					st.erase(a[i]);
					b[2*i - 1] = *(st.begin());
					st.erase(st.begin());
				}
			}
			else{
				if(a[i] == a[i - 1]){
					b[2*i] = *st.begin();
					st.erase(st.begin());
					b[2*i - 1] = *(st.rbegin());
					st.erase(*st.rbegin());
				}else if(a[i] < a[i - 1]){
					b[2*i] = *st.begin();
					st.erase(st.begin());
					b[2*i - 1] = *st.begin();
					st.erase(st.begin());
				}else{
					b[2*i] = *st.rbegin();
					st.erase(*st.rbegin());
					b[2*i - 1] = *st.rbegin();
					st.erase(*st.rbegin());
				}
			}
			
		}
	}
	for(int i=0; i<2*n - 1; i++)
		cout << b[i] << ' '; cout << endl;
}

• Subtask 1: 60 / 65
• Subtask 2: 0 / 35