Submission #632552

#TimeUsernameProblemLanguageResultExecution timeMemory
632552Filyamedians (balkan11_medians)C++14
100 / 100
122 ms15044 KiB
/*/ author: ♥Filya♥ created: 20.08.2022 /*/ /////////////////////include///////////////////// //#include <bits/stdc++.h> #define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <string> #include <algorithm> #include <cmath> #include <cstring> #include <cassert> #include <set> #include <map> #include <unordered_map> #include <vector> #include <stack> #include <queue> #include <iomanip> #include <bitset> #include <stdio.h> #include <climits> #include <numeric> using namespace std; #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; template <typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; /////////////////////define///////////////////// #define ci(x) if(x) cout << "yes" << endl; else cout << "no" << endl; #define cii(x) if(check(x)) #define MOD 1000000007 #define MOD2 998244353 #define oo 1e9 #define ool 1e18L #define pii pair<int, int> #define pll pair<long long, long long> #define mii map<int, int> #define vi vector<int> #define vpi vector<pair<int, int>> #define vll vector <ll> #define ff first #define ss second #define mp make_pair #define ll long long #define ld long double #define pb push_back #define eb emplace_back #define pob pop_back #define lb lower_bound #define ub upper_bound #define bs binary_search #define sz(x) (int((x).size())) #define all(x) (x).begin(), (x).end() #define alll(x) (x), (x) + n #define clr(x) (x).clear(); #define fri(x) for(int i = 0; i < x; ++i) #define frj(x) for(int j = 0; j < x; ++j) #define frr(a, b) for(int i = a; i < b; ++i) #define frrj(a, b) for(int j = a; j < b; ++j) #define fra(x) for(int i = 0; i < x; ++i) cin >> a[i]; #define frb(x) for(int i = 0; i < x; ++i) cin >> b[i]; #define frs(x) for(auto it = x.begin(); it != x.end(); ++it) #define fr(x) for(auto it : x) //el #define fastio ios_base::sync_with_stdio(false); cin.tie(0); #define dbg(x) cerr << #x << ": " << x << endl; #define ce(x) cout << x << endl; #define uniq(x) x.resize(unique(all(x)) - x.begin()); //make all one after sorting #define blt __builtin_popcount /////////////////////print array, vector, deque, set, multiset, pair, map ///////////////////// void print(long long t) {cerr << t;} void print(int t) {cerr << t;} void print(string t) {cerr << t;} void print(char t) {cerr << t;} void print(double t) {cerr << t;} void print(long double t) {cerr << t;} void print(unsigned long long t) {cerr << t;} template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]"; cout << endl;} template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";} template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;} template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;} template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;} template <class T> void print(stack <T> v) {cerr << "[ "; stack<T> s = v; while(s.size()) {int i = s.top(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;} template <class T> void print(queue <T> v) {cerr << "[ "; queue<T> s = v; while(s.size()) {int i = s.front(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;} template <class T> void print(deque <T> v) {cerr << "[ "; deque<T> s = v; while(s.size()) {int i = s.front(); print(i); s.pop_front(); cerr << " ";} cerr << "]"; cout << endl;} template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;} template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;} /////////////////////code///////////////////// struct segtree { vector <ll> tree; int size = 1; void init(int n) { //make tree while(size < n) size *= 2; tree.assign(2 * size - 1, 0); } void set(int i, ll v, int x, int lx, int rx) { if(rx - lx == 1) { tree[x] = v; return; } int m = (lx + rx) / 2; if(i < m) set(i, v, 2 * x + 1, lx, m); else set(i, v, 2 * x + 2, m, rx); tree[x] = tree[2 * x + 1] + tree[2 * x + 2]; } void set(int i, ll v) { //set i-th to v set(i, v, 0, 0, size); } long long sum(int l, int r, int x, int lx, int rx) { if(l >= rx || lx >= r) return 0; if(lx >= l && rx <= r) return tree[x]; int m = (lx + rx) / 2; return sum(l, r, 2 * x + 1, lx, m) + sum(l, r, 2 * x + 2, m, rx); } long long sum(int l, int r) { return sum(l, r, 0, 0, size); } }; void solve() { int n, a, big, small; cin >> n; set<int> s; frr(1, 2 * n) s.insert(i); segtree st; st.init(2 * n); cin >> a; st.set(a, 1); s.erase(a); cout << a << ' '; frr(1, n - 1) { cin >> a; small = st.sum(0, a); big = st.sum(a + 1, 2 * n); // dbg(a) dbg(big) dbg(small) if(s.count(a)) { st.set(a, 1); s.erase(a); cout << a << ' '; if(big > small) { auto it = s.begin(); st.set(*it, 1); cout << *it << ' '; s.erase(it); } else { // print(s); dbg(i) auto it = prev(s.end()); st.set(*it, 1); cout << *it << ' '; s.erase(it); } } else { if(big > small) { auto it = s.begin(); st.set(*it, 1); cout << *it << ' '; s.erase(it); it = s.begin(); st.set(*it, 1); cout << *it << ' '; s.erase(it); } else if(small > big) { auto it = prev(s.end()); st.set(*it, 1); cout << *it << ' '; s.erase(it); it = prev(s.end()); st.set(*it, 1); cout << *it << ' '; s.erase(it); } else { auto it = prev(s.end()); st.set(*it, 1); cout << *it << ' '; s.erase(it); it = s.begin(); st.set(*it, 1); cout << *it << ' '; s.erase(it); } } } cin >> a; for(int x : s) cout << x << ' '; } int main() { fastio; int t = 1; // cin >> t; while(t--) { solve(); } return 0; } // ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ // ♥ ♥ ♥ ♥ ♥ ♥ ♥ // ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ // ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ // ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ // // God loves Fil, Fil accepts God's will
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...