Submission #1061632

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1061632	2024-08-16T11:20:08 Z	VMaksimoski008	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	0 / 100	3000 ms	39180 KB

sortbooks

#include <bits/stdc++.h>
//#define int long long

using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;

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

    int n, q;
    cin >> n >> q;

    vector<int> v(n+1);
    for(int i=1; i<=n; i++) cin >> v[i];

    while(q--) {
        int l, r, k;
        cin >> l >> r >> k;
        bool ok = 1;
        for(int i=l+1; i<=r&&ok; i++)
            for(int j=i-1; j<i&&ok; j++)
                if(v[i] + v[j] > k && v[i] < v[j]) ok = 0;
        cout << ok << '\n';
    }

    return 0;
}

Subtask #1
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	392 KB	Output is correct
3	Incorrect	1 ms	348 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #2
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	392 KB	Output is correct
3	Incorrect	1 ms	348 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #3
0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	376 ms	38224 KB	Output is correct
2	Correct	353 ms	39180 KB	Output is correct
3	Correct	380 ms	39116 KB	Output is correct
4	Correct	376 ms	39140 KB	Output is correct
5	Execution timed out	3029 ms	14608 KB	Time limit exceeded
6	Halted	0 ms	0 KB	-