oj.uz

Submission #890805

# Submission time Handle Problem Language Result Execution time Memory
890805 2023-12-22T03:40:43 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 3000 ms 131160 KB 
#include "bits/stdc++.h"
using namespace std;       

// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")

using ll = long long;
using ld = long double;
#define pb push_back
#define ff first
#define ss second
#define sz(x) (ll)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
void IOIGold2024_InshAllah() { ios_base::sync_with_stdio(false); cin.tie(NULL); }
ll binmul(ll a, ll b, ll c) { ll res = 0; while(b) { if(b&1) (res += a) %= c; (a += a) %= c; b >>= 1; } return res; }
ll binpow(ll a, ll b, ll c) { ll res = 1; while(b) { if(b&1) (res *= a) %= c; (a *= a) %= c; b >>= 1; } return res; }
template<typename T> T gcd(T a, T b) { if(b==0) return a; return gcd(b, a%b); }
template<typename T> T lcm(T a, T b) { return a/gcd(a, b)*b; }
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ld rnd() { return rng()%INT_MAX*1.0/INT_MAX; }

const ll inf = 1e18+7, MX = LLONG_MAX, MN = LLONG_MIN;
const ll mod = 1e9+7, N = 1e6+5;
#define ll int
ll a[N], t[N][20], lg[N], res[N], bsz;
vector<ll> g[N];

ll get(ll l, ll r) {
    if(l>r) return 0;
    ll k = lg[r-l+1];
    return max(t[l][k], t[r-(1<<k)+1][k]);
}

void kigash() {
    ll n, q;
    cin>>n>>q, bsz = min(n, 900);
    ll mx = 0;
    for(ll i=1; i<=n; i++) {
        if(i>1) lg[i] = lg[i/2]+1;
        cin>>a[i], t[i][0] = a[i];
        if(a[i]<mx) res[(i+bsz-1)/bsz] = max(res[(i+bsz-1)/bsz], a[i]+mx);
        mx = max(mx, a[i]);
        g[(i+bsz-1)/bsz].pb(a[i]);
        if(i%bsz==0) mx = 0;
    }
    for(ll i=1; i<=n; i++) sort(all(g[i]));
    for(ll j=1; j<20; j++) {
        for(ll i=1; i+(1<<j)-1<=n; i++) {
            t[i][j] = max(t[i][j-1], t[i+(1<<(j-1))][j-1]);
        }
    }
    while(q--) {
        ll l, r, k, f = 0, mx = 0, i;
        cin>>l>>r>>k, i = l;
        for(i=l; i<=r && (i+bsz-1)/bsz==(l+bsz-1)/bsz; i++) {
            if(a[i]<mx) f = max(f, a[i]+mx);
            mx = max(mx, a[i]);
        }
        for(; i<=r && (i+bsz-1)/bsz!=(r+bsz-1)/bsz; i += bsz) {
            f = max(f, res[(i+bsz-1)/bsz]);
            mx = get(l, i-1);
            ll pos = lower_bound(all(g[(i+bsz-1)/bsz]), mx)-g[(i+bsz-1)/bsz].begin()-1;
            if(pos>-1) f = max(f, mx+g[(i+bsz-1)/bsz][pos]);
        }
        mx = get(l, i-1);
        for(; i<=r; i++) {
            if(a[i]<mx) f = max(f, a[i]+mx);
            mx = max(mx, a[i]);
        }
        cout<<(f>k ? 0 : 1)<<"\n";
    }
    return;
}

signed main(/*Kigash Amir*/) {
    // freopen("");
    IOIGold2024_InshAllah();
    ll tt = 1;
    // cin>>tt;
    for(ll i=1; i<=tt; i++) {
        kigash();
    }
}

Compilation message

sortbooks.cpp: In function 'void freopen(std::string)':
sortbooks.cpp:17:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 | void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
      |                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sortbooks.cpp:17:73: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 | void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
      |                                                                  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 29276 KB Output is correct
2 Correct 6 ms 29280 KB Output is correct
3 Correct 6 ms 29276 KB Output is correct
4 Correct 6 ms 29276 KB Output is correct
5 Correct 6 ms 29276 KB Output is correct
6 Correct 6 ms 29272 KB Output is correct
7 Correct 6 ms 29272 KB Output is correct
8 Correct 7 ms 29276 KB Output is correct
9 Correct 7 ms 29324 KB Output is correct
10 Correct 7 ms 29276 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 29276 KB Output is correct
2 Correct 6 ms 29280 KB Output is correct
3 Correct 6 ms 29276 KB Output is correct
4 Correct 6 ms 29276 KB Output is correct
5 Correct 6 ms 29276 KB Output is correct
6 Correct 6 ms 29272 KB Output is correct
7 Correct 6 ms 29272 KB Output is correct
8 Correct 7 ms 29276 KB Output is correct
9 Correct 7 ms 29324 KB Output is correct
10 Correct 7 ms 29276 KB Output is correct
11 Correct 12 ms 29276 KB Output is correct
12 Correct 13 ms 29528 KB Output is correct
13 Correct 14 ms 29532 KB Output is correct
14 Correct 19 ms 29532 KB Output is correct
15 Correct 19 ms 29572 KB Output is correct
16 Correct 22 ms 29532 KB Output is correct
17 Correct 23 ms 29276 KB Output is correct
18 Correct 22 ms 29276 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 371 ms 38320 KB Output is correct
2 Correct 465 ms 38264 KB Output is correct
3 Correct 377 ms 38320 KB Output is correct
4 Correct 356 ms 38328 KB Output is correct
5 Correct 341 ms 38424 KB Output is correct
6 Correct 428 ms 38364 KB Output is correct
7 Correct 424 ms 38228 KB Output is correct
8 Correct 460 ms 38052 KB Output is correct
9 Correct 164 ms 30808 KB Output is correct
10 Correct 475 ms 37972 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 29276 KB Output is correct
2 Correct 6 ms 29280 KB Output is correct
3 Correct 6 ms 29276 KB Output is correct
4 Correct 6 ms 29276 KB Output is correct
5 Correct 6 ms 29276 KB Output is correct
6 Correct 6 ms 29272 KB Output is correct
7 Correct 6 ms 29272 KB Output is correct
8 Correct 7 ms 29276 KB Output is correct
9 Correct 7 ms 29324 KB Output is correct
10 Correct 7 ms 29276 KB Output is correct
11 Correct 12 ms 29276 KB Output is correct
12 Correct 13 ms 29528 KB Output is correct
13 Correct 14 ms 29532 KB Output is correct
14 Correct 19 ms 29532 KB Output is correct
15 Correct 19 ms 29572 KB Output is correct
16 Correct 22 ms 29532 KB Output is correct
17 Correct 23 ms 29276 KB Output is correct
18 Correct 22 ms 29276 KB Output is correct
19 Correct 883 ms 52200 KB Output is correct
20 Correct 895 ms 52160 KB Output is correct
21 Correct 1298 ms 52280 KB Output is correct
22 Correct 1349 ms 52220 KB Output is correct
23 Correct 1279 ms 52192 KB Output is correct
24 Correct 1138 ms 52048 KB Output is correct
25 Correct 1141 ms 52240 KB Output is correct
26 Correct 1063 ms 52152 KB Output is correct
27 Correct 1057 ms 52236 KB Output is correct
28 Correct 989 ms 52308 KB Output is correct
29 Correct 809 ms 52388 KB Output is correct
30 Correct 807 ms 52272 KB Output is correct
31 Correct 826 ms 52168 KB Output is correct
32 Correct 882 ms 52368 KB Output is correct
33 Correct 853 ms 52456 KB Output is correct
34 Correct 1152 ms 52220 KB Output is correct
35 Correct 1167 ms 52200 KB Output is correct
36 Correct 1153 ms 51784 KB Output is correct
37 Correct 1128 ms 51964 KB Output is correct
38 Correct 1146 ms 51796 KB Output is correct
39 Correct 1149 ms 50888 KB Output is correct
40 Correct 1046 ms 45764 KB Output is correct
41 Correct 1161 ms 50660 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 29276 KB Output is correct
2 Correct 6 ms 29280 KB Output is correct
3 Correct 6 ms 29276 KB Output is correct
4 Correct 6 ms 29276 KB Output is correct
5 Correct 6 ms 29276 KB Output is correct
6 Correct 6 ms 29272 KB Output is correct
7 Correct 6 ms 29272 KB Output is correct
8 Correct 7 ms 29276 KB Output is correct
9 Correct 7 ms 29324 KB Output is correct
10 Correct 7 ms 29276 KB Output is correct
11 Correct 12 ms 29276 KB Output is correct
12 Correct 13 ms 29528 KB Output is correct
13 Correct 14 ms 29532 KB Output is correct
14 Correct 19 ms 29532 KB Output is correct
15 Correct 19 ms 29572 KB Output is correct
16 Correct 22 ms 29532 KB Output is correct
17 Correct 23 ms 29276 KB Output is correct
18 Correct 22 ms 29276 KB Output is correct
19 Execution timed out 3036 ms 131160 KB Time limit exceeded
20 Halted 0 ms 0 KB -