oj.uz

답안 #342601

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
342601 2021-01-02T12:32:32 Z Olerinskiy Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
64 / 100
 650 ms 49132 KB 
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <time.h>
#include <random>
#include <string>
#include <cassert> 
#include <vector>
#include <ostream>
#include <istream>
#include <stack>
#include <deque>
#include <queue>
#include <functional>
#include <chrono>
#include <stack>

using namespace std;

// #define int long long
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define ld long double

istream& operator>> (istream& in, pii& b) {
    in >> b.first >> b.second;
    return in;
}

ostream& operator<< (ostream& out, const pii& b) {
    out << "{" << b.first << ", " << b.second << "}";
    return out;
}

template<typename T> ostream& operator<< (ostream& out, const vector<T>& a) {
    for (auto k : a) out << k << " ";
    return out;
}

template <typename T1, typename T2> inline bool chkmin(T1 &x, const T2 &y) {if (x > y) {x = y; return 1;} return 0;}
template <typename T1, typename T2> inline bool chkmax(T1 &x, const T2 &y) {if (x < y) {x = y; return 1;} return 0;}

#ifdef LOCAL
    #define dbg(x) cout << #x << " : " << (x) << endl;
    const long long INF = 1e18;
    // const long long mod = 2600000069;
    // const long long p = 10;
#else
    #define dbg(x) 57
    const long long INF = 1e18;
    // const long long mod = 2600000069;  
    // const long long p = 179;
#endif

const ld PI = 4 * atan(1);

#define time clock() / (double) CLOCKS_PER_SEC

// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,sse3,sse4")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("fast-math")
// #pragma GCC target("avx2")  
// #pragma GCC optimize("section-anchors")
// #pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
// #pragma GCC optimize("vpt")
// #pragma GCC optimize("rename-registers")
// #pragma GCC optimize("move-loop-invariants")
// #pragma GCC optimize("unswitch-loops")
// #pragma GCC optimize("function-sections")
// #pragma GCC optimize("data-sections")

mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count());

const int N = 2e5 + 10;
// const int N = 5001;

int n, m;
int a[N];

vector<int> t[4 * N];
int w[4 * N];

void build(int v, int l, int r) {
    if (l + 1 == r) {
        t[v] = {a[l]};
        w[v] = 0;
        return;
    }
    int m = (l + r) / 2;
    build(2 * v + 1, l, m);
    build(2 * v + 2, m, r);
    w[v] = max(w[2 * v + 1], w[2 * v + 2]);
    int pos = lower_bound(all(t[2 * v + 2]), t[2 * v + 1].back()) - t[2 * v + 2].begin() - 1;
    if (pos >= 0) {
        chkmax(w[v], t[2 * v + 1].back() + t[2 * v + 2][pos]);
    }
    t[v].resize(r - l);
    merge(all(t[2 * v + 1]), all(t[2 * v + 2]), t[v].begin());
}

int cur = 0;
vector<int> ind;

void ask(int v, int l, int r, int askl, int askr) {
    if (l >= askr || r <= askl) return;
    if (l >= askl && r <= askr) {
        ind.pb(v);
        chkmax(cur, w[v]);
        return;
    }
    int m = (l + r) / 2;
    ask(2 * v + 1, l, m, askl, askr);
    ask(2 * v + 2, m, r, askl, askr);
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    build(0, 0, n);
    while (m--) {
        int l, r, k;
        cin >> l >> r >> k;
        cur = 0;
        ind.clear();
        ask(0, 0, n, l - 1, r);
        if (cur > k) {
            cout << "0\n";
            continue;
        }
        int mx = 0;
        int ans = 1;
        for (auto v : ind) {
            int pos = lower_bound(all(t[v]), mx) - t[v].begin() - 1;
            if (pos >= 0 && t[v][pos] + mx > k) {
                ans = 0;
                break;
            }
            chkmax(mx, t[v].back());
        }
        cout << ans << "\n";
    }
}
/*
3 1
3 1 3
1 3 4
-> 1
*/

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 19180 KB Output is correct
2 Correct 13 ms 19180 KB Output is correct
3 Correct 12 ms 19180 KB Output is correct
4 Correct 13 ms 19180 KB Output is correct
5 Correct 13 ms 19180 KB Output is correct
6 Correct 13 ms 19180 KB Output is correct
7 Correct 13 ms 19180 KB Output is correct
8 Correct 12 ms 19180 KB Output is correct
9 Correct 13 ms 19180 KB Output is correct
10 Correct 13 ms 19180 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 19180 KB Output is correct
2 Correct 13 ms 19180 KB Output is correct
3 Correct 12 ms 19180 KB Output is correct
4 Correct 13 ms 19180 KB Output is correct
5 Correct 13 ms 19180 KB Output is correct
6 Correct 13 ms 19180 KB Output is correct
7 Correct 13 ms 19180 KB Output is correct
8 Correct 12 ms 19180 KB Output is correct
9 Correct 13 ms 19180 KB Output is correct
10 Correct 13 ms 19180 KB Output is correct
11 Correct 15 ms 19308 KB Output is correct
12 Correct 17 ms 19692 KB Output is correct
13 Correct 16 ms 19692 KB Output is correct
14 Correct 18 ms 19692 KB Output is correct
15 Correct 18 ms 19692 KB Output is correct
16 Correct 18 ms 19712 KB Output is correct
17 Correct 17 ms 19576 KB Output is correct
18 Correct 17 ms 19692 KB Output is correct

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 73 ms 40172 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 163 ms 32212 KB Output is correct
2 Correct 163 ms 32256 KB Output is correct
3 Correct 256 ms 32364 KB Output is correct
4 Correct 255 ms 32236 KB Output is correct
5 Correct 266 ms 32364 KB Output is correct
6 Correct 154 ms 32380 KB Output is correct
7 Correct 153 ms 32236 KB Output is correct
8 Correct 147 ms 32364 KB Output is correct
9 Correct 60 ms 19436 KB Output is correct
10 Correct 144 ms 32236 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 19180 KB Output is correct
2 Correct 13 ms 19180 KB Output is correct
3 Correct 12 ms 19180 KB Output is correct
4 Correct 13 ms 19180 KB Output is correct
5 Correct 13 ms 19180 KB Output is correct
6 Correct 13 ms 19180 KB Output is correct
7 Correct 13 ms 19180 KB Output is correct
8 Correct 12 ms 19180 KB Output is correct
9 Correct 13 ms 19180 KB Output is correct
10 Correct 13 ms 19180 KB Output is correct
11 Correct 15 ms 19308 KB Output is correct
12 Correct 17 ms 19692 KB Output is correct
13 Correct 16 ms 19692 KB Output is correct
14 Correct 18 ms 19692 KB Output is correct
15 Correct 18 ms 19692 KB Output is correct
16 Correct 18 ms 19712 KB Output is correct
17 Correct 17 ms 19576 KB Output is correct
18 Correct 17 ms 19692 KB Output is correct
19 Correct 380 ms 46188 KB Output is correct
20 Correct 386 ms 48876 KB Output is correct
21 Correct 337 ms 49132 KB Output is correct
22 Correct 336 ms 48876 KB Output is correct
23 Correct 344 ms 49024 KB Output is correct
24 Correct 453 ms 49004 KB Output is correct
25 Correct 453 ms 48944 KB Output is correct
26 Correct 600 ms 48876 KB Output is correct
27 Correct 590 ms 48888 KB Output is correct
28 Correct 612 ms 48896 KB Output is correct
29 Correct 629 ms 48980 KB Output is correct
30 Correct 627 ms 48876 KB Output is correct
31 Correct 647 ms 48876 KB Output is correct
32 Correct 650 ms 48904 KB Output is correct
33 Correct 632 ms 48876 KB Output is correct
34 Correct 398 ms 49004 KB Output is correct
35 Correct 387 ms 48876 KB Output is correct
36 Correct 382 ms 48876 KB Output is correct
37 Correct 384 ms 49004 KB Output is correct
38 Correct 389 ms 48876 KB Output is correct
39 Correct 362 ms 49132 KB Output is correct
40 Correct 344 ms 39220 KB Output is correct
41 Correct 320 ms 49004 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 19180 KB Output is correct
2 Correct 13 ms 19180 KB Output is correct
3 Correct 12 ms 19180 KB Output is correct
4 Correct 13 ms 19180 KB Output is correct
5 Correct 13 ms 19180 KB Output is correct
6 Correct 13 ms 19180 KB Output is correct
7 Correct 13 ms 19180 KB Output is correct
8 Correct 12 ms 19180 KB Output is correct
9 Correct 13 ms 19180 KB Output is correct
10 Correct 13 ms 19180 KB Output is correct
11 Correct 15 ms 19308 KB Output is correct
12 Correct 17 ms 19692 KB Output is correct
13 Correct 16 ms 19692 KB Output is correct
14 Correct 18 ms 19692 KB Output is correct
15 Correct 18 ms 19692 KB Output is correct
16 Correct 18 ms 19712 KB Output is correct
17 Correct 17 ms 19576 KB Output is correct
18 Correct 17 ms 19692 KB Output is correct
19 Runtime error 73 ms 40172 KB Execution killed with signal 11 (could be triggered by violating memory limits)
20 Halted 0 ms 0 KB -