Submission #658671

#TimeUsernameProblemLanguageResultExecution timeMemory
658671Filyamedians (balkan11_medians)C++17
85 / 100
22 ms3408 KiB
/////////////////////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///////////////////// int used[200005], a[100005]; int main() { fastio; int n; cin >> n; int mini = 1, maxi = 2 * n - 1; fra(n) cout << a[0] << ' '; used[a[0]] = 1; if(used[maxi]) maxi--; else if(used[mini]) mini++; //misht ezrayinnerna petq linum nayel vorovhetev amen qaylic heto inchqan shat element ka orinak i hat, median > i-1 frr(1, n) { // dbg(mini) dbg(maxi) if(a[i] == a[i - 1]) { //mi hat mec avelacnel mi hat poqr used[maxi] = 1; cout << maxi << ' '; while(used[maxi]) maxi--; used[mini] = 1; cout << mini << ' '; while(used[mini]) mini++; } else if(a[i] > a[i - 1]) { if(used[a[i]]) { //2hat mec avelacnel used[maxi] = 1; cout << maxi << ' '; while(used[maxi]) maxi--; used[maxi] = 1; cout << maxi << ' '; while(used[maxi]) maxi--; } else { //a[i] eb mi hat mec avelacnel used[a[i]] = 1; cout << a[i] << ' '; used[maxi] = 1; cout << maxi << ' '; while(used[maxi]) maxi--; } } else { if(used[a[i]]) { //2hat poqr avelacnel used[mini] = 1; cout << mini << ' '; while(used[mini]) mini++; used[mini] = 1; cout << mini << ' '; while(used[mini]) mini++; } else { //a[i] eb mi hat mec avelacnel used[a[i]] = 1; cout << a[i] << ' '; used[mini] = 1; cout << mini << ' '; while(used[mini]) mini++; } } } return 0; } // ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ // ♥ ♥ ♥ ♥ ♥ ♥ ♥ // ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ // ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ // ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ // // God loves Fil, Fil accepts God's will
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...