oj.uz

Submission #540260

# Submission time Handle Problem Language Result Execution time Memory
540260 2022-03-19T18:22:15 Z Evang Editor (BOI15_edi) C++17
100 / 100
 73 ms 30224 KB 
#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;

#ifdef _DEBUG
#define dout(x) clog << "Line " << __LINE__ << ": " << #x << "=" << (x) << el
#else
#define dout(x)
#endif

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define uid(a,b) uniform_int_distribution<int>(a,b)(rng)

#define ins insert
#define ssize(x) (int((x).size()))
#define bs(args...) binary_search(args)
#define lb(args...) lower_bound(args)
#define ub(args...) upper_bound(args)
#define all(x) (x).begin(),(x).end()
#define mp(a, b) make_pair(a, b)
#define mt(args...) make_tuple(args)
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second
#define die exit(0)

template<typename T>
using vc = vector<T>;
template<typename T>
using uset = unordered_set<T>;
template<typename A, typename B>
using umap = unordered_map<A, B>;
template<typename T, typename Comp>
using pq = std::priority_queue<T, vc<T>, Comp>;
template<typename T>
using maxpq = pq<T, less<T>>;
template<typename T>
using minpq = pq<T, greater<T>>;
template<typename T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

using db = double;
using ld = long double;
using ll = long long;
using ull = unsigned long long;
using pi = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vc<int>;
using vll = vc<ll>;
using vpi = vc<pi>;
using vpll = vc<pll>;
using str = string;

constexpr char el = '\n';
constexpr char sp = ' ';
constexpr int inf = 0x3f3f3f3f;
constexpr ll llinf = 0x3f3f3f3f3f3f3f3fLL;
// ---------------------------------------------------------------------


const int N = 3e5+5;
const int LG = 20;
int n, a[N], ind[N], up[N][LG];
bitset<N> op;

signed main() {
    ios::sync_with_stdio(0); cin.tie(0);
    cout << fixed; clog << fixed; clog << unitbuf;
#ifdef _DEBUG
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    freopen("debug.txt", "w", stderr);
#else
    //freopen(".in", "r", stdin);
    //freopen(".out", "w", stdout);
#endif

    cin >> n;
    for(int i = 1; i <= n; ++i){
        cin >> a[i];
        if(a[i]<0) {
            op[i] = 1;
            a[i] = abs(a[i]);
            int j = i-1;
            while(op[j]&&a[j]>=a[i])
                j = up[j][0];
            ind[i] = j-1;

            up[i][0] = ind[i];
            while(op[up[i][0]]&&a[up[i][0]]>=a[i])
                up[i][0] = up[up[i][0]][0];
        }else {
            ind[i] = i;
            up[i][0] = i;
        }
    }

    for(int i = 0; i < 20; ++i)
        for(int j = n; j > 0; --j)
            ind[j] = ind[ind[j]];

    for(int i = 1; i <= n; ++i)
        cout << a[ind[i]] << el;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 732 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 852 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 28096 KB Output is correct
2 Correct 63 ms 28236 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 14044 KB Output is correct
2 Correct 39 ms 17612 KB Output is correct
3 Correct 62 ms 22668 KB Output is correct
4 Correct 62 ms 29476 KB Output is correct
5 Correct 73 ms 30196 KB Output is correct
6 Correct 53 ms 27412 KB Output is correct

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 732 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 852 KB Output is correct
10 Correct 63 ms 28096 KB Output is correct
11 Correct 63 ms 28236 KB Output is correct
12 Correct 33 ms 14044 KB Output is correct
13 Correct 39 ms 17612 KB Output is correct
14 Correct 62 ms 22668 KB Output is correct
15 Correct 62 ms 29476 KB Output is correct
16 Correct 73 ms 30196 KB Output is correct
17 Correct 53 ms 27412 KB Output is correct
18 Correct 66 ms 30152 KB Output is correct
19 Correct 62 ms 30004 KB Output is correct
20 Correct 68 ms 28748 KB Output is correct
21 Correct 65 ms 29488 KB Output is correct
22 Correct 69 ms 30224 KB Output is correct