oj.uz

Submission #210738

# Submission time Handle Problem Language Result Execution time Memory
210738 2020-03-18T09:16:02 Z balbit medians (balkan11_medians) C++14
10 / 100
 102 ms 12908 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1<<29;
const ll inf = 1ll<<60;
const ll mod = 1e9+7;


void GG(){cout<<"-1\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b, ll mo = mod){
    if (b==1) return b;
    return (mo-mo/b) * inv(mo%b) % mo;
}

const int maxn = 3e5+5;

signed main(){
    IOS();
    int n; cin>>n;
    vector<int> nof(n*2+1);
    vector<int> a(n);
    for (int i = 0; i<n; i++) {
        cin>>a[i]; nof[a[i]] ++;
    }
    set<int> p;
    for (int i = 1; i<=2*n-1; i++) {
        if (nof[i] == 0) p.insert(i);
    }
    vector<int> b;
    for (int i = n-2; i>=0; i--) {
        nof[a[i+1]] --;
        if (nof[a[i+1]] == 0) {
            p.insert(a[i+1]);
        }
        if (a[i+1] > a[i]) {
            b.pb(*(p.rbegin())); p.erase(*(p.rbegin()));
            b.pb(*(p.rbegin())); p.erase(*(p.rbegin()));
        }
        if (a[i+1] < a[i]) {
            b.pb(*(p.begin())); p.erase(*(p.begin()));
            b.pb(*(p.begin())); p.erase(*(p.begin()));
        }
        if (a[i+1] == a[i]) {
            b.pb(*(p.rbegin())); p.erase(*(p.rbegin()));
            b.pb(*(p.begin())); p.erase(*(p.begin()));
        }
    }

    b.pb(a[0]);
    for (int i = SZ(b)-1; i>=0; --i) {
        cout<<b[i]<<' ';
    }
}

Subtask #1
10.0 / 65.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 376 KB Output isn't correct
2 Incorrect 5 ms 376 KB Output isn't correct
3 Correct 5 ms 376 KB Output is correct
4 Incorrect 5 ms 380 KB Output isn't correct
5 Incorrect 5 ms 376 KB Output isn't correct
6 Correct 5 ms 376 KB Output is correct
7 Incorrect 5 ms 376 KB Output isn't correct
8 Incorrect 5 ms 376 KB Output isn't correct
9 Incorrect 5 ms 376 KB Output isn't correct
10 Incorrect 5 ms 376 KB Output isn't correct
11 Incorrect 6 ms 352 KB Output isn't correct
12 Incorrect 5 ms 376 KB Output isn't correct
13 Incorrect 5 ms 504 KB Output isn't correct

Subtask #2
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 632 KB Output isn't correct
2 Incorrect 8 ms 764 KB Output isn't correct
3 Incorrect 11 ms 1400 KB Output isn't correct
4 Incorrect 17 ms 2424 KB Output isn't correct
5 Incorrect 32 ms 4600 KB Output isn't correct
6 Incorrect 65 ms 8440 KB Output isn't correct
7 Incorrect 102 ms 12908 KB Output isn't correct