oj.uz

Submission #859783

# Submission time Handle Problem Language Result Execution time Memory
859783 2023-10-10T15:49:59 Z Alfraganus Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
17 / 100
 3000 ms 10784 KB 
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define ll long long
#define all(a) a.begin(), a.end()
#define fastio ios::sync_with_stdio(0), cin.tie(0);
#define fs first
#define ss second

#define print(a)          \
    for (auto x : a)      \
        cout << x << ' '; \
    cout << endl;

#define printmp(a)   \
    for (auto x : a) \
        cout << x.fs << ' ' << x.ss << endl;

void solve()
{
    int n, q;
    cin >> n >> q;
    vector<int> a(n);
    for (int i = 0; i < n; i++)
        cin >> a[i];
    vector<int> dp(n);
    for(int i = 0; i < n - 1; i ++)
        dp[i + 1] = a[i + 1] <= a[i];
    for(int i = 1; i < n; i ++)
        dp[i] += dp[i - 1];
    while (q--)
    {
        int l, r, k;
        cin >> l >> r >> k;
        bool flag = 1;
        l--;
        r--;
        if(a[l] > k and a[r] > k and dp[l] == dp[r]){
            cout << 1 << endl;
            continue;
        }
        int mx = 0;
        for (int i = l; i <= r; i++)
        {
            if(mx > a[i] and mx + a[i] > k){
                flag = 0;
                break;
            }
            mx = max(mx, a[i]);
        }
        if (flag)
            cout << 1 << endl;
        else
            cout << 0 << endl;
    }
}

signed main()
{
    // fastio
    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
        cout << endl;
    }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 0 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 348 KB Output is correct
9 Correct 1 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 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 0 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 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 6 ms 348 KB Output is correct
12 Correct 7 ms 348 KB Output is correct
13 Correct 9 ms 344 KB Output is correct
14 Correct 14 ms 600 KB Output is correct
15 Correct 11 ms 604 KB Output is correct
16 Correct 19 ms 552 KB Output is correct
17 Correct 19 ms 348 KB Output is correct
18 Correct 19 ms 560 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2180 ms 10564 KB Output is correct
2 Correct 2200 ms 10272 KB Output is correct
3 Correct 2182 ms 10784 KB Output is correct
4 Correct 2182 ms 10740 KB Output is correct
5 Execution timed out 3040 ms 8276 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 660 ms 1528 KB Output is correct
2 Correct 1775 ms 1512 KB Output is correct
3 Execution timed out 3031 ms 1560 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 0 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 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 6 ms 348 KB Output is correct
12 Correct 7 ms 348 KB Output is correct
13 Correct 9 ms 344 KB Output is correct
14 Correct 14 ms 600 KB Output is correct
15 Correct 11 ms 604 KB Output is correct
16 Correct 19 ms 552 KB Output is correct
17 Correct 19 ms 348 KB Output is correct
18 Correct 19 ms 560 KB Output is correct
19 Correct 2289 ms 9152 KB Output is correct
20 Correct 2305 ms 9188 KB Output is correct
21 Execution timed out 3088 ms 7296 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 0 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 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 6 ms 348 KB Output is correct
12 Correct 7 ms 348 KB Output is correct
13 Correct 9 ms 344 KB Output is correct
14 Correct 14 ms 600 KB Output is correct
15 Correct 11 ms 604 KB Output is correct
16 Correct 19 ms 552 KB Output is correct
17 Correct 19 ms 348 KB Output is correct
18 Correct 19 ms 560 KB Output is correct
19 Correct 2180 ms 10564 KB Output is correct
20 Correct 2200 ms 10272 KB Output is correct
21 Correct 2182 ms 10784 KB Output is correct
22 Correct 2182 ms 10740 KB Output is correct
23 Execution timed out 3040 ms 8276 KB Time limit exceeded
24 Halted 0 ms 0 KB -