oj.uz

답안 #1058870

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1058870 2024-08-14T14:39:06 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
100 / 100
 652 ms 98728 KB 
#include<bits/allocator.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,popcnt,lzcnt")

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define int128 __int128_t
#define double long double
#define gcd __gcd
#define lcm(a, b) ((a)/gcd(a, b)*(b))
#define sqrt sqrtl
#define log2 log2l
#define log10 log10l
#define floor floorl
#define to_string str
#define yes cout << "YES"
#define no cout << "NO"
#define trav(i, a) for (auto &i: (a))
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (int)a.size()
#define Max(a) *max_element(all(a))
#define Min(a) *min_element(all(a))
#define Find(a, n) (find(all(a), n) - a.begin())
#define Count(a, n) count(all(a), n)
#define Upper(a, n) (upper_bound(all(a), n) - a.begin())
#define Lower(a, n) (lower_bound(all(a), n) - a.begin())
#define next_perm(a) next_permutation(all(a))
#define prev_perm(a) prev_permutation(all(a))
#define sorted(a) is_sorted(all(a))
#define sum(a) accumulate(all(a), 0)
#define sumll(a) accumulate(all(a), 0ll)
#define Sort(a) sort(all(a))
#define Reverse(a) reverse(all(a))
#define Unique(a) Sort(a), (a).resize(unique(all(a)) - a.begin())
#define pb push_back
#define eb emplace_back
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define clz __builtin_clz
#define clzll __buitlin_clzll
#define ctz __builtin_ctz
#define ctzll __builtin_ctzll
#define open(s) freopen(s, "r", stdin)
#define write(s) freopen(s, "w", stdout)
#define fileopen(s) open((string(s) + ".inp").c_str()), write((string(s) + ".out").c_str());
#define For(i, a, b) for (auto i = (a); i < (b); i++)
#define Fore(i, a, b) for (auto i = (a); i >= (b); i--)
#define FOR(i, a, b) for (auto i = (a); i <= (b); i++)
#define ret(s) return void(cout << s);

const int mod = 1e9 + 7, mod2 = 998244353;
const double PI = acos(-1), eps = 1e-9;
const ull npos = string::npos;
const int dx[] = {0, 0, -1, 1}, dy[] = {-1, 1, 0, 0};
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using cd = complex<double>;
mt19937 mt(chrono::system_clock::now().time_since_epoch().count());
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<double> vdo;
typedef vector<vdo> vvdo;
typedef vector<string> vs;
typedef vector<pii> vpair;
typedef vector<vpair> vvpair;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<cd> vcd;
typedef priority_queue<int> pq;
typedef priority_queue<int, vi, greater<int>> pqg;
typedef priority_queue<ll> pqll;
typedef priority_queue<ll, vll, greater<ll>> pqgll;

ll add(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;a+=b;return a >= m ? a - m: a;}
ll sub(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;a-=b;return a < 0 ? a + m: a;}
ll mul(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;return a*b % m;}
ll bin_mul(ll a, ll b, ll m) {if (a >= m) a%=m;if (b >= m) b%=m;ll x = 0;while (b) {if (b & 1) x = (x + a) % m;a = (a + a) % m;b>>=1;}return x;}
ll bin_pow(ll a, ll b, ll m) {ll x = 1;if (a >= m) a%=m; while (b) {if (b & 1) x = bin_mul(x, a, m);a = bin_mul(a, a, m);b>>=1;}return x;}
ll power(ll a, ll b, int m) {ll x = 1;if (a >= m) a%=m; while (b) {if (b & 1) x = x*a % m;a = a*a % m;b>>=1;}return x;}
ll power(ll a, ll b) {ll x = 1;while (b) {if (b & 1) x = x*a;a = a*a;b>>=1;}return x;}
ll ceil(ll a, ll b) {return (a + b - 1)/b;}
ll to_int(const string &s) {ll x = 0; for (int i = (s[0] == '-'); i < sz(s); i++) x = x*10 + s[i] - '0';return x*(s[0] == '-' ? -1: 1);}
bool is_prime(ll n) {if (n < 2) return 0;if (n < 4) return 1;if (n % 2 == 0 || n % 3 == 0) return 0;for (ll i = 5; i*i <= n; i+=6) {if(n % i == 0 || n % (i + 2) == 0) return 0;}return 1;}
bool is_square(ll n) {ll k = sqrt(n); return k*k == n;}
ll factorial(int n) {ll x = 1;for (int i = 2; i <= n; i++) x*=i;return x;}
ll factorial(int n, int m) {ll x = 1;for (ll i = 2; i <= n; i++) x = x*i % m;return x;}
bool is_power(ll n, ll k) {while (n % k == 0) n/=k;return n == 1ll;}
string str(ll n) {if (n == 0) return "0"; string s = ""; bool c = 0; if (n < 0) c = 1, n = -n; while (n) {s+=n % 10 + '0'; n/=10;} if (c) s+='-'; Reverse(s); return s;}
string repeat(const string &s, int n) {if (n < 0) return ""; string x = ""; while (n--) x+=s; return x;}
string bin(ll n) {string s = ""; while (n) {s+=(n & 1) + '0'; n>>=1;} Reverse(s); return s;}
void sieve(vector<bool> &a) {int n = a.size(); a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}}
void sieve(bool a[], int n) {a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}}
void sieve(vector<int> &a) {int n = a.size(); for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
void sieve(int a[], int n) {for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
vector<pii> factorize(int n) {vector<pii> a; for (int i = 2; i*i <= n; i++) {if (n % i == 0) {int k = 0; while (n % i == 0) k++, n/=i; a.emplace_back(i, k);}} if (n > 1) a.emplace_back(n, 1); return a;}
int rand(int l, int r) {return uniform_int_distribution<int>(l, r)(mt);}
int Log2(int n) {return 31 - __builtin_clz(n);}
template<class T> void compress(vector<T> &a) {vector<T> b; for (T &i: a) b.push_back(i); sort(all(b)); b.resize(unique(all(b)) - b.begin()); for (T &i: a) i = lower_bound(all(b), i) - b.begin() + 1;}

template<class A, class B> istream& operator>>(istream& in, pair<A, B> &p) {in >> p.first >> p.second; return in;}
template<class A, class B> ostream& operator<<(ostream& out, const pair<A, B> &p) {out << p.first << ' ' << p.second; return out;}
template<class T> istream& operator>>(istream& in, vector<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<T> &a) {for (auto &i: a) out << i << ' '; return out;}
template<class T> istream& operator>>(istream& in, vector<vector<T>> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<vector<T>> &a) {for (auto &i: a) out << i << '\n'; return out;}
template<class T> istream& operator>>(istream& in, deque<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const deque<T> &a) {for (auto &i: a) out << i << ' '; return out;}
// istream& operator>>(istream& in, __int128_t &a) {string s; in >> s; a = 0; for (auto &i: s) a = a*10 + (i - '0'); return in;}
// ostream& operator<<(ostream& out, __int128_t a) {string s = ""; while (a > 0) {s+=(int)(a % 10) + '0'; a/=10;} Reverse(s); out << s; return out;}

const int N = 1e6 + 5;
int a[N], f[N], p[N];
vector<pair<pii, int>> t[N];
template<class T>
struct segtree_max {
    int n;
    vector<T> t;
    T merge(T a, T b) {return max(a, b);}
    void init(int N) {n = N; t.assign(2*n, numeric_limits<T>::min());}
    void set(int i, T v) {
        for (t[i+=n] = v; i > 1; i>>=1) t[i >> 1] = merge(t[i], t[i^1]);
    }
    void build(const vector<T> &a) {
        for (int i = 0; i < n; i++) set(i, a[i]);
    }
    T get(int l, int r) {
        r++;
        T x = numeric_limits<T>::min();
        for (l+=n, r+=n; l < r; l>>=1, r>>=1) {
            if (l & 1) x = merge(x, t[l++]);
            if (r & 1) x = merge(x, t[--r]);
        }
        return x;
    }
};
int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    cout << fixed << setprecision(10);
    int n, q; cin >> n >> q;
    vi s;
    FOR(i,1,n){
        cin >> a[i];
        while (sz(s) && a[s.back()] <= a[i]) s.pop_back();
        if (sz(s)) f[i] = s.back();
        s.pb(i);
    }
    For(i,0,q){
        int l, r, c; cin >> l >> r >> c;
        t[r].pb({{l, c}, i});
    }
    segtree_max<int> b; b.init(n + 5);
    FOR(i,1,n){
        b.set(f[i], a[i] + a[f[i]]);
        for (auto [_, j]: t[i]) {
            auto [l, c] = _;
            if (b.get(l, i) <= c) p[j] = 1;
        }
    }
    For(i,0,q) cout << p[i] << '\n';
    return 0;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 29272 KB Output is correct
2 Correct 6 ms 27224 KB Output is correct
3 Correct 6 ms 29276 KB Output is correct
4 Correct 8 ms 29528 KB Output is correct
5 Correct 7 ms 29276 KB Output is correct
6 Correct 6 ms 29276 KB Output is correct
7 Correct 6 ms 29276 KB Output is correct
8 Correct 6 ms 29276 KB Output is correct
9 Correct 6 ms 29276 KB Output is correct
10 Correct 8 ms 29276 KB Output is correct
11 Correct 8 ms 29276 KB Output is correct
12 Correct 7 ms 29524 KB Output is correct
13 Correct 7 ms 29528 KB Output is correct
14 Correct 7 ms 29668 KB Output is correct
15 Correct 8 ms 29532 KB Output is correct
16 Correct 8 ms 29532 KB Output is correct
17 Correct 7 ms 29532 KB Output is correct
18 Correct 7 ms 29532 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 566 ms 84200 KB Output is correct
2 Correct 589 ms 84940 KB Output is correct
3 Correct 641 ms 84692 KB Output is correct
4 Correct 633 ms 84952 KB Output is correct
5 Correct 652 ms 81016 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 33652 KB Output is correct
2 Correct 50 ms 33304 KB Output is correct
3 Correct 51 ms 31396 KB Output is correct
4 Correct 50 ms 32284 KB Output is correct
5 Correct 42 ms 32204 KB Output is correct
6 Correct 36 ms 33652 KB Output is correct
7 Correct 32 ms 33684 KB Output is correct
8 Correct 44 ms 33764 KB Output is correct
9 Correct 25 ms 32172 KB Output is correct
10 Correct 40 ms 33776 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 29272 KB Output is correct
2 Correct 6 ms 27224 KB Output is correct
3 Correct 6 ms 29276 KB Output is correct
4 Correct 8 ms 29528 KB Output is correct
5 Correct 7 ms 29276 KB Output is correct
6 Correct 6 ms 29276 KB Output is correct
7 Correct 6 ms 29276 KB Output is correct
8 Correct 6 ms 29276 KB Output is correct
9 Correct 6 ms 29276 KB Output is correct
10 Correct 8 ms 29276 KB Output is correct
11 Correct 8 ms 29276 KB Output is correct
12 Correct 7 ms 29524 KB Output is correct
13 Correct 7 ms 29528 KB Output is correct
14 Correct 7 ms 29668 KB Output is correct
15 Correct 8 ms 29532 KB Output is correct
16 Correct 8 ms 29532 KB Output is correct
17 Correct 7 ms 29532 KB Output is correct
18 Correct 7 ms 29532 KB Output is correct
19 Correct 109 ms 39292 KB Output is correct
20 Correct 113 ms 38992 KB Output is correct
21 Correct 96 ms 38592 KB Output is correct
22 Correct 94 ms 38432 KB Output is correct
23 Correct 90 ms 38484 KB Output is correct
24 Correct 95 ms 36144 KB Output is correct
25 Correct 81 ms 39060 KB Output is correct
26 Correct 89 ms 39624 KB Output is correct
27 Correct 96 ms 39444 KB Output is correct
28 Correct 92 ms 39660 KB Output is correct
29 Correct 113 ms 40080 KB Output is correct
30 Correct 105 ms 40044 KB Output is correct
31 Correct 100 ms 39880 KB Output is correct
32 Correct 107 ms 39848 KB Output is correct
33 Correct 119 ms 40016 KB Output is correct
34 Correct 68 ms 40784 KB Output is correct
35 Correct 67 ms 40784 KB Output is correct
36 Correct 67 ms 40596 KB Output is correct
37 Correct 68 ms 40556 KB Output is correct
38 Correct 74 ms 40732 KB Output is correct
39 Correct 77 ms 40196 KB Output is correct
40 Correct 65 ms 38660 KB Output is correct
41 Correct 75 ms 39684 KB Output is correct

Subtask #6
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 29272 KB Output is correct
2 Correct 6 ms 27224 KB Output is correct
3 Correct 6 ms 29276 KB Output is correct
4 Correct 8 ms 29528 KB Output is correct
5 Correct 7 ms 29276 KB Output is correct
6 Correct 6 ms 29276 KB Output is correct
7 Correct 6 ms 29276 KB Output is correct
8 Correct 6 ms 29276 KB Output is correct
9 Correct 6 ms 29276 KB Output is correct
10 Correct 8 ms 29276 KB Output is correct
11 Correct 8 ms 29276 KB Output is correct
12 Correct 7 ms 29524 KB Output is correct
13 Correct 7 ms 29528 KB Output is correct
14 Correct 7 ms 29668 KB Output is correct
15 Correct 8 ms 29532 KB Output is correct
16 Correct 8 ms 29532 KB Output is correct
17 Correct 7 ms 29532 KB Output is correct
18 Correct 7 ms 29532 KB Output is correct
19 Correct 566 ms 84200 KB Output is correct
20 Correct 589 ms 84940 KB Output is correct
21 Correct 641 ms 84692 KB Output is correct
22 Correct 633 ms 84952 KB Output is correct
23 Correct 652 ms 81016 KB Output is correct
24 Correct 55 ms 33652 KB Output is correct
25 Correct 50 ms 33304 KB Output is correct
26 Correct 51 ms 31396 KB Output is correct
27 Correct 50 ms 32284 KB Output is correct
28 Correct 42 ms 32204 KB Output is correct
29 Correct 36 ms 33652 KB Output is correct
30 Correct 32 ms 33684 KB Output is correct
31 Correct 44 ms 33764 KB Output is correct
32 Correct 25 ms 32172 KB Output is correct
33 Correct 40 ms 33776 KB Output is correct
34 Correct 109 ms 39292 KB Output is correct
35 Correct 113 ms 38992 KB Output is correct
36 Correct 96 ms 38592 KB Output is correct
37 Correct 94 ms 38432 KB Output is correct
38 Correct 90 ms 38484 KB Output is correct
39 Correct 95 ms 36144 KB Output is correct
40 Correct 81 ms 39060 KB Output is correct
41 Correct 89 ms 39624 KB Output is correct
42 Correct 96 ms 39444 KB Output is correct
43 Correct 92 ms 39660 KB Output is correct
44 Correct 113 ms 40080 KB Output is correct
45 Correct 105 ms 40044 KB Output is correct
46 Correct 100 ms 39880 KB Output is correct
47 Correct 107 ms 39848 KB Output is correct
48 Correct 119 ms 40016 KB Output is correct
49 Correct 68 ms 40784 KB Output is correct
50 Correct 67 ms 40784 KB Output is correct
51 Correct 67 ms 40596 KB Output is correct
52 Correct 68 ms 40556 KB Output is correct
53 Correct 74 ms 40732 KB Output is correct
54 Correct 77 ms 40196 KB Output is correct
55 Correct 65 ms 38660 KB Output is correct
56 Correct 75 ms 39684 KB Output is correct
57 Correct 537 ms 98644 KB Output is correct
58 Correct 539 ms 98728 KB Output is correct
59 Correct 504 ms 97108 KB Output is correct
60 Correct 478 ms 97104 KB Output is correct
61 Correct 482 ms 97108 KB Output is correct
62 Correct 490 ms 97052 KB Output is correct
63 Correct 341 ms 90788 KB Output is correct
64 Correct 342 ms 90448 KB Output is correct
65 Correct 467 ms 93268 KB Output is correct
66 Correct 481 ms 93340 KB Output is correct
67 Correct 461 ms 93524 KB Output is correct
68 Correct 521 ms 94972 KB Output is correct
69 Correct 491 ms 95056 KB Output is correct
70 Correct 505 ms 94668 KB Output is correct
71 Correct 535 ms 94704 KB Output is correct
72 Correct 515 ms 94800 KB Output is correct
73 Correct 305 ms 88748 KB Output is correct
74 Correct 321 ms 89684 KB Output is correct
75 Correct 305 ms 88660 KB Output is correct
76 Correct 316 ms 88916 KB Output is correct
77 Correct 303 ms 88660 KB Output is correct
78 Correct 427 ms 91388 KB Output is correct
79 Correct 355 ms 80880 KB Output is correct
80 Correct 410 ms 90480 KB Output is correct