Submission #1235999

#	Time	Username	Problem	Language	Result	Execution time	Memory
1235999		thunopro	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	17 / 100	3097 ms	102824 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;

#define FastIO ios_base::sync_with_stdio(0);cin.tie(nullptr);
#define MULTEST int t;cin >> t;while (t--) solve();
#define rf(__abc__) freopen(__abc__".inp","r",stdin);freopen(__abc__".out","w",stdout);

const int mod = 1e9 + 7;

long long pw(long long x,long long y) {
    if (y == 0) return 1;
    if (y % 2 == 0) {
        long long a = pw(x,y/2);
        return a*a%mod;
    } else {
        long long a = pw(x,y - 1);
        return a*x%mod;
    }
}

int add(int x,int y) {
    x += y;
    if (x >= mod) x -= mod;
    return x;
}

int subtract(int x,int y) {
    x -= y;
    if (x < 0) x += mod;
    return x;
}

int mul(long long x,int y) {
    x *= y;
    if (x >= mod) x %= mod;
    return x;
}
///Code goes here
int n,m,arr[1000009];
int maxval[5009][5009];
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);
//	freopen(".inp", "r", stdin);
//	freopen(".out", "w", stdout);
	cin >> n >> m;
	for (int i = 1;i <= n;i++) cin >> arr[i];
	for (int i = 1;i <= n;i++) {
		int maxvalue = arr[i];
		for (int j = i + 1;j <= n;j++) {
			maxval[i][j] = maxval[i][j - 1];
			if (maxvalue > arr[j]) maxval[i][j] = max(maxval[i][j],arr[j] + maxvalue);
			else maxvalue = arr[j];
		}
	}
	while (m--) {
		int l,r,k;cin >> l >> r >> k;
		cout << (maxval[l][r] <= k) << '\n';
	}
}

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