oj.uz

답안 #884938

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
884938 2023-12-08T17:38:10 Z Mher777 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
17 / 100
 2467 ms 262144 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 ans, mx;
    multiset<int> mst;
};

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

node merge(node a, node b) {
    node ret;
    ret.mx = 0;
    ret.ans = 0;
    ret.mst = {};
    for (auto elem : a.mst) ret.mst.insert(elem);
    for (auto elem : b.mst) ret.mst.insert(elem);
    ret.ans = max(a.ans, b.ans);
    auto ub = b.mst.upper_bound(-a.mx);
    if (ub != b.mst.end()) ret.ans = max(ret.ans, a.mx - *ub);
    ret.mx = max(a.mx, b.mx);
    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].mst = { -ar[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) cin >> ar[i];
    bld();
    while (q--) {
        int l, r, k;
        cin >> l >> r >> k;
        node ret = qry(l, r);
        cout << (int)(ret.ans <= k) << '\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: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++) {
      |                     ~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 97 ms 220172 KB Output is correct
2 Correct 43 ms 219988 KB Output is correct
3 Correct 54 ms 220244 KB Output is correct
4 Correct 43 ms 219988 KB Output is correct
5 Correct 44 ms 220244 KB Output is correct
6 Correct 59 ms 220472 KB Output is correct
7 Correct 58 ms 220476 KB Output is correct
8 Correct 62 ms 220240 KB Output is correct
9 Correct 46 ms 220252 KB Output is correct
10 Correct 55 ms 220396 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 97 ms 220172 KB Output is correct
2 Correct 43 ms 219988 KB Output is correct
3 Correct 54 ms 220244 KB Output is correct
4 Correct 43 ms 219988 KB Output is correct
5 Correct 44 ms 220244 KB Output is correct
6 Correct 59 ms 220472 KB Output is correct
7 Correct 58 ms 220476 KB Output is correct
8 Correct 62 ms 220240 KB Output is correct
9 Correct 46 ms 220252 KB Output is correct
10 Correct 55 ms 220396 KB Output is correct
11 Correct 347 ms 221268 KB Output is correct
12 Correct 1098 ms 223768 KB Output is correct
13 Correct 1247 ms 224012 KB Output is correct
14 Correct 1959 ms 223936 KB Output is correct
15 Correct 2089 ms 223932 KB Output is correct
16 Correct 2467 ms 223888 KB Output is correct
17 Correct 842 ms 223156 KB Output is correct
18 Correct 1765 ms 224104 KB Output is correct

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 208 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 136 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 97 ms 220172 KB Output is correct
2 Correct 43 ms 219988 KB Output is correct
3 Correct 54 ms 220244 KB Output is correct
4 Correct 43 ms 219988 KB Output is correct
5 Correct 44 ms 220244 KB Output is correct
6 Correct 59 ms 220472 KB Output is correct
7 Correct 58 ms 220476 KB Output is correct
8 Correct 62 ms 220240 KB Output is correct
9 Correct 46 ms 220252 KB Output is correct
10 Correct 55 ms 220396 KB Output is correct
11 Correct 347 ms 221268 KB Output is correct
12 Correct 1098 ms 223768 KB Output is correct
13 Correct 1247 ms 224012 KB Output is correct
14 Correct 1959 ms 223936 KB Output is correct
15 Correct 2089 ms 223932 KB Output is correct
16 Correct 2467 ms 223888 KB Output is correct
17 Correct 842 ms 223156 KB Output is correct
18 Correct 1765 ms 224104 KB Output is correct
19 Runtime error 135 ms 262144 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 97 ms 220172 KB Output is correct
2 Correct 43 ms 219988 KB Output is correct
3 Correct 54 ms 220244 KB Output is correct
4 Correct 43 ms 219988 KB Output is correct
5 Correct 44 ms 220244 KB Output is correct
6 Correct 59 ms 220472 KB Output is correct
7 Correct 58 ms 220476 KB Output is correct
8 Correct 62 ms 220240 KB Output is correct
9 Correct 46 ms 220252 KB Output is correct
10 Correct 55 ms 220396 KB Output is correct
11 Correct 347 ms 221268 KB Output is correct
12 Correct 1098 ms 223768 KB Output is correct
13 Correct 1247 ms 224012 KB Output is correct
14 Correct 1959 ms 223936 KB Output is correct
15 Correct 2089 ms 223932 KB Output is correct
16 Correct 2467 ms 223888 KB Output is correct
17 Correct 842 ms 223156 KB Output is correct
18 Correct 1765 ms 224104 KB Output is correct
19 Runtime error 208 ms 262144 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -