oj.uz

답안 #497615

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
497615 2021-12-23T11:27:14 Z armashka Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
0 / 100
 1228 ms 61816 KB 
#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); }            
 
struct node {
	ll ans, mx, mn;
};

ll n, m, a[N];
node t[N * 4];

void build(ll v = 1, ll tl = 1, ll tr = n) {
	if (tl == tr) {
		t[v] = {a[tl], a[tl], 0};
		return;
	}
	ll tm = (tl + tr) / 2;
	build(v + v, tl, tm);
	build(v + v + 1, tm + 1, tr);
	t[v].mx = max(t[v + v].mx, t[v + v + 1].mx);
	t[v].mn = min(t[v + v].mn, t[v + v + 1].mn);
	t[v].ans = max({t[v + v].ans, t[v + v + 1].ans});
	if (t[v + v].mx > t[v + v + 1].mn) t[v].ans = max({t[v].ans, t[v + v].mx + t[v + v + 1].mn});
}

node get(ll l, ll r, ll v = 1, ll tl = 1, ll tr = n) {
	if (r < tl || tr < l) return {-1, -1, -1};
	if (l <= tl && tr <= r) return t[v];
	ll tm = (tl + tr) / 2;                  
	node le = get(l, r, v + v, tl, tm), ri = get(l, r, v + v + 1, tm + 1, tr);
	if (le.mx != -1 && ri.mn != -1 && le.mx > ri.mn) {
		ll res = max({le.ans, ri.ans, le.mx + ri.mn});
		if (res == le.ans) return le;
		if (res == ri.ans) return ri;
		return {res, max(le.mx, ri.mx), min(le.mn, ri.mn)};
	}
	if (le.mx != -1 && ri.mn == -1) {
		return le;
	}
	if (le.mx == -1 && ri.mx == -1) {
		return ri;
	}
	ll res = max({le.ans, ri.ans});
	if (res == le.ans) return le;
	return ri;
}

const void solve(/*Armashka*/) {
	cin >> n >> m;
	for (int i = 1; i <= n; ++ i) cin >> a[i];
	build();
	while (m -- ) {
		ll l, r, k;
		cin >> l >> r >> k;
		if (get(l, r).ans <= k) cout << "1\n";
		else cout << "0\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
*/

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 320 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 1 ms 332 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 320 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 1 ms 332 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1228 ms 61816 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 88 ms 9372 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 320 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 1 ms 332 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 320 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 1 ms 332 KB Output isn't correct
4 Halted 0 ms 0 KB -