oj.uz

답안 #895293

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
895293 2023-12-29T17:54:53 Z Mher777 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
100 / 100
 788 ms 60196 KB 
/* ----------------------------- Mher777 ----------------------------- */
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <fstream>
#include <cassert>
using namespace std;

/* -------------------- Typedefs -------------------- */

typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef float fl;
typedef double db;
typedef long double ld;

/* -------------------- Usings -------------------- */

using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

/* -------------------- Defines -------------------- */

#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define all(x) (x).begin(), (x).end()

/* -------------------- Constants -------------------- */

const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18 + 5);
const ll MOD = ll(1e9 + 7);
const ll MOD2 = ll(998244353);

/* -------------------- Functions -------------------- */

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

void precision(int x) {
    cout.setf(ios::fixed | ios::showpoint);
    cout.precision(x);
}

ll gcd(ll a, ll b) {
    while (b) {
        a %= b;
        swap(a, b);
    }
    return a;
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

ll range_sum(ll a, ll b) {
    ll dif = a - 1, cnt = b - a + 1;
    ll ans = ((b - a + 1) * (b - a + 2)) / 2;
    ans += ((b - a + 1) * dif);
    return ans;
}

string dec_to_bin(ll a) {
    string s = "";
    for (ll i = a; i > 0; ) {
        ll k = i % 2;
        i /= 2;
        char c = k + 48;
        s += c;
    }
    if (a == 0) {
        s = "0";
    }
    reverse(all(s));
    return s;
}

ll bin_to_dec(string s) {
    ll num = 0;
    for (int i = 0; i < s.size(); i++) {
        num *= 2ll;
        num += (s[i] - '0');
    }
    return num;
}

int isPrime(ll a) {
    if (a == 1) return 0;
    for (ll i = 2; i * i <= a; i++) {
        if (a % i == 0) return 0;
    }
    return 1;
}

ll binpow(ll a, ll b) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
        }
        b >>= 1;
        a *= a;
    }
    return ans;
}

ll binpow_by_mod(ll a, ll b, ll mod) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
            ans %= mod;
        }
        b >>= 1;
        a *= a;
        a %= mod;
    }
    return ans;
}

/*-------------------- Solution -------------------- */

const int N = 1000005;
int n, m;
int a[N], dp[N], t[N * 4], p[N];

void bld(int l = 1, int r = n, int pos = 1) {
    if (l == r) {
        p[l] = pos;
        return;
    }
    int mid = (l + r) / 2;
    bld(l, mid, 2 * pos);
    bld(mid + 1, r, 2 * pos + 1);
}

int qry(int l, int r, int tl = 1, int tr = n, int pos = 1) {
    if (l == tl && r == tr) {
        return t[pos];
    }
    int mid = (tl + tr) / 2;
    if (mid >= r) {
        return qry(l, r, tl, mid, 2 * pos);
    }
    if (mid < l) {
        return qry(l, r, mid + 1, tr, 2 * pos + 1);
    }
    return max(qry(l, mid, tl, mid, 2 * pos), qry(mid + 1, r, mid + 1, tr, 2 * pos + 1));
}

void upd(int ind, int val) {
    ind = p[ind];
    t[ind] = val;
    ind /= 2;
    while (ind) {
        t[ind] = max(t[ind * 2], t[ind * 2 + 1]);
        ind /= 2;
    }
}

void slv() {
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        int ind = i - 1;
        while (ind > 0) {
            if (a[ind] > a[i]) break;
            ind = dp[ind];
        }
        dp[i] = ind;
    }
    bld();
    vector<pair<int, pair<int, pii>>> g(m);
    vi ans(m);
    for (int i = 0; i < m; ++i) {
        cin >> g[i].ss.ff >> g[i].ff >> g[i].ss.ss.ff;
        g[i].ss.ss.ss = i;
    }
    sort(all(g));
    int cur = 1;
    for (int i = 0; i < g.size(); ++i) {
        int l = g[i].ss.ff, r = g[i].ff, k = g[i].ss.ss.ff, id = g[i].ss.ss.ss;
        while (cur <= r) {
            upd(dp[cur], a[dp[cur]] + a[cur]);
            ++cur;
        }
        ans[id] = (int)(qry(l, r) <= k);
    }
    for (auto elem : ans) cout << elem << '\n';
}

void cs() {
    int tstc = 1;
    //cin >> tstc;
    while (tstc--) {
        slv();
    }
}

void precalc() {
    return;
}

int main() {
    fastio();
    precalc();
    //precision(0);
    cs();
    return 0;
}

Compilation message

sortbooks.cpp: In function 'll range_sum(ll, ll)':
sortbooks.cpp:92:21: warning: unused variable 'cnt' [-Wunused-variable]
   92 |     ll dif = a - 1, cnt = b - a + 1;
      |                     ^~~
sortbooks.cpp: In function 'll bin_to_dec(std::string)':
sortbooks.cpp:115:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~
sortbooks.cpp: In function 'void slv()':
sortbooks.cpp:218:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, std::pair<int, int> > > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  218 |     for (int i = 0; i < g.size(); ++i) {
      |                     ~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 3 ms 6492 KB Output is correct
13 Correct 3 ms 6612 KB Output is correct
14 Correct 4 ms 6748 KB Output is correct
15 Correct 4 ms 6748 KB Output is correct
16 Correct 4 ms 6748 KB Output is correct
17 Correct 3 ms 6748 KB Output is correct
18 Correct 3 ms 6732 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 754 ms 53948 KB Output is correct
2 Correct 727 ms 59476 KB Output is correct
3 Correct 733 ms 59576 KB Output is correct
4 Correct 732 ms 59592 KB Output is correct
5 Correct 667 ms 51496 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 12840 KB Output is correct
2 Correct 58 ms 12884 KB Output is correct
3 Correct 57 ms 10812 KB Output is correct
4 Correct 55 ms 10836 KB Output is correct
5 Correct 54 ms 10832 KB Output is correct
6 Correct 49 ms 12836 KB Output is correct
7 Correct 60 ms 12880 KB Output is correct
8 Correct 49 ms 10852 KB Output is correct
9 Correct 36 ms 8528 KB Output is correct
10 Correct 52 ms 10844 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 3 ms 6492 KB Output is correct
13 Correct 3 ms 6612 KB Output is correct
14 Correct 4 ms 6748 KB Output is correct
15 Correct 4 ms 6748 KB Output is correct
16 Correct 4 ms 6748 KB Output is correct
17 Correct 3 ms 6748 KB Output is correct
18 Correct 3 ms 6732 KB Output is correct
19 Correct 133 ms 17504 KB Output is correct
20 Correct 145 ms 18640 KB Output is correct
21 Correct 128 ms 18672 KB Output is correct
22 Correct 128 ms 18656 KB Output is correct
23 Correct 138 ms 18628 KB Output is correct
24 Correct 120 ms 16464 KB Output is correct
25 Correct 117 ms 16348 KB Output is correct
26 Correct 121 ms 16724 KB Output is correct
27 Correct 127 ms 16564 KB Output is correct
28 Correct 134 ms 16576 KB Output is correct
29 Correct 125 ms 16720 KB Output is correct
30 Correct 132 ms 16572 KB Output is correct
31 Correct 126 ms 16588 KB Output is correct
32 Correct 126 ms 16608 KB Output is correct
33 Correct 125 ms 16724 KB Output is correct
34 Correct 135 ms 18480 KB Output is correct
35 Correct 113 ms 18496 KB Output is correct
36 Correct 112 ms 18516 KB Output is correct
37 Correct 112 ms 18388 KB Output is correct
38 Correct 113 ms 18496 KB Output is correct
39 Correct 111 ms 16368 KB Output is correct
40 Correct 96 ms 15548 KB Output is correct
41 Correct 106 ms 15676 KB Output is correct

Subtask #6
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 3 ms 6492 KB Output is correct
13 Correct 3 ms 6612 KB Output is correct
14 Correct 4 ms 6748 KB Output is correct
15 Correct 4 ms 6748 KB Output is correct
16 Correct 4 ms 6748 KB Output is correct
17 Correct 3 ms 6748 KB Output is correct
18 Correct 3 ms 6732 KB Output is correct
19 Correct 754 ms 53948 KB Output is correct
20 Correct 727 ms 59476 KB Output is correct
21 Correct 733 ms 59576 KB Output is correct
22 Correct 732 ms 59592 KB Output is correct
23 Correct 667 ms 51496 KB Output is correct
24 Correct 68 ms 12840 KB Output is correct
25 Correct 58 ms 12884 KB Output is correct
26 Correct 57 ms 10812 KB Output is correct
27 Correct 55 ms 10836 KB Output is correct
28 Correct 54 ms 10832 KB Output is correct
29 Correct 49 ms 12836 KB Output is correct
30 Correct 60 ms 12880 KB Output is correct
31 Correct 49 ms 10852 KB Output is correct
32 Correct 36 ms 8528 KB Output is correct
33 Correct 52 ms 10844 KB Output is correct
34 Correct 133 ms 17504 KB Output is correct
35 Correct 145 ms 18640 KB Output is correct
36 Correct 128 ms 18672 KB Output is correct
37 Correct 128 ms 18656 KB Output is correct
38 Correct 138 ms 18628 KB Output is correct
39 Correct 120 ms 16464 KB Output is correct
40 Correct 117 ms 16348 KB Output is correct
41 Correct 121 ms 16724 KB Output is correct
42 Correct 127 ms 16564 KB Output is correct
43 Correct 134 ms 16576 KB Output is correct
44 Correct 125 ms 16720 KB Output is correct
45 Correct 132 ms 16572 KB Output is correct
46 Correct 126 ms 16588 KB Output is correct
47 Correct 126 ms 16608 KB Output is correct
48 Correct 125 ms 16724 KB Output is correct
49 Correct 135 ms 18480 KB Output is correct
50 Correct 113 ms 18496 KB Output is correct
51 Correct 112 ms 18516 KB Output is correct
52 Correct 112 ms 18388 KB Output is correct
53 Correct 113 ms 18496 KB Output is correct
54 Correct 111 ms 16368 KB Output is correct
55 Correct 96 ms 15548 KB Output is correct
56 Correct 106 ms 15676 KB Output is correct
57 Correct 719 ms 59932 KB Output is correct
58 Correct 717 ms 59588 KB Output is correct
59 Correct 738 ms 59672 KB Output is correct
60 Correct 742 ms 60196 KB Output is correct
61 Correct 717 ms 60184 KB Output is correct
62 Correct 788 ms 59960 KB Output is correct
63 Correct 652 ms 51040 KB Output is correct
64 Correct 667 ms 51216 KB Output is correct
65 Correct 667 ms 51740 KB Output is correct
66 Correct 664 ms 51988 KB Output is correct
67 Correct 654 ms 51796 KB Output is correct
68 Correct 659 ms 51768 KB Output is correct
69 Correct 695 ms 51796 KB Output is correct
70 Correct 646 ms 35328 KB Output is correct
71 Correct 713 ms 35048 KB Output is correct
72 Correct 708 ms 34860 KB Output is correct
73 Correct 698 ms 38932 KB Output is correct
74 Correct 646 ms 38996 KB Output is correct
75 Correct 638 ms 54500 KB Output is correct
76 Correct 665 ms 54312 KB Output is correct
77 Correct 658 ms 54528 KB Output is correct
78 Correct 649 ms 53088 KB Output is correct
79 Correct 463 ms 46164 KB Output is correct
80 Correct 597 ms 47448 KB Output is correct