Submission #168775

#	Time	Username	Problem	Language	Result	Execution time	Memory
168775		ptreap	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	8 / 100	3042 ms	10112 KiB

sortbooks

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <string>
#include <cmath>
#include <iomanip>
#include <stdio.h>
#include <ctime>
#include <fstream>
#include <chrono>
#define _GLIBCXX_DEBUG
#define int long long
#define double long double
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)x.size()
#define pb push_back;
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("fast-math")
#pragma GCC optimize "-O3"
typedef int supertype;


using namespace std;


void solve() {
    int n, q;
    cin >> n >> q;
    vector <int> w(n);
    for (int i = 0; i < n; i++) {
        cin >> w[i];
    }
    for (int qq = 0; qq < q; qq++) {
        int l, r, k;
        cin >> l >> r >> k;
        l--, r--;
        int mx = 0;
        for (int i = l; i <= r && mx <= k; i++) {
            for (int j = i + 1; j <= r && mx <= k; j++) {
                if (w[i] > w[j])
                    mx = max(mx, w[i] + w[j]);
            }
        }
        if (mx > k)
            cout << 0 << endl;
        else
            cout << 1 << endl;
    }
}


signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    srand(time(NULL));
    //freopen("sort.in", "r", stdin);
    //freopen("sort.in", "r", stdin);

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

    return 0;
}


/*

*/

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