oj.uz

Submission #649579

# Submission time Handle Problem Language Result Execution time Memory
649579 2022-10-10T18:43:44 Z murad_2005 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
17 / 100
 958 ms 17380 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define ld long double
#define ull unsigned long long
#define ui unsigned int
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define pf push_front
#define pii pair<int, int>
#define pil pair<int, ll>
#define plli pair<long long, int>
#define pdi pair<double, int>
#define pldldi pair<ld, pair<ld, int>>
#define pdd pair<double, double>
#define pid pair<int, double>
#define piii pair<int, pair<int, int>>
#define pllll pair<long long, long long>
#define pllllll pair<ll, pllll>
#define INF 2e9 + 5
#define size(v) v.size()
#define f first
#define s second
#define Pi 3.14159265359

using namespace std;

const int up = 1e6 + 5;

///Subtask3

int st[up << 2], a[up];

int Merge(bool L, bool R, int posl, int posr){
    if(!(L & R)){
        return 0;
    }else{
        int k = (posr - posl + 1) / 2;
        if(a[posl + k - 1] > a[posl + k]){
            return 0;
        }
    }
    return 1;
}

void build(int node, int l, int r){
    if(l == r){
        st[node] = 1;
    }else{
        int mid = (l + r) / 2;
        build(node << 1, l, mid), build((node << 1) | 1, mid + 1, r);
        st[node] = Merge(st[node << 1], st[(node << 1) | 1], l, r);
    }
}

int query(int node, int l, int r, int ql, int qr){
    if(l > qr || ql > r){
        return 1;
    }else if(ql <= l && r <= qr){
        return st[node];
    }else{
        int mid = (l + r) / 2;
        int L = query(node << 1, l, mid, ql, qr), R = query((node << 1) | 1, mid + 1, r, ql, qr);
        return Merge(L, R, ql, qr);
    }
}

void Subtask1and2(int n, int m){
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    while(m--){
        int l, r, k, flag = 0;
        cin >> l >> r >> k;
        vector<int>v;
        for(int i = l; i <= r; i++){
            v.pb(a[i]);
        }
        int Max = -INF;
        for(int i = 0; i < size(v); i++){
            Max = max(Max, v[i]);
            if(i > 0){
                if(Max > v[i] && Max + v[i] > k){
                    flag = 1;
                    break;
                }
            }
        }
        cout << (flag ^ 1) << "\n";
    }
}

void Subtask3(int n, int m){
    for(int i = 1; i <= n; ++i){
        cin >> a[i];
    }
    build(1, 1, n);
    while(m--){
        int l, r, k;
        cin >> l >> r >> k;
        cout << query(1, 1, n, l, r) << "\n";
    }
}



void solve(){
    int n, m;
    cin >> n >> m;
    if(n <= 5000 && m <= 5000){
        Subtask1and2(n, m);
    }else{
        Subtask3(n, m);
    }
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t;
    t = 1;
    // cin >> t;
    while(t--){
        solve();
    }
    return 0;
}

Compilation message

sortbooks.cpp: In function 'void Subtask1and2(int, int)':
sortbooks.cpp:84:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |         for(int i = 0; i < size(v); i++){
      |                          ^

Subtask #1
8.0 / 8.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 7 ms 340 KB Output is correct
12 Correct 8 ms 508 KB Output is correct
13 Correct 10 ms 508 KB Output is correct
14 Correct 13 ms 468 KB Output is correct
15 Correct 14 ms 468 KB Output is correct
16 Correct 27 ms 468 KB Output is correct
17 Correct 23 ms 468 KB Output is correct
18 Correct 34 ms 476 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 71 ms 2252 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 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 7 ms 340 KB Output is correct
12 Correct 8 ms 508 KB Output is correct
13 Correct 10 ms 508 KB Output is correct
14 Correct 13 ms 468 KB Output is correct
15 Correct 14 ms 468 KB Output is correct
16 Correct 27 ms 468 KB Output is correct
17 Correct 23 ms 468 KB Output is correct
18 Correct 34 ms 476 KB Output is correct
19 Incorrect 177 ms 4628 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 7 ms 340 KB Output is correct
12 Correct 8 ms 508 KB Output is correct
13 Correct 10 ms 508 KB Output is correct
14 Correct 13 ms 468 KB Output is correct
15 Correct 14 ms 468 KB Output is correct
16 Correct 27 ms 468 KB Output is correct
17 Correct 23 ms 468 KB Output is correct
18 Correct 34 ms 476 KB Output is correct
19 Incorrect 958 ms 17380 KB Output isn't correct
20 Halted 0 ms 0 KB -