Submission #497879

#TimeUsernameProblemLanguageResultExecution timeMemory
497879armashkaHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
100 / 100
1378 ms124916 KiB
#include <bits/stdc++.h> //#pragma comment(linker, "/stack:200000000") //#pragma GCC optimize("Ofast") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr); #define all(v) v.begin(),v.end() #define pb push_back #define sz size() #define ft first #define sd second using namespace std; typedef long long ll; typedef pair<ll, ll> pll; typedef unsigned long long ull; const int N = 1e6 + 5; const ll M = 1e8; const ll inf = 1e18; const ll mod = 1e9; const double Pi = acos(-1); ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;} ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;} ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); } bool odd(ll n) { return (n % 2 == 1); } bool even(ll n) { return (n % 2 == 0); } ll n, m, a[N], t[N * 4], ans[N]; vector <pair<pll, ll>> q[N]; vector <ll> v; void upd(ll pos, ll val, ll v = 1, ll tl = 1, ll tr = n) { if (tl == tr) { t[v] = val; return; } ll tm = (tl + tr) / 2; if (pos <= tm) upd(pos, val, v + v, tl, tm); else upd(pos, val, v + v + 1, tm + 1, tr); t[v] = max(t[v + v], t[v + v + 1]); } ll get(ll l, ll r, ll v = 1, ll tl = 1, ll tr = n) { if (r < tl || tr < l) return 0; if (l <= tl && tr <= r) return t[v]; ll tm = (tl + tr) / 2; return max(get(l, r, v + v, tl, tm), get(l, r, v + v + 1, tm + 1, tr)); } const void solve(/*Armashka*/) { cin >> n >> m; for (int i = 1; i <= n; ++ i) cin >> a[i]; for (int i = 1; i <= m; ++ i) { ll l, r, k; cin >> l >> r >> k; q[r].pb({{l, k}, i}); } v.pb(0); for (int i = 1; i <= n; ++ i) { while (v.back() > 0 && a[v.back()] <= a[i]) v.pop_back(); if (v.back() > 0) upd(v.back(), a[v.back()] + a[i]); v.pb(i); while (q[i].sz) { ll l = q[i].back().ft.ft, r = i, k = q[i].back().ft.sd, id = q[i].back().sd; q[i].pop_back(); if (get(l, r) <= k) ans[id] = 1; } } for (int i = 1; i <= m; ++ i) cout << ans[i] << "\n"; } signed main() { fast; //freopen("divide.in", "r", stdin); //freopen("divide.out", "w", stdout); int tt = 1; //cin >> tt; while (tt --) { solve(); } } /* 5 4 4 1 2 3 1 3 4 5 3 4 5 2 3 2 1 3 1 1 3 5 2 3 4 5 2 1 3 1 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...