제출 #338311

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
338311		IZhO_2021_I_want_Silver	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	0 / 100	1291 ms	65016 KiB

sortbooks

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <cassert>
#include <stack>
#include <queue>
#include <deque>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

// template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//  order_of_key (k) : Number of items strictly smaller than k .
//  find_by_order(k) : K-th element in a set (counting from zero).
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define show(a) cerr << #a <<" -> "<< a <<" "
#define nl cerr <<"\n"
//#define int ll

const int N = (1 << 20) - 1;

int n, m, a[N], ans[N], t[N*2];
vector < pair <int, pii> > que[N];
stack <int> st;

void upd(int pos, int x) {
    pos += N;
    t[pos] = max(t[pos], x);
    while ((pos /= 2) >= 1) {
        t[pos] = max(t[pos*2], t[pos*2+1]);
    }
}

int get(int l, int r) {
    int res = 0;
    for (l += N, r += N; l <= r; l /= 2, r /= 2) {
        if (l % 2 == 1) { res = max(res, t[l++]); }
        if (r % 2 == 0) { res = max(res, t[r--]); }
        if (l > r) { break; }
    }
    return res;
}

void solve() {
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
    }
    for (int i = 1; i <= m; ++i) {
        int l, r, k;
        cin >> l >> r >> k;
        que[r].pb({l, {k, i}});
    }
    for (int i = 1; i <= n; ++i) {
        while (sz(st) && a[st.top()] < a[i]) { st.pop(); }
        if (sz(st)) { upd(st.top(), a[st.top()] + a[i]); }
        st.push(i);

        for (int j = 0; j < sz(que[i]); ++j) {
            int l = que[i][j].F, k = que[i][j].S.F, id = que[i][j].S.S;
            ans[id] = (get(l, i) <= k);
        }
    }
    for (int i = 1; i <= m; ++i) { cout << ans[i] <<"\n"; }
}

 main () {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int tests = 1;
	//cin >> tests;
	while (tests --) {
		solve();
	}
	return 0;
}
/*
    Just Chalish!
*/

컴파일 시 표준 에러 (stderr) 메시지

sortbooks.cpp:85:8: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   85 |  main () {
      |        ^

• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 30
• Subtask 6: 0 / 23