제출 #1311787

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1311787		hasan	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	0 / 100	1592 ms	17920 KiB

sortbooks

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

#define endl '\n'
#define int int_fast32_t
#define ul uint_fast32_t
#define ll int_fast64_t
#define dll long double
#define ull uint_fast64_t
#define spektar this_thread::sleep_for(chrono::milliseconds(50))

void solve(){
    int n,m;
    cin >> n >> m;
    vector<int> k(n);
    for(auto& i:k) cin >> i;
    vector<int> k1=k;
    sort(k1.begin(),k1.end());
    for(int i=0; i<m; i++){
        int a,b,c;
        cin >> a >> b >> c;
        if(c<k1[0]){
            cout << 0 << endl;
            continue;
        }
        int max1=0;
        int min1=1000000000;
        for(int j=a-1; j<=b-1; j++){
            max1=max(max1,k[j]);
            min1=min(min1,k[j]);
        }
        if(a==b){
            if(k[a-1]>c) cout << 0 << endl;
            else cout << 1 << endl;
        }
        else if(max1+min1>c) cout << 0 << endl;
        else cout << 1 << endl;
    }
}

signed main(){
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int t=1;
    //cin >> t;
    while(t--){
        solve();
    }
}

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