oj.uz

Submission #885663

# Submission time Handle Problem Language Result Execution time Memory
885663 2023-12-10T11:42:15 Z Mher777 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
47 / 100
 3000 ms 129036 KB 
#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>
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 kap map
#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);
const ll CON = (ll)(911382323);
const ll MOD3 = (ll)(972663749);

/* -------------------- 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 -------------------- */

struct node {
    int mx, ans, id, li, ri;
};

const int N = 1000005, M = 22;
int ar[N], dp[N], st[M][N];
node t[N * 4];
int n, q;

node merge(node a, node b) {
    node ret;
    ret.ans = max(a.ans, b.ans);
    ret.mx = max(a.mx, b.mx);
    if (b.mx >= a.mx) ret.id = b.id;
    else ret.id = a.id;
    ret.li = a.li, ret.ri = b.ri;
    int till = min(b.ri, dp[a.id] - 1);
    if (till >= b.li) {
        int lg = log2(till - b.li + 1);
        ret.ans = max(ret.ans, a.mx + max(st[lg][b.li], st[lg][till - (binpow(2, lg)) + 1]));
    }
    return ret;
}

void bld(int l = 1, int r = n, int pos = 1) {
    if (l == r) {
        t[pos].mx = ar[l];
        t[pos].ans = 0;
        t[pos].id = l;
        t[pos].li = t[pos].ri = l;
    }
    else {
        int mid = (l + r) / 2;
        bld(l, mid, 2 * pos);
        bld(mid + 1, r, 2 * pos + 1);
        t[pos] = merge(t[2 * pos], t[2 * pos + 1]);
    }
}

node 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 merge(qry(l, mid, tl, mid, 2 * pos), qry(mid + 1, r, mid + 1, tr, 2 * pos + 1));
}

void slv() {
    cin >> n >> q;
    for (int i = 1; i <= n; ++i) {
        scanf("%d", &ar[i]);
        st[0][i] = ar[i];
    }
    int l = log2(n), pw;
    for (int i = 1; i <= l; ++i) {
        pw = binpow(2, i - 1);
        for (int j = 1; j + (1 << i) <= n; ++j) {
            st[i][j] = max(st[i - 1][j], st[i - 1][j + pw]);
        }
    }
    for (int i = n; i >= 1; --i) {
        int ind = i + 1;
        while (ind <= n) {
            if (ar[ind] >= ar[i]) break;
            ind = dp[ind];
        }
        dp[i] = ind;
    }
    bld();
    while (q--) {
        int l, r, k;
        cin >> l >> r >> k;
        node nd = qry(l, r);
        int num = (int)(nd.ans <= k);
        printf("%d\n", num);
    }
}

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:93:21: warning: unused variable 'cnt' [-Wunused-variable]
   93 |     ll dif = a - 1, cnt = b - a + 1;
      |                     ^~~
sortbooks.cpp: In function 'll bin_to_dec(std::string)':
sortbooks.cpp:116:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  116 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~
sortbooks.cpp: In function 'void slv()':
sortbooks.cpp:217:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  217 |         scanf("%d", &ar[i]);
      |         ~~~~~^~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 3 ms 20828 KB Output is correct
4 Correct 2 ms 16732 KB Output is correct
5 Correct 3 ms 20828 KB Output is correct
6 Correct 4 ms 22876 KB Output is correct
7 Correct 4 ms 22876 KB Output is correct
8 Correct 3 ms 22876 KB Output is correct
9 Correct 3 ms 20828 KB Output is correct
10 Correct 4 ms 22876 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 3 ms 20828 KB Output is correct
4 Correct 2 ms 16732 KB Output is correct
5 Correct 3 ms 20828 KB Output is correct
6 Correct 4 ms 22876 KB Output is correct
7 Correct 4 ms 22876 KB Output is correct
8 Correct 3 ms 22876 KB Output is correct
9 Correct 3 ms 20828 KB Output is correct
10 Correct 4 ms 22876 KB Output is correct
11 Correct 10 ms 26972 KB Output is correct
12 Correct 11 ms 33372 KB Output is correct
13 Correct 11 ms 33372 KB Output is correct
14 Correct 16 ms 33372 KB Output is correct
15 Correct 16 ms 33448 KB Output is correct
16 Correct 15 ms 33368 KB Output is correct
17 Correct 12 ms 29276 KB Output is correct
18 Correct 13 ms 33248 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3053 ms 129036 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 293 ms 56040 KB Output is correct
2 Correct 329 ms 56444 KB Output is correct
3 Correct 228 ms 56156 KB Output is correct
4 Correct 230 ms 56184 KB Output is correct
5 Correct 235 ms 56408 KB Output is correct
6 Correct 227 ms 56144 KB Output is correct
7 Correct 228 ms 56148 KB Output is correct
8 Correct 218 ms 56148 KB Output is correct
9 Correct 178 ms 23124 KB Output is correct
10 Incorrect 214 ms 56148 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 3 ms 20828 KB Output is correct
4 Correct 2 ms 16732 KB Output is correct
5 Correct 3 ms 20828 KB Output is correct
6 Correct 4 ms 22876 KB Output is correct
7 Correct 4 ms 22876 KB Output is correct
8 Correct 3 ms 22876 KB Output is correct
9 Correct 3 ms 20828 KB Output is correct
10 Correct 4 ms 22876 KB Output is correct
11 Correct 10 ms 26972 KB Output is correct
12 Correct 11 ms 33372 KB Output is correct
13 Correct 11 ms 33372 KB Output is correct
14 Correct 16 ms 33372 KB Output is correct
15 Correct 16 ms 33448 KB Output is correct
16 Correct 15 ms 33368 KB Output is correct
17 Correct 12 ms 29276 KB Output is correct
18 Correct 13 ms 33248 KB Output is correct
19 Correct 661 ms 68688 KB Output is correct
20 Correct 682 ms 68928 KB Output is correct
21 Correct 646 ms 68688 KB Output is correct
22 Correct 649 ms 68884 KB Output is correct
23 Correct 640 ms 68692 KB Output is correct
24 Correct 475 ms 68704 KB Output is correct
25 Correct 486 ms 68576 KB Output is correct
26 Correct 496 ms 68664 KB Output is correct
27 Correct 541 ms 68656 KB Output is correct
28 Correct 501 ms 68948 KB Output is correct
29 Correct 500 ms 68692 KB Output is correct
30 Correct 500 ms 68568 KB Output is correct
31 Correct 521 ms 68680 KB Output is correct
32 Correct 495 ms 68632 KB Output is correct
33 Correct 505 ms 68644 KB Output is correct
34 Correct 501 ms 68944 KB Output is correct
35 Correct 489 ms 68692 KB Output is correct
36 Correct 480 ms 68456 KB Output is correct
37 Correct 482 ms 69084 KB Output is correct
38 Correct 490 ms 68628 KB Output is correct
39 Correct 482 ms 68572 KB Output is correct
40 Correct 450 ms 58452 KB Output is correct
41 Correct 466 ms 68624 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 3 ms 20828 KB Output is correct
4 Correct 2 ms 16732 KB Output is correct
5 Correct 3 ms 20828 KB Output is correct
6 Correct 4 ms 22876 KB Output is correct
7 Correct 4 ms 22876 KB Output is correct
8 Correct 3 ms 22876 KB Output is correct
9 Correct 3 ms 20828 KB Output is correct
10 Correct 4 ms 22876 KB Output is correct
11 Correct 10 ms 26972 KB Output is correct
12 Correct 11 ms 33372 KB Output is correct
13 Correct 11 ms 33372 KB Output is correct
14 Correct 16 ms 33372 KB Output is correct
15 Correct 16 ms 33448 KB Output is correct
16 Correct 15 ms 33368 KB Output is correct
17 Correct 12 ms 29276 KB Output is correct
18 Correct 13 ms 33248 KB Output is correct
19 Execution timed out 3053 ms 129036 KB Time limit exceeded
20 Halted 0 ms 0 KB -