oj.uz

Submission #1058422

# Submission time Handle Problem Language Result Execution time Memory
1058422 2024-08-14T09:55:52 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
17 / 100
 3000 ms 8264 KB 
#include <bits/stdc++.h>
#ifdef LOCAL
    #include "/home/trcmai/code/tools.h"
    #define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
#else
    #define debug(x...)
#endif
using namespace std;
#define all(a) a.begin(), a.end()
#define ll long long
#define endl '\n'
const int N = 1e6 + 6, LOG = 27, MOD = 1e9 + 7;
const ll INF = 1e18;
int n,q; ll a[N];
signed main() {
    cin.tie(0)->sync_with_stdio(0);
    auto solver=[&](){
        cin>>n>>q;
        for(int i = 1;i <= n;++i) cin>>a[i];
        while(q--){
            int l,r,k; cin>>l>>r>>k;
            ll temp = 0,temp2 = a[l];
            for (int i = l + 1; i <= r; i++){
                if (a[i] >= temp2) temp2 = a[i];
                else temp = max(temp, temp2 + a[i]);
            }
            cout<<(temp <= k ? 1 : 0)<<endl;
        }       
    };
    int t = 1; // cin>>t;
    while (t--) solver();
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 8 ms 576 KB Output is correct
13 Correct 5 ms 600 KB Output is correct
14 Correct 14 ms 476 KB Output is correct
15 Correct 14 ms 660 KB Output is correct
16 Correct 18 ms 604 KB Output is correct
17 Correct 11 ms 476 KB Output is correct
18 Correct 9 ms 348 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3044 ms 8264 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1855 ms 3580 KB Output is correct
2 Execution timed out 3034 ms 3528 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 8 ms 576 KB Output is correct
13 Correct 5 ms 600 KB Output is correct
14 Correct 14 ms 476 KB Output is correct
15 Correct 14 ms 660 KB Output is correct
16 Correct 18 ms 604 KB Output is correct
17 Correct 11 ms 476 KB Output is correct
18 Correct 9 ms 348 KB Output is correct
19 Execution timed out 3073 ms 5236 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 8 ms 576 KB Output is correct
13 Correct 5 ms 600 KB Output is correct
14 Correct 14 ms 476 KB Output is correct
15 Correct 14 ms 660 KB Output is correct
16 Correct 18 ms 604 KB Output is correct
17 Correct 11 ms 476 KB Output is correct
18 Correct 9 ms 348 KB Output is correct
19 Execution timed out 3044 ms 8264 KB Time limit exceeded
20 Halted 0 ms 0 KB -