oj.uz

Submission #997877

# Submission time Handle Problem Language Result Execution time Memory
997877 2024-06-13T04:28:00 Z GrindMachine Editor (BOI15_edi) C++17
35 / 100
 3000 ms 13140 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;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

/*

refs:
https://github.com/dolphingarlic/CompetitiveProgramming/blob/master/Baltic/Baltic%2015-edi.cpp
https://oj.uz/submission/855227

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n; cin >> n;
    vector<ll> a(n+5);
    rep1(i,n) cin >> a[i];

    vector<ll> w(n+5);
    rep1(i,n){
        if(a[i] > 0){
            w[i] = 0;
        }
        else{
            w[i] = abs(a[i]);
        }
    }
 
    vector<ll> par(n+5,-1);
    vector<ll> ans(n+5);

    rep1(i,n){
        ll x = a[i];
        
        {
            ll j = i-1;
            while(j >= 0){
                if(w[i] > w[j]){
                    break;
                }
                j = par[j]-1;
            }

            amax(j,-1ll);
            par[i] = j;
        }

        // rev(j,i-1,0){
        //     if(state[j] and w[i] > w[j]){
        //         par[i] = j;
        //         break;
        //     }
        // }
    
        // {
        //     ll j = i;
        //     while(j != -1){
        //         state[j] ^= 1;
        //         j = par[j];
        //     }
        // }
        
        if(w[i] == 0){
            ans[i] = x;
        }
        else{
            ans[i] = ans[par[i]-1]; 
        }

        cout << ans[i] << endl;
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 388 KB Output is correct
5 Correct 5 ms 612 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 11828 KB Output is correct
2 Correct 36 ms 13140 KB Output is correct

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 5992 KB Output is correct
2 Correct 22 ms 8268 KB Output is correct
3 Execution timed out 3048 ms 9860 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 388 KB Output is correct
5 Correct 5 ms 612 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 36 ms 11828 KB Output is correct
11 Correct 36 ms 13140 KB Output is correct
12 Correct 19 ms 5992 KB Output is correct
13 Correct 22 ms 8268 KB Output is correct
14 Execution timed out 3048 ms 9860 KB Time limit exceeded
15 Halted 0 ms 0 KB -