oj.uz

Submission #497396

# Submission time Handle Problem Language Result Execution time Memory
497396 2021-12-23T04:24:58 Z armashka Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
0 / 100
 4 ms 1868 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); }            

ll n, q, a[5005], dp[5005][5005], t[5005 * 4];

ll get(ll l, ll r, ll v = 1, ll tl = 1, ll tr = n) {
	if (!t[v]) return -1;
	if (r < tl || tr < l) return -1;
	if (tl == tr) return tl;
	ll tm = (tl + tr) / 2;
	ll ans = get(l, r, v + v + 1, tm + 1, tr);
	if (ans == -1) ans = get(l, r, v + v, tl, tm);
	return ans;	
}

void upd(ll pos, ll v = 1, ll tl = 1, ll tr = n) {
	if (tl == tr) {
		t[v] = 1;
		return;
	}
	ll tm = (tl + tr) / 2;
	if(pos <= tm) upd(pos, v + v, tl, tm);
	else upd(pos, v + v + 1, tm + 1, tr);
	t[v] = max(t[v + v], t[v + v + 1]);
}

void clear(ll v = 1, ll tl = 1, ll tr = n) {
	t[v] = 0;
	if (tl == tr) return;
	ll tm = (tl + tr) / 2;
	clear(v + v, tl, tm);
	clear(v + v + 1, tm + 1, tr);
}

const void solve(/*Armashka*/) {
	cin >> n >> q;
	for (int i = 1; i <= n; ++ i) cin >> a[i];
	for (int l = 1; l <= n; ++ l) {
		clear();
		for (int r = l; r <= n; ++ r) {
			dp[l][r] = max(dp[l][r - 1], get(a[r] + 1, n) + a[r]);			
			upd(a[r]);
		}
	}	
	while (q --) {
		ll l, r, k;
		cin >> l >> r >> k;
		if (dp[l][r] <= 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
*/

Compilation message

sortbooks.cpp:3: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    3 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 844 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 844 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 4 ms 460 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 1868 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 844 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 844 KB Output isn't correct
4 Halted 0 ms 0 KB -