oj.uz

답안 #997875

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
997875 2024-06-13T04:21:31 Z GrindMachine Editor (BOI15_edi) C++17
20 / 100
 3000 ms 11548 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> state(n+5); // 0 = undone, 1 = done
    state[0] = 1;
    vector<ll> par(n+5,-1);
 
    rep1(i,n){
        ll x = a[i];
        
        {
            ll j = i-1;
            while(j >= 0){
                if(state[j] and 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];
            }
        }
        
        ll ans = -1;
        rep(j,i+1){
            if(state[j] and a[j] >= 0){
                ans = a[j];
            }
        }
 
        assert(ans != -1);
        cout << ans << endl;
    }
}

int main()
{
    fastio;

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

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

    return 0;
}

Compilation message

edi.cpp: In function 'void solve(int)':
edi.cpp:83:12: warning: unused variable 'x' [-Wunused-variable]
   83 |         ll x = a[i];
      |            ^

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 11 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 20 ms 644 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 13 ms 660 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 12 ms 604 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3073 ms 11548 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3048 ms 6668 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 11 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 20 ms 644 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 13 ms 660 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 12 ms 604 KB Output is correct
10 Execution timed out 3073 ms 11548 KB Time limit exceeded
11 Halted 0 ms 0 KB -