Submission #644252

#	Time	Username	Problem	Language	Result	Execution time	Memory
644252		ghostwriter	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	100 / 100	1904 ms	196272 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
    Tran The Bao
    VOI23 gold medal
*/
const int oo = 2e9 + 5;
const int T = 4e6 + 5;
const int N = 1e6 + 5;
int n, m, w[N], k[N], Max[N][20], LOG[N], ans[N], tr[T], la[T];
vpi d[N];
deque<int> d1;
int get(int l, int r) {
	if (l > r) return -oo;
	int len = LOG[r - l + 1];
	return max(Max[l][len], Max[r - (1 << len) + 1][len]);
}
int lbound(int i, int l, int r, int q) {
	if (l == r) return l;
	int mid = l + (r - l) / 2;
	int pos = tr[i * 2], v = w[pos] + get(mid, pos - 1);
	if (v < 0 || v < w[q] + get(mid, q)) return lbound(i * 2, l, mid, q);
	return lbound(i * 2 + 1, mid + 1, r, q);
}
void lazy(int i, int l, int r) {
	if (!la[i]) return;
	tr[i] = la[i];
	if (l != r) {
		la[i * 2] = la[i];
		la[i * 2 + 1] = la[i];
	}
	la[i] = 0;
}
void upd(int i, int l, int r, int ql, int qr, int v) {
	lazy(i, l, r);
	if (r < ql || l > qr) return;
	if (ql <= l && r <= qr) {
		la[i] = v;
		lazy(i, l, r);
		return;
	}
	int mid = l + (r - l) / 2;
	upd(i * 2, l, mid, ql, qr, v);
	upd(i * 2 + 1, mid + 1, r, ql, qr, v);
	tr[i] = tr[i * 2 + 1];
}
int get(int i, int l, int r, int q) {
	lazy(i, l, r);
	if (r < q || l > q) return 0;
	if (l == r) return tr[i];
	int mid = l + (r - l) / 2;
	return get(i * 2, l, mid, q) + get(i * 2 + 1, mid + 1, r, q);
}
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
    cin >> n >> m;
    FOR(i, 1, n) {
    	cin >> w[i];
    	Max[i][0] = w[i];
    	LOG[i] = log2(i);
    }
    FOR(j, 1, 19)
    FOR(i, 1, n) {
    	if (i + (1 << j) - 1 > n) continue;
    	Max[i][j] = max(Max[i][j - 1], Max[i + (1 << (j - 1))][j - 1]);
    }
    FOR(i, 1, m) {
    	int l, r;
    	cin >> l >> r >> k[i];
    	d[r].pb({l, i});
    }
    FOR(i, 1, n << 2) tr[i] = 1;
    w[0] = oo;
    d1.pb(0);
    FOR(i, 2, n) {
    	WHILE(w[d1.bk()] <= w[i]) d1._pb();
    	int l = lbound(1, 1, n, i), r = d1.bk();
    	d1.pb(i);
    	if (l <= r) upd(1, 1, n, l, r, i);
    	EACH(j, d[i]) {
    		int l = j.st, id = j.nd;
    		int pos = get(1, 1, n, l);
    		ans[id] = w[pos] + get(l, pos - 1);
    	}
    }
    // FOR(i, 1, m) {
    // 	debug(i, ans[i]);
    // }
    FOR(i, 1, m) cout << (ans[i] <= k[i]? 1 : 0) << '\n';
    return 0;
}
/*
*/
/*
From Benq:
    stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH
*/

Compilation message (stderr)

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:30:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
sortbooks.cpp:93:5: note: in expansion of macro 'FOR'
   93 |     FOR(i, 1, n) {
      |     ^~~
sortbooks.cpp:30:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
sortbooks.cpp:98:5: note: in expansion of macro 'FOR'
   98 |     FOR(j, 1, 19)
      |     ^~~
sortbooks.cpp:30:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
sortbooks.cpp:99:5: note: in expansion of macro 'FOR'
   99 |     FOR(i, 1, n) {
      |     ^~~
sortbooks.cpp:30:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
sortbooks.cpp:103:5: note: in expansion of macro 'FOR'
  103 |     FOR(i, 1, m) {
      |     ^~~
sortbooks.cpp:30:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
sortbooks.cpp:108:5: note: in expansion of macro 'FOR'
  108 |     FOR(i, 1, n << 2) tr[i] = 1;
      |     ^~~
sortbooks.cpp:30:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
sortbooks.cpp:111:5: note: in expansion of macro 'FOR'
  111 |     FOR(i, 2, n) {
      |     ^~~
sortbooks.cpp:32:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   32 | #define EACH(i, x) for (auto &(i) : (x))
      |                               ^
sortbooks.cpp:116:6: note: in expansion of macro 'EACH'
  116 |      EACH(j, d[i]) {
      |      ^~~~
sortbooks.cpp:30:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
sortbooks.cpp:125:5: note: in expansion of macro 'FOR'
  125 |     FOR(i, 1, m) cout << (ans[i] <= k[i]? 1 : 0) << '\n';
      |     ^~~

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