oj.uz

답안 #563352

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
563352 2022-05-17T02:40:17 Z tranxuanbach Swap (BOI16_swap) C++17
100 / 100
 74 ms 8684 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define endl '\n'
#define fi first
#define se second
#define For(i, l, r) for (auto i = l; i < r; i++)
#define ForE(i, l, r) for (auto i = l; i <= r; i++)
#define FordE(i, l, r) for (auto i = l; i >= r; i--)
#define Fora(v, a) for (auto v: a)
#define bend(a) a.begin(), a.end()
#define isz(a) ((signed)a.size())

using ll = long long;
using ld = long double;
using pii = pair <int, int>;
using vi = vector <int>;
using vpii = vector <pair <int, int>>;
using vvi = vector <vector <int>>;

const int N = 2e5 + 5;

bool debug = 0;

int n;
int a[N];

int ans[N];

int willgoup[N];
int b[N]; // b[i] will go up and stay at i

int valdfs[N]; bool changedfs[N];

int dfs(int i){ // find the lowest index if start at i
    if (debug) cout << "dfs " << i << endl;
    if (!changedfs[i]){
        return valdfs[i];
    }
    changedfs[i] = 0;
    if (b[i] == -1 or b[i] == 0){
        return (valdfs[i] = i);
    }
    if (willgoup[i * 2] == 1){
        return (valdfs[i] = dfs(i * 2));
    }
    if (willgoup[i * 2] == 0){
        return (valdfs[i] = dfs(i * 2 + 1));
    }
    return (valdfs[i] = min(dfs(i * 2), dfs(i * 2 + 1)));
}

void dfs_assign(int i, int j){
    if (debug) cout << "dfs_assign " << i << ' ' << j << endl;
    changedfs[i] = 1;
    if (i == j){
        if (i * 2 <= n){
            willgoup[i * 2] = 0;
        }
        if (i * 2 + 1 <= n){
            willgoup[i * 2 + 1] = 0;
        }
        b[i] = -1;
        return;
    }
    if (willgoup[i * 2] == 1){
        dfs_assign(i * 2, j);
        return;
    }
    if (willgoup[i * 2] == 0){
        dfs_assign(i * 2 + 1, j);
        return;
    }
    if (valdfs[i * 2] == j){
        willgoup[i * 2] = 1;
        dfs_assign(i * 2, j);
    }
    else{
        willgoup[i * 2] = 0;
        dfs_assign(i * 2 + 1, j);
    }
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    // freopen("KEK.inp", "r", stdin);
    // freopen("KEK.out", "w", stdout);
    cin >> n;
    ForE(i, 1, n){
        cin >> a[i];
    }
    
    ForE(i, 1, n){
        willgoup[i] = -1;
        b[i] = -1;
        changedfs[i] = 1;
    }
    willgoup[1] = 0;
    
    vpii aa;
    ForE(i, 1, n){
        aa.emplace_back(a[i], i);
    }
    sort(bend(aa));
    
    Fora(elem, aa){
        int val, idx; tie(val, idx) = elem;
        if (debug) cout << "elem " << val << ' ' << idx << endl;
        if (willgoup[idx] != 0 and b[idx / 2] == -1){
            if (debug) cout << "fix up " << endl;
            willgoup[idx] = 1;
            if (idx % 2 == 0){
                willgoup[idx + 1] = 0;
            }
            b[idx / 2] = idx;
            ans[idx / 2] = val;
            int u = idx;
            while (u != 1){
                changedfs[u] = 1; u /= 2;
            }
            changedfs[u] = 1;
            u = idx + 1;
            while (u != 1){
                changedfs[u] = 1; u /= 2;
            }
            changedfs[u] = 1;
            continue;
        }
        int pos = n + 1, u = -1;
        if (willgoup[idx] != 1){
            int tpos = dfs(idx);
            if (debug) cout << "case 1 " << tpos << endl;
            if (pos > tpos){
                pos = tpos;
                u = idx;
            }
        }
        if (idx % 2 == 0 and willgoup[idx] != 0){
            int tpos = dfs(idx + 1);
            if (debug) cout << "case 2 " << tpos << endl;
            if (pos > tpos){
                pos = tpos;
                u = idx + 1;
            }
        }
        if (debug) cout << "ans " << pos << endl;
        ans[pos] = val;
        if (u == idx){
            willgoup[idx] = 0;
        }
        else{
            willgoup[idx] = 1;
        }
        dfs_assign(u, pos);
        while (u != 1){
            changedfs[u] = 1; u /= 2;
        }
        changedfs[u] = 1;
    }
    ForE(i, 1, n){
        cout << ans[i] << ' ';
    } cout << endl;
}

/*
==================================================+
INPUT:                                            |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
OUTPUT:                                           |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
*/

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 16 ms 2388 KB Output is correct
17 Correct 17 ms 2496 KB Output is correct
18 Correct 14 ms 2356 KB Output is correct
19 Correct 12 ms 2476 KB Output is correct
20 Correct 18 ms 2412 KB Output is correct

Subtask #5
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 16 ms 2388 KB Output is correct
17 Correct 17 ms 2496 KB Output is correct
18 Correct 14 ms 2356 KB Output is correct
19 Correct 12 ms 2476 KB Output is correct
20 Correct 18 ms 2412 KB Output is correct
21 Correct 74 ms 8672 KB Output is correct
22 Correct 67 ms 8652 KB Output is correct
23 Correct 66 ms 8684 KB Output is correct
24 Correct 65 ms 8640 KB Output is correct
25 Correct 48 ms 8640 KB Output is correct