Submission #54316

#	Time	Username	Problem	Language	Result	Execution time	Memory
54316		Mahmoud_Adel	medians (balkan11_medians)	C++14	100 / 100	142 ms	13260 KiB

medians

#include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update


#define f first
#define s second
#define pb push_back
#define mp make_pair
#define clr(dp,i) memset(dp,i,sizeof(dp))
#define opt     ios_base::sync_with_stdio(NULL);cin.tie(NULL);cout.tie(NULL);

using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update> oset;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
const long long mod = 1e9+7;
const ld pi = 3.14159265358979323846264338327950288;
//========================================
int vis[200001];
int main()
{
	opt;
	int n;
	cin >> n;
	int a[n];
	oset med;
	int bot = 1;
	int top = n*2 - 1;
	for(int i=0; i<n; i++)
	cin >> a[i];
	vector<int> vec;
	for(int i=0; i<n; i++)
	{
		if(!vis[a[i]])
		{
			vec.pb(a[i]);
			vis[a[i]] = 1;
			med.insert(a[i]);
		}
		int x = med.order_of_key(a[i]);
  		x = i - x;
		int sz = i * 2 + 1;
		int y = (sz - med.size()) - x;
		//cout << x << " " << y << endl;
		while(x > 0)
		{
			if(!vis[bot])
			x--, vis[bot] = 1, med.insert(bot), vec.pb(bot);
			bot++;
		}
		while(y > 0)
		{
			if(!vis[top])
			y--, vis[top] = 1, med.insert(top), vec.pb(top);
			top--;
		}
	}
	for(int i : vec)
	cout << i << " ";
	cout << endl;
}

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