oj.uz

답안 #784454

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
784454 2023-07-16T06:48:07 Z GrindMachine popa (BOI18_popa) C++17
61 / 100
 298 ms 460 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 = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "popa.h"

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

    int lo = l, hi = r;
    int pos = -1;

    while(lo <= hi){
        int mid = (lo+hi) >> 1;
        if(query(l,mid,l,r)){
            pos = mid;
            hi = mid-1;
        }
        else{
            lo = mid+1;
        }
    } 

    assert(pos != -1);

    left[pos] = solve(l,pos-1,left,right);
    right[pos] = solve(pos+1,r,left,right);
    return pos;
}

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

Subtask #1
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 208 KB Output is correct
2 Correct 18 ms 300 KB Output is correct
3 Correct 4 ms 208 KB Output is correct
4 Correct 17 ms 208 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 235 ms 364 KB Output is correct
2 Correct 298 ms 444 KB Output is correct
3 Correct 116 ms 460 KB Output is correct
4 Correct 153 ms 364 KB Output is correct

Subtask #3
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 18 ms 412 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -