제출 #335837

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
335837		tengiz05	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	0 / 100	3067 ms	2796 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
const int mod = 1e9+7, N = 2e5+5;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val);}
int a[N], n, m, k;
int t[N*2];
int get(int l, int r){
	int mn = -mod;
	for(l += n, r+= n; l <= r; l>>=1, r>>=1){
		if(l % 2 == 1)mn = max(mn, t[l++]);
		if(r % 2 == 0)mn = max(mn, t[r--]);
	}return mn;
}
void solve(int test_case){
	int i, j, q;
	cin >> n >> q;
	for(i=0;i<n;i++){
		cin >> a[i];
		t[i+n] = a[i];
	}for(i=n-1;i>0;i--)t[i] = min(t[i*2], t[i*2+1]);
	while(q--){
		int l, r;
		bool is = true;
		cin >> l >> r >> k;
		l--,r--;
		for(i=l+1;i<=r;i++){
			int mx = get(l,i-1);
		//	cout << l << ' ' << i-1 << ' ' << mx << '\n';
			if(mx > a[i] && a[i]+mx > k){
				is = false;
			}
		}
		if(is){
			cout << 1 << '\n';
		}else {
			cout << 0 << '\n';
		}
	}
	return;
}

signed main(){
	FASTIO;
#define MULTITEST 0
#if MULTITEST
	int ___T;
	cin >> ___T;
	for(int T_CASE = 1; T_CASE <= ___T; T_CASE++)
		solve(T_CASE);
#else
	solve(1);
#endif
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

sortbooks.cpp: In function 'void solve(long long int)':
sortbooks.cpp:24:9: warning: unused variable 'j' [-Wunused-variable]
   24 |  int i, j, q;
      |         ^

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