#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;
//#pragma GCC optimization("g", on)
//#pragma GCC optimization("03")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("inline")
//#pragma GCC optimize("-fgcse,-fgcse-lm")
//#pragma GCC optimize("-ftree-pre,-ftree-vrp")
//#pragma GCC optimize("-ffast-math")
//#pragma GCC optimize("-fipa-sra")
//#pragma GCC optimize("-fpeephole2")
//#pragma GCC optimize("-fsched-spec")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("unroll-loops")
#define aboba ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define br break;
#define sp " "
#define en "\n"
#define pb push_back
#define sz size()
#define bg begin()
#define ed end()
#define in insert
#define ss second
#define ff first
#define setp(a) cout << fixed; cout << setprecision(a);
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef double db;
typedef tree<
long long,
null_type,
less_equal<long long>,
rb_tree_tag,
tree_order_statistics_node_update> orset;
void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
ll bp(ll x, ll y, ll z) { ll res = 1; while (y) { if (y & 1) { res = (res * x) % z; y--; } x = (x * x) % z; y >>= 1; } return res; }
// C(n, k) = ((fact[n] * bp(fact[k], mod - 2)) % mod * bp(fact[n - k], mod - 2)) % mod;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll lcm(ll a, ll b) { return (a / __gcd(a, b)) * b; }
const ll N = 1e6 + 11;
const ll inf = 1e9 + 7;
ll tt = 1;
ll a[N];
vector<pair<pll, ll>> g[N];
ll ans[N];
ll t[N * 4];
void upd(ll v, ll tl, ll tr, ll pos, ll x) {
if (tl == tr) {
t[v] = x;
return;
}
ll tm = (tl + tr) / 2;
if (pos <= tm) upd(v * 2, tl, tm, pos, x);
else upd(v * 2 + 1, tm + 1, tr, pos, x);
t[v] = max(t[v * 2], t[v * 2 + 1]);
}
ll get(ll v, ll tl, ll tr, ll l, ll r) {
if (r < tl || tr < l) return 0;
if (l <= tl && tr <= r) return t[v];
ll tm = (tl + tr) / 2;
return max(get(v * 2, tl, tm, l, r), get(v * 2 + 1, tm + 1, tr, l, r));
}
void solve() {
ll n, m; cin >> n >> m;
for (int i = 1;i <= n;i++) {
cin >> a[i];
}
for (int i = 1;i <= m;i++) {
ll l, r, x; cin >> l >> r >> x;
g[r].pb({{l, x}, i});
}
stack<ll> st;
for (int i = 1;i <= n;i++) {
while (!st.empty() && st.top() <= a[i]) st.pop();
ll x = (st.empty() ? 0 : st.top());
st.push(a[i]);
// cout << x << en;
upd(1, 1, n, i, x);
for (auto to : g[i]) {
ll l = to.ff.ff, x = to.ff.ss;
ans[to.ss] = (get(1, 1, n, l, i) <= x);
}
}
for (int i = 1;i <= m;i++) {
cout << ans[i] << en;
}
}
int main() {
aboba
// freopen("cownomics");
// precalc();
// cin >> tt;
for (int i = 1;i <= tt;i++) {
solve();
}
}
Compilation message
sortbooks.cpp: In function 'void freopen(std::string)':
sortbooks.cpp:47:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
47 | void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sortbooks.cpp:47:75: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
47 | void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 ms |
29020 KB |
Output is correct |
| 2 |
Correct |
10 ms |
29020 KB |
Output is correct |
| 3 |
Incorrect |
10 ms |
29020 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 ms |
29020 KB |
Output is correct |
| 2 |
Correct |
10 ms |
29020 KB |
Output is correct |
| 3 |
Incorrect |
10 ms |
29020 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1244 ms |
121932 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
78 ms |
36752 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 ms |
29020 KB |
Output is correct |
| 2 |
Correct |
10 ms |
29020 KB |
Output is correct |
| 3 |
Incorrect |
10 ms |
29020 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 ms |
29020 KB |
Output is correct |
| 2 |
Correct |
10 ms |
29020 KB |
Output is correct |
| 3 |
Incorrect |
10 ms |
29020 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
