oj.uz

답안 #59355

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
59355 2018-07-21T18:03:29 Z Benq 중앙값 배열 (balkan11_medians) C++14
100 / 100
 46 ms 3088 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 200001;

int n;
bool use[MX];
int l, r;
vi ans;

int getFst() {
    while (use[l]) l++;
    use[l] = 1;
    return l;
}

int getLst() {
    while (use[r]) r--;
    use[r] = 1;
    return r;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n; l = 1, r = 2*n-1;
    int lst; cin >> lst; ans.pb(lst); use[lst] = 1;
    F0R(i,n-1) {
        int x; cin >> x;
        if (x == lst) {
            ans.pb(getFst());
            ans.pb(getLst());
        } else if (x < lst) {
            if (use[x]) {
                ans.pb(getFst());
                ans.pb(getFst());
            } else {
                use[x] = 1;
                ans.pb(x);
                ans.pb(getFst());
            }
        } else {
            if (use[x]) {
                ans.pb(getLst());
                ans.pb(getLst());
            } else {
                use[x] = 1;
                ans.pb(x);
                ans.pb(getLst());
            }
        }
        lst = x;
    }
    for (int i: ans) cout << i << " ";
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 2 ms 500 KB Output is correct
5 Correct 2 ms 500 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 2 ms 632 KB Output is correct
8 Correct 3 ms 632 KB Output is correct
9 Correct 3 ms 632 KB Output is correct
10 Correct 2 ms 632 KB Output is correct
11 Correct 4 ms 632 KB Output is correct
12 Correct 3 ms 700 KB Output is correct
13 Correct 3 ms 700 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 700 KB Output is correct
2 Correct 4 ms 700 KB Output is correct
3 Correct 7 ms 884 KB Output is correct
4 Correct 12 ms 1052 KB Output is correct
5 Correct 14 ms 1436 KB Output is correct
6 Correct 23 ms 2200 KB Output is correct
7 Correct 46 ms 3088 KB Output is correct