oj.uz

Submission #955234

# Submission time Handle Problem Language Result Execution time Memory
955234 2024-03-29T21:44:55 Z MarwenElarbi Railway Trip 2 (JOI22_ho_t4) C++17
100 / 100
 919 ms 66092 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define vi vector<int>
#define ve vector
#define ll long long
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define onbit __builtin_popcount
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 1e18
#define eps 1e-7
#define eps1 1e-2
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 1e5+5
using namespace std;
using namespace __gnu_pbds;
template <class T>
using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const ll MOD = 1e9+7;
const int nax = 1e5+5;
const int MAX_VAL = 1e6+1;
double PI=3.14159265359;
int arx[8]={1,0,0,-1,-1,-1, 1, 1};
int ary[8]={0,1,-1, 0, 1,-1,-1, 1};
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
int lg=18;
ii segtree[nax*4][18];
void update(int pos,int l,int r,int idx,ii value,int level){
    if(l==r){
        segtree[pos][level]=value;
        return;
    }
    int mid=(r+l)/2;
    if(idx<=mid) update(pos*2+1,l,mid,idx,value,level);
    else update(pos*2+2,mid+1,r,idx,value,level);
    segtree[pos][level].fi=max(segtree[pos*2+1][level].fi,segtree[pos*2+2][level].fi);
    segtree[pos][level].se=min(segtree[pos*2+1][level].se,segtree[pos*2+2][level].se);
    //cout <<l<<" "<<r<<" "<<segtree[pos][level].fi<<" "<<segtree[pos][level].se<<endl;
    return;
}
ii query(int pos,int l,int r,int left,int right,int level){
    if(l>r||l>right||r<left) return {-1e9,1e9};
    if(l>=left&&r<=right) return segtree[pos][level];
    int mid=(r+l)/2;
    ii a=query(pos*2+1,l,mid,left,right,level);
    ii b=query(pos*2+2,mid+1,r,left,right,level);
    //cout <<"sd"<<" "<<l<<" "<<r<<" "<<max(a.fi,b.fi)<<" "<<min(a.se,b.se)<<endl;
    return {max(a.fi,b.fi),min(a.se,b.se)};
}
int main(){
    optimise;
    //setIO("dec");
    int n,k;
    cin>>n>>k;
    int m;
    cin>>m;
    int a[n+1];
    int b[n+1];
    for (int i = 0; i <= n; ++i)
    {
        a[i]=0;
        b[i]=1e9;
    }
    for (int i = 0; i < m; ++i)
    {
        int x,y;
        cin>>x>>y;
        if(x<y) a[x]=max(a[x],y);
        else b[x]=min(b[x],y);
    }
    multiset<int> st;
    int mx[n+1];
    int mn[n+1];
    for (int i = 0; i <= n; ++i)
    {
        if(i>=k){
            st.erase(st.find(a[i-k]));
        }
        st.insert(a[i]);
        mx[i]=max(i,(*--st.end()));
    }
    st.clear();
    for (int i = n; i >= 0; --i)
    {
        if(i<=n-k){
            st.erase(st.find(b[i+k]));
        }
        st.insert(b[i]);
        //cout <<*st.begin()<<endl;
        mn[i]=min(i,(*st.begin()));
    }
    for (int i = 0; i < nax*4; ++i)
    {
        for (int j = 0; j < 18; ++j)
        {
            segtree[i][j]={-1e9,1e9};
        }
    }
    for (int i = 0; i <= n; ++i)
    {
        update(0,0,n,i,{mx[i],mn[i]},0);
        //cout <<mx[i]<<" "<<mn[i]<<endl;
    }
    for (int i = 1; i < lg; ++i)
    {
        for (int j = 0; j <= n; ++j)
        {
            ii a=query(0,0,n,mn[j],mx[j],i-1);
            //cout <<mn[j]<<" "<<mx[j]<<" "<<a.fi<<" "<<a.se<<endl;
            update(0,0,n,j,a,i);
            mx[j]=a.fi;
            mn[j]=a.se;
            //cout <<mn[j]<<" "<<mx[j]<<endl;
        }
    }
    int q;
    cin>>q;
    while(q--){
        int s,t;
        cin>>s>>t;
        if(t<mn[s]||t>mx[s]) {
            cout <<-1<<'\n';
            continue;
        }
        int ans=0;
        ii cur={s,s};
        for (int i = 16; i >=0 ; --i)
        {
            ii nxt=query(0,0,n,cur.se,cur.fi,i);
            if(t>nxt.fi||t<nxt.se){
                cur=nxt;
                ans+=(1<<i);
            }
        }
        cout <<ans+1<<'\n';
    }
}

Compilation message

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

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 56924 KB Output is correct
2 Correct 9 ms 56732 KB Output is correct
3 Correct 9 ms 56664 KB Output is correct
4 Correct 10 ms 56668 KB Output is correct
5 Correct 9 ms 56668 KB Output is correct
6 Correct 9 ms 56668 KB Output is correct
7 Correct 9 ms 56736 KB Output is correct
8 Correct 11 ms 56672 KB Output is correct
9 Correct 9 ms 56668 KB Output is correct
10 Correct 8 ms 56668 KB Output is correct
11 Correct 9 ms 56668 KB Output is correct
12 Correct 9 ms 56784 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 56924 KB Output is correct
2 Correct 9 ms 56732 KB Output is correct
3 Correct 9 ms 56664 KB Output is correct
4 Correct 10 ms 56668 KB Output is correct
5 Correct 9 ms 56668 KB Output is correct
6 Correct 9 ms 56668 KB Output is correct
7 Correct 9 ms 56736 KB Output is correct
8 Correct 11 ms 56672 KB Output is correct
9 Correct 9 ms 56668 KB Output is correct
10 Correct 8 ms 56668 KB Output is correct
11 Correct 9 ms 56668 KB Output is correct
12 Correct 9 ms 56784 KB Output is correct
13 Correct 21 ms 56668 KB Output is correct
14 Correct 18 ms 56664 KB Output is correct
15 Correct 17 ms 56672 KB Output is correct
16 Correct 14 ms 56924 KB Output is correct
17 Correct 18 ms 56848 KB Output is correct
18 Correct 17 ms 56912 KB Output is correct
19 Correct 16 ms 56668 KB Output is correct
20 Correct 16 ms 56668 KB Output is correct
21 Correct 14 ms 56880 KB Output is correct
22 Correct 16 ms 56920 KB Output is correct
23 Correct 18 ms 56668 KB Output is correct
24 Correct 18 ms 56924 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 705 ms 58404 KB Output is correct
2 Correct 669 ms 58452 KB Output is correct
3 Correct 722 ms 58192 KB Output is correct
4 Correct 664 ms 58448 KB Output is correct
5 Correct 458 ms 60748 KB Output is correct
6 Correct 671 ms 58568 KB Output is correct
7 Correct 514 ms 63052 KB Output is correct
8 Correct 506 ms 60244 KB Output is correct
9 Correct 522 ms 63060 KB Output is correct
10 Correct 546 ms 58356 KB Output is correct
11 Correct 552 ms 63056 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 748 ms 63156 KB Output is correct
2 Correct 617 ms 65864 KB Output is correct
3 Correct 852 ms 64728 KB Output is correct
4 Correct 607 ms 65620 KB Output is correct
5 Correct 602 ms 65776 KB Output is correct
6 Correct 602 ms 65744 KB Output is correct
7 Correct 691 ms 65960 KB Output is correct
8 Correct 718 ms 65868 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 536 ms 59392 KB Output is correct
2 Correct 849 ms 58912 KB Output is correct
3 Correct 797 ms 59636 KB Output is correct
4 Correct 792 ms 59388 KB Output is correct
5 Correct 722 ms 59108 KB Output is correct
6 Correct 692 ms 58992 KB Output is correct
7 Correct 592 ms 64712 KB Output is correct
8 Correct 10 ms 56664 KB Output is correct
9 Correct 17 ms 56924 KB Output is correct
10 Correct 524 ms 61912 KB Output is correct
11 Correct 608 ms 65876 KB Output is correct
12 Correct 609 ms 62040 KB Output is correct
13 Correct 598 ms 64056 KB Output is correct
14 Correct 9 ms 56664 KB Output is correct
15 Correct 18 ms 56840 KB Output is correct
16 Correct 572 ms 60668 KB Output is correct
17 Correct 785 ms 66092 KB Output is correct
18 Correct 768 ms 61340 KB Output is correct
19 Correct 708 ms 61168 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 56924 KB Output is correct
2 Correct 9 ms 56732 KB Output is correct
3 Correct 9 ms 56664 KB Output is correct
4 Correct 10 ms 56668 KB Output is correct
5 Correct 9 ms 56668 KB Output is correct
6 Correct 9 ms 56668 KB Output is correct
7 Correct 9 ms 56736 KB Output is correct
8 Correct 11 ms 56672 KB Output is correct
9 Correct 9 ms 56668 KB Output is correct
10 Correct 8 ms 56668 KB Output is correct
11 Correct 9 ms 56668 KB Output is correct
12 Correct 9 ms 56784 KB Output is correct
13 Correct 21 ms 56668 KB Output is correct
14 Correct 18 ms 56664 KB Output is correct
15 Correct 17 ms 56672 KB Output is correct
16 Correct 14 ms 56924 KB Output is correct
17 Correct 18 ms 56848 KB Output is correct
18 Correct 17 ms 56912 KB Output is correct
19 Correct 16 ms 56668 KB Output is correct
20 Correct 16 ms 56668 KB Output is correct
21 Correct 14 ms 56880 KB Output is correct
22 Correct 16 ms 56920 KB Output is correct
23 Correct 18 ms 56668 KB Output is correct
24 Correct 18 ms 56924 KB Output is correct
25 Correct 705 ms 58404 KB Output is correct
26 Correct 669 ms 58452 KB Output is correct
27 Correct 722 ms 58192 KB Output is correct
28 Correct 664 ms 58448 KB Output is correct
29 Correct 458 ms 60748 KB Output is correct
30 Correct 671 ms 58568 KB Output is correct
31 Correct 514 ms 63052 KB Output is correct
32 Correct 506 ms 60244 KB Output is correct
33 Correct 522 ms 63060 KB Output is correct
34 Correct 546 ms 58356 KB Output is correct
35 Correct 552 ms 63056 KB Output is correct
36 Correct 748 ms 63156 KB Output is correct
37 Correct 617 ms 65864 KB Output is correct
38 Correct 852 ms 64728 KB Output is correct
39 Correct 607 ms 65620 KB Output is correct
40 Correct 602 ms 65776 KB Output is correct
41 Correct 602 ms 65744 KB Output is correct
42 Correct 691 ms 65960 KB Output is correct
43 Correct 718 ms 65868 KB Output is correct
44 Correct 536 ms 59392 KB Output is correct
45 Correct 849 ms 58912 KB Output is correct
46 Correct 797 ms 59636 KB Output is correct
47 Correct 792 ms 59388 KB Output is correct
48 Correct 722 ms 59108 KB Output is correct
49 Correct 692 ms 58992 KB Output is correct
50 Correct 592 ms 64712 KB Output is correct
51 Correct 10 ms 56664 KB Output is correct
52 Correct 17 ms 56924 KB Output is correct
53 Correct 524 ms 61912 KB Output is correct
54 Correct 608 ms 65876 KB Output is correct
55 Correct 609 ms 62040 KB Output is correct
56 Correct 598 ms 64056 KB Output is correct
57 Correct 9 ms 56664 KB Output is correct
58 Correct 18 ms 56840 KB Output is correct
59 Correct 572 ms 60668 KB Output is correct
60 Correct 785 ms 66092 KB Output is correct
61 Correct 768 ms 61340 KB Output is correct
62 Correct 708 ms 61168 KB Output is correct
63 Correct 804 ms 59884 KB Output is correct
64 Correct 883 ms 60136 KB Output is correct
65 Correct 780 ms 59988 KB Output is correct
66 Correct 452 ms 65548 KB Output is correct
67 Correct 919 ms 61324 KB Output is correct
68 Correct 730 ms 61564 KB Output is correct
69 Correct 630 ms 63724 KB Output is correct
70 Correct 632 ms 61176 KB Output is correct
71 Correct 695 ms 61268 KB Output is correct