oj.uz

답안 #784508

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
784508 2023-07-16T07:36:49 Z GrindMachine popa (BOI18_popa) C++17
61 / 100
 133 ms 364 KB 
// Om Namah Shivaya

#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) 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(x) 42
#endif

/*



*/

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

#include "popa.h"

vector<int> lx(N), rx(N);

int solve(int l, int r, int *left, int *right){
    if(l > r) return -1;

    for(int i = l; i <= r; ++i){
        if(lx[i] <= l and rx[i] >= r){
            left[i] = solve(l,i-1,left,right);
            right[i] = solve(i+1,r,left,right);
            return i;
        }
    }

    assert(0);
    return -1;
}

int solve(int n, int *left, int *right){
    stack<int> st;
    rep(i,n) lx[i] = 0, rx[i] = n-1;

    rep(i,n){
        while(!st.empty()){
            int j = st.top();
            // si < sj?
            if(query(i,i,j,i) and !query(i,i,j,j)){
                rx[j] = i-1;
                st.pop();
            }
            else{
                lx[i] = j+1;
                break;
            }
        }

        st.push(i);
    }

    return solve(0,n-1,left,right);
}

Subtask #1
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 208 KB Output is correct
2 Correct 13 ms 304 KB Output is correct
3 Correct 10 ms 208 KB Output is correct
4 Correct 8 ms 208 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 75 ms 360 KB Output is correct
2 Correct 133 ms 364 KB Output is correct
3 Correct 78 ms 348 KB Output is correct
4 Correct 133 ms 300 KB Output is correct

Subtask #3
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 284 KB too many queries
2 Halted 0 ms 0 KB -