Submission #1335021

#	Time	Username	Problem	Language	Result	Execution time	Memory
1335021		matsakyannn	중앙값 배열 (balkan11_medians)	C++20	5 / 100	16 ms	4568 KiB

medians

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
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(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T> void print(deque <T> v);
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 << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(queue <T> q) {cerr << "[ "; while(!q.empty()) {print(q.front()); cerr << " "; q.pop();} cerr << "]";}
template <class T> void print(priority_queue <T> q) {cerr << "[ "; while(!q.empty()) {print(q.top()); cerr << " "; q.pop();} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(int n__, T arr[]) {cerr << "[ "; for(int i = 0; i <= n__; i++) {print(arr[i]); cerr << " ";} cerr << "]\n";}
 
 
#define pb push_back
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define noAnsw cout << -1 << '\n'
#define ll long long
#define ppb pop_back
#define OK cout << "OK" << endl;
#define ld long double
#define all(v) (v).begin(), (v).end()
#define MP make_pair
#define PII pair <int, int>
#define endl '\n'
#define ull unsigned long long
#define PLL pair <ll, ll>
#define PIL pair <int, ll>
#define PLI pair <ll, int>
#define rall(v) (v).rbegin(), (v).rend() 
#define priora priority_queue
#define urishOK cout << "urishOK\n";
 
void setIO(string name = "") {
	if (!name.empty()) {
		freopen((name + ".in").c_str(), "r", stdin);  
		freopen((name + ".out").c_str(), "w", stdout);
	}
}
void fastIO(){
    ios_base::sync_with_stdio(false);
	cin.tie(NULL); cout.tie(NULL); 
}
void setPrecision(int x){
    if(x == 0){
        return;
    }
    cout.setf(ios::fixed);
    cout.precision(x);
    return;
}
 
const int inf = 1e9 + 5, LOG = 20;
const ll inf64 = 1e18 + 5, mod = 1e9 + 7, wmod = 998244353;
const double epsilon = 0.000001, pi = 3.14159265359;
 
const int N = 2e5 + 5;
int n, b[N], a[N], added[N], used[N];

void solve(int TST_NUM){
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> b[i];
        added[b[i]]++;
    }
    deque <int> dq;
    for(int i = 1; i <= 2 * n - 1; i++){
        if(!added[i]) dq.push_back(i);
    }

    int curr = 2 * n - 1;
    for(int i = n; i >= 2; i--){
        added[b[i]]--;
        if(b[i] == b[i - 1]){
            //assert(dq.back() != dq.front());
            a[curr] = dq.back();
            a[curr - 1] = dq.front();
            dq.pop_back(), dq.pop_front();
            curr -= 2;
        }
        if(b[i] > b[i - 1]){
            if(!added[b[i]]) a[curr] = b[i];
            else {a[curr] = dq.front(); dq.pop_front();}
            a[curr - 1] = dq.back();
            dq.pop_back();
            curr -= 2;
        }
        if(b[i] < b[i - 1]){
            if(!added[b[i]]) a[curr] = b[i];
            else {a[curr] = dq.back(), dq.pop_back();}
            a[curr - 1] = dq.front();
            dq.pop_front();
            curr -= 2;
        }
        //dbg(curr);
    }
    a[1] = b[1];
    
    for(int i = 1; i <= 2 * n - 1; i++){
        assert(!used[a[i]]);
        cout << a[i] << ' ';
        used[a[i]] = 1;
    }
    cout << endl;
}   
 
int main(){
    setPrecision(1);
    fastIO();
    //setIO("file");
 
    int Tests = 1;
    //cin >> Tests;
 
    int TST_NUM = 1;
    while(Tests--){
        solve(TST_NUM++);
    }
    return 0; 
} 
//mcmcmcmcmcmcmcmcmcmcmc
//mcmcmcmcmcmcmcmcmcmcmc
//mcmcmcmcmcmcmcmcmcmcmc
//mcmcmcmcmcmcmcmcmcmcmc
//matsak

Compilation message (stderr)

medians.cpp: In function 'void setIO(std::string)':
medians.cpp:59:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |                 freopen((name + ".in").c_str(), "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
medians.cpp:60:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   60 |                 freopen((name + ".out").c_str(), "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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