제출 #1071612

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1071612		vjudge1	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++98	0 / 100	2556 ms	262144 KiB

sortbooks

// Balgabaev Mansur
#include <bits/stdc++.h>

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
#define pb push_back
#define int long long


using namespace std;

const int N=1e5+7;
const int MOD=1e9+7;
const int INF=1e18;

int binpow (int a, int n) {
	if (n == 0)
		return 1;
	if (n % 2 == 1)
		return binpow (a, n-1) * a;
	else {
		int b = binpow (a, n/2);
		return b * b;
	}
}

int a[N],nxt[5005][5005];

void solve(){
	int n,m;
	cin >> n >> m;
	for(int i = 1 ; i <= n ; i++){
		cin >> a[i];
	}
	for(int i = 1 ; i < n ; i++){
		nxt[i][i]=a[i];
		for(int j = i+1 ; j <= n ; j++){
			nxt[i][j]=min(nxt[i][j-1],a[j]);
		}
	}
	while(m--){
		int l,r,k;
		bool ok=false;
		cin >> l >> r >> k;
		for(int i = l ; i <= r ; i++){
			if(a[i]+nxt[i][r] > k){
				cout << 0 << '\n';
				ok=true;
				break;
			}
		}
		if(!ok){
			cout << 1 << '\n';
		}
	}
}	
 
signed main() {
   // freopen("closing.in", "r", stdin);
   // freopen("closing.out", "w", stdout);
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int test = 1,cntx=1;
    //cin >> test;
    while (test--) {
	//cout << "Case " << 	cntx << ':' << '\n';
        solve();
        cntx++;
	}		
    return 0;
}

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