Submission #524311

#	Time	Username	Problem	Language	Result	Execution time	Memory
524311		AzamatRustamov	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	8 / 100	3066 ms	39204 KiB

sortbooks

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

typedef long long ll;
#define endl '\n'

// pair - sort
//

void solve(int w[], int &n);

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, m;
    cin >> n >> m;

    int w[n+1];
    w[0] = 0;

    for (int i=1; i<=n; i++) cin >> w[i];
    for (int i=0; i<m; i++) solve(w, n);

    return 0;
}

void solve(int w[], int &n)
{
    int l, r, k;
    cin >> l >> r >> k;

    bool can = 1;
    for (int i = l; can && i < r; i++)
        for (int j = i+1; can && j <= r; j++)
            if (w[i]>w[j] && w[i]+w[j]>k)
                can = 0;

    cout << can << endl;
}

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