Submission #548959

#	Time	Username	Problem	Language	Result	Execution time	Memory
548959		Bungmint	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	100 / 100	2520 ms	262144 KiB

sortbooks

//Copyright © 2022 Youngmin Park. All rights reserved.
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
using vpi = vector<pii>;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vpl = vector<pll>;
using ld = long double;
template <typename T, size_t SZ>
using ar = array<T, SZ>;

#define all(v) (v).begin(), (v).end()
#define pb push_back
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
#define REP(a) F0R(_, a)

const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7; //998244353;
const ld PI = acos((ld)-1.0);
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T>
using pqg = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template <typename T>
bool ckmax(T &a, const T &b) { return b > a ? a = b, 1 : 0; }

template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p)
{
    return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v)
{
    os << '{';
    string sep;
    for (const T &x : v)
        os << sep << x, sep = ", ";
    return os << '}';
}
void dbg_out()
{
    cerr << endl;
}
template <typename Head, typename... Tail>
void dbg_out(Head H, Tail... T)
{
    cerr << ' ' << H;
    dbg_out(T...);
}
#ifdef LOCAL
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...) 42
#endif

inline namespace RecursiveLambda{
	template <typename Fun>
	struct y_combinator_result{
		Fun fun_;
		template <typename T> 
		explicit y_combinator_result(T &&fun): fun_(forward<T>(fun)){}
		template <typename...Args>
		decltype(auto) operator()(Args &&...args){
			return fun_(ref(*this), forward<Args>(args)...);
		}
	};
	template <typename Fun>
	decltype(auto) y_combinator(Fun &&fun){
		return y_combinator_result<decay_t<Fun>>(forward<Fun>(fun));
	}
};

void setIO(string s) // USACO
{
	#ifndef LOCAL
	    freopen((s + ".in").c_str(), "r", stdin);
	    freopen((s + ".out").c_str(), "w", stdout);
	#endif
}

const int N = 1e6 + 1;
pii jump[20][N]; // 160 MB
int a[20][N];

int query(int l, int r) {
	if (l > r) return 0;
	int lg = 31 - __builtin_clz(r - l + 1);
	return max(a[lg][l], a[lg][r - (1 << lg) + 1]);
}
int go(int l, int r) {
	int res = 0;
	R0F(i, 20) {
		auto [nxt, v] = jump[i][l];
		if (nxt <= r) {
			l = nxt;
			res = max(res, v);
		}
	}
	if (l != r) {
		res = max(res, query(l + 1, r) + a[0][l]);
	}
	return res;
}

void solve()
{
	int n, m;
	cin >> n >> m;
	F0R(i, n) cin >> a[0][i];
	FOR(j, 1, 20) {
		for (int i = 0; i + (1 << j) <= n; i++) {
			a[j][i] = max(a[j - 1][i], a[j - 1][i + (1 << (j - 1))]);
		}
	}
	stack<int> st;
	F0R(i, 20) jump[i][n] = {n, 0};
	R0F(i, n) {
		while (sz(st) && a[0][st.top()] < a[0][i]) st.pop();
		jump[0][i].fi = (sz(st) ? st.top() : n);
		jump[0][i].se = query(i + 1, jump[0][i].fi - 1);
		if (jump[0][i].se) jump[0][i].se += a[0][i];
		dbg(jump[0][i]);
		st.push(i);
		FOR(j, 1, 20) {
			auto [nxt, v] = jump[j - 1][i];
			jump[j][i].fi = jump[j - 1][nxt].fi;
			jump[j][i].se = max(v, jump[j - 1][nxt].se);
		}
	}
	REP(m) {
		int l, r, k;
		cin >> l >> r >> k;
		l--, r--;
		int z = go(l, r);
		cout << (z <= k) << '\n';
	}
}

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    int testcase=1;
    // cin >> testcase;
    while (testcase--)
    {
        solve();
    }
}

Compilation message (stderr)

sortbooks.cpp: In function 'void solve()':
sortbooks.cpp:71:18: warning: statement has no effect [-Wunused-value]
   71 | #define dbg(...) 42
      |                  ^~
sortbooks.cpp:140:3: note: in expansion of macro 'dbg'
  140 |   dbg(jump[0][i]);
      |   ^~~
sortbooks.cpp: In function 'void setIO(std::string)':
sortbooks.cpp:94:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   94 |      freopen((s + ".in").c_str(), "r", stdin);
      |      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sortbooks.cpp:95:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   95 |      freopen((s + ".out").c_str(), "w", stdout);
      |      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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