oj.uz

답안 #59759

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
59759 2018-07-23T05:05:05 Z Benq Swap (BOI16_swap) C++11
0 / 100
 2 ms 376 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, lo[MX], hi[MX], pos[MX], ans[MX];

void setLink(int x, int y) {
    hi[x] = y, lo[y] = x;
}

int qmin(int x) {
    if (x > n) return MOD;
    if (!ans[x]) return x;
    return min(qmin(2*x),qmin(2*x+1));
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n;
    FOR(i,1,n+1) {
        int x; cin >> x;
        pos[x] = i;
    }
    FOR(i,1,n+1) lo[i] = hi[i] = i;
    FOR(i,1,n+1) {
        if (pos[i] > 1 && !ans[pos[i]/2]) {
            ans[pos[i]/2] = i;
            setLink(pos[i]/2,hi[pos[i]]);
            continue;
        }
        if (!ans[pos[i]]) {
            ans[pos[i]] = i;
            continue;
        }
        int x = qmin(pos[i]);
        int y = hi[pos[i]];
        if (y <= x) {
            ans[y] = i;
        } else {
            setLink(lo[x],y);
            ans[x] = i;
        }
    }
    FOR(i,1,n+1) cout << ans[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
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -