Submission #876634

# Submission time Handle Problem Language Result Execution time Memory
876634 2023-11-22T06:29:25 Z Irate Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
17 / 100
3000 ms 14468 KB
#include<bits/stdc++.h>
using namespace std;
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, q;
    cin >> n >> q;
    vector<int>v(n);
    for(int i = 0;i < n;++i)cin >> v[i];
    while(q--){
        int l, r, k;
        cin >> l >> r >> k;
        l--;
        r--;
        int mx = v[l], res = 0;
        for(int i = l + 1;i <= r;++i){
            if(mx > v[i]){
                res = max(res, mx + v[i]);
            }
            mx = max(mx, v[i]);
        }
        cout << (res <= k) << '\n';
    }
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 5 ms 348 KB Output is correct
13 Correct 6 ms 588 KB Output is correct
14 Correct 10 ms 600 KB Output is correct
15 Correct 10 ms 604 KB Output is correct
16 Correct 17 ms 348 KB Output is correct
17 Correct 14 ms 348 KB Output is correct
18 Correct 17 ms 520 KB Output is correct
# Verdict Execution time Memory Grader output
1 Execution timed out 3006 ms 14468 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2347 ms 3184 KB Output is correct
2 Execution timed out 3038 ms 2048 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 5 ms 348 KB Output is correct
13 Correct 6 ms 588 KB Output is correct
14 Correct 10 ms 600 KB Output is correct
15 Correct 10 ms 604 KB Output is correct
16 Correct 17 ms 348 KB Output is correct
17 Correct 14 ms 348 KB Output is correct
18 Correct 17 ms 520 KB Output is correct
19 Execution timed out 3057 ms 4792 KB Time limit exceeded
20 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 5 ms 348 KB Output is correct
13 Correct 6 ms 588 KB Output is correct
14 Correct 10 ms 600 KB Output is correct
15 Correct 10 ms 604 KB Output is correct
16 Correct 17 ms 348 KB Output is correct
17 Correct 14 ms 348 KB Output is correct
18 Correct 17 ms 520 KB Output is correct
19 Execution timed out 3006 ms 14468 KB Time limit exceeded
20 Halted 0 ms 0 KB -