oj.uz

Submission #1093997

# Submission time Handle Problem Language Result Execution time Memory
1093997 2024-09-28T08:40:13 Z KasymK Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
17 / 100
 96 ms 25940 KB 
#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 1e6+5;
int v[N], par[N];

// struct node{
//     int l, r, val;
// } seg[N<<2];

// void build(int x, int l, int r){
//     seg[x].l = l, seg[x].r = r;
//     if(l == r){
//         seg[x].val = (v[x] < v[x-1]);
//         return;
//     }
//     int mid = (l+r)>>1;
//     build(x<<1, l, mid);
//     build(x<<1|1, mid+1, r);
//     seg[x].val = seg[x<<1].val+seg[x<<1|1].val;
// }

// int query(int x, int l, int r){
//     if(seg[x].l == l and seg[x].r == r)
//         return seg[x].val;
//     int mid = (seg[x].l+seg[x].r)>>1;
//     if(r <= mid)
//         return query(x<<1, l, r);
//     else if(l > mid)
//         return query(x<<1|1, l, r);
//     else
//         return query(x<<1, l, mid)+query(x<<1|1, mid+1, r);
// }

int main(){
    int n, q;
    scanf("%d%d", &n, &q);
    for(int i = 1; i <= n; ++i){
        int x;
        scanf("%d", &x);
        v[i] = x;
    }
    if(n <= 5e3+5){
        vector<int> A;
        int l, r, k;
        auto wow = [&]() -> bool {
            int mx = -1, sz = (int)A.size();
            for(int i = 0; i < sz; ++i)
                for(int j = i-1; j >= 0; --j)
                    if(A[i] < A[j])
                        swap(A[i], A[j]), umax(mx, A[i]+A[j]);
                    else
                        break;
            return (mx <= k);
        };
        while(q--){
            scanf("%d%d%d", &l, &r, &k);
            for(int i = l; i <= r; ++i)
                A.pb(v[i]);
            // hazel eyes with green flecks ---> the only thing, that I enjoy of looking...
            bool ok = wow();
            puts(ok ? "1" : "0");
            A.clear();
        }
        return 0;
    }
    for(int i = 1; i <= n; ++i)
        par[i] = par[i-1]+(v[i]<v[i-1]);
    // build(1, 1, n);
    while(q--){
        int l, r, k;
        scanf("%d%d", &l, &r, &k);
        // we cannot do any swaps, we need to only check if interval [l: r] is sorted or not.
        // int ok = query(1, l, r);
        // puts(!ok ? "1" : "0");
        int ok = par[r]-par[l-1];
        puts(!ok ? "1" : "0");
    }
    return 0;
}

Compilation message

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:83:15: warning: too many arguments for format [-Wformat-extra-args]
   83 |         scanf("%d%d", &l, &r, &k);
      |               ^~~~~~
sortbooks.cpp:48:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |     scanf("%d%d", &n, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~
sortbooks.cpp:51:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |         scanf("%d", &x);
      |         ~~~~~^~~~~~~~~~
sortbooks.cpp:68:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |             scanf("%d%d%d", &l, &r, &k);
      |             ~~~~~^~~~~~~~~~~~~~~~~~~~~~
sortbooks.cpp:83:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |         scanf("%d%d", &l, &r, &k);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 448 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 452 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 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 448 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 452 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 5 ms 600 KB Output is correct
12 Correct 13 ms 624 KB Output is correct
13 Correct 15 ms 632 KB Output is correct
14 Correct 24 ms 672 KB Output is correct
15 Correct 25 ms 676 KB Output is correct
16 Correct 36 ms 628 KB Output is correct
17 Correct 27 ms 348 KB Output is correct
18 Correct 51 ms 600 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 96 ms 25940 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 2904 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 448 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 452 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 5 ms 600 KB Output is correct
12 Correct 13 ms 624 KB Output is correct
13 Correct 15 ms 632 KB Output is correct
14 Correct 24 ms 672 KB Output is correct
15 Correct 25 ms 676 KB Output is correct
16 Correct 36 ms 628 KB Output is correct
17 Correct 27 ms 348 KB Output is correct
18 Correct 51 ms 600 KB Output is correct
19 Runtime error 19 ms 5720 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 448 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 452 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 5 ms 600 KB Output is correct
12 Correct 13 ms 624 KB Output is correct
13 Correct 15 ms 632 KB Output is correct
14 Correct 24 ms 672 KB Output is correct
15 Correct 25 ms 676 KB Output is correct
16 Correct 36 ms 628 KB Output is correct
17 Correct 27 ms 348 KB Output is correct
18 Correct 51 ms 600 KB Output is correct
19 Runtime error 96 ms 25940 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -