제출 #927587

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
927587		yeediot	Railway Trip 2 (JOI22_ho_t4)	C++14	100 / 100	1384 ms	174884 KiB

Main

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
struct line{
    int a,b;
    int operator()(const int x)const{
        return a*x+b;
    }
};
bool check(line l1,line l2,line l3){
    return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a);
}
const int mxn=1e5+5;
vector<int>in[mxn],out[mxn];
int l[20][mxn],r[20][mxn];
pii seg[20][4*mxn];
void pull(pii&p,pii a,pii b){
    p={min(a.F,b.F),max(a.S,b.S)};
}
void build(int ll,int rr,int id,int k){
    if(ll==rr){
        seg[k][id]={l[k][ll],r[k][ll]};
        return;
    }
    int mm=ll+rr>>1;
    build(ll,mm,id*2,k);
    build(mm+1,rr,id*2+1,k);
    pull(seg[k][id],seg[k][id*2],seg[k][id*2+1]);
}
int query(int l,int r,int id,int ql,int qr,bool tf,int k){
    if(qr<l or r<ql){
        if(tf){
            return 8e18;
        }
        else{
            return -8e18;
        }
    }
    if(ql<=l and r<=qr){
        if(tf)return seg[k][id].F;
        else return seg[k][id].S;
    }
    int mm=l+r>>1;
    if(tf){
        return min(query(l,mm,id*2,ql,qr,tf,k),query(mm+1,r,id*2+1,ql,qr,tf,k));
    }
    else{
        return max(query(l,mm,id*2,ql,qr,tf,k),query(mm+1,r,id*2+1,ql,qr,tf,k));
    }
}
signed main(){
    setio();
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n,k,m;
    cin>>n>>k>>m;
    for(int i=0;i<m;i++){
        int l,r;
        cin>>l>>r;
        if(l<r){
            in[l].pb(r);
            out[min(r-1,l+k-1)].pb(r);
        }
        else{
            in[max(r+1,l-k+1)].pb(r);
            out[l].pb(r);
        }
    }
    multiset<int>st;
    for(int i=1;i<=n;i++){
        for(auto x:in[i]){
            st.insert(x);
        }
        l[0][i]=r[0][i]=i;
        if(!sz(st))continue;
        l[0][i]=min(i,*st.begin());
        r[0][i]=max(*prev(st.end()),i);
        debug(st,i,l[0][i],r[0][i]);
        for(auto x:out[i]){
            st.erase(st.find(x));
        }
    }
    build(1,n,1,0);
    for(int i=1;i<20;i++){
        for(int j=1;j<=n;j++){
            l[i][j]=query(1,n,1,l[i-1][j],r[i-1][j],1,i-1);
            r[i][j]=query(1,n,1,l[i-1][j],r[i-1][j],0,i-1);
            debug(l[i][j],r[i][j]);
        }
        build(1,n,1,i);
    }
    int q;
    cin>>q;
    while(q--){
        int ql,qr;
        cin>>ql>>qr;
        if(ql==qr){
            cout<<0<<'\n';
            continue;
        }
        int ans=0;
        int curl=ql;
        int curr=ql;
        for(int i=19;i>=0;i--){
            int L=query(1,n,1,curl,curr,1,i);
            int R=query(1,n,1,curl,curr,0,i);
            if(L<=qr and qr<=R)continue;
            curl=L;
            curr=R;
            ans+=(1<<i);
        }
        int L=query(1,n,1,curl,curr,1,0);
        int R=query(1,n,1,curl,curr,0,0);
        if(L<=qr and qr<=R){
            ans++;
        }
        else ans=-1;
        cout<<ans<<'\n';
    }
}
 /*
 input:
 
 */















 

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In function 'void build(long long int, long long int, long long int, long long int)':
Main.cpp:66:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   66 |     int mm=ll+rr>>1;
      |            ~~^~~
Main.cpp: In function 'long long int query(long long int, long long int, long long int, long long int, long long int, bool, long long int)':
Main.cpp:84:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   84 |     int mm=l+r>>1;
      |            ~^~
Main.cpp: In function 'void setIO(std::string)':
Main.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 8 / 8
• Subtask 2: 8 / 8
• Subtask 3: 11 / 11
• Subtask 4: 25 / 25
• Subtask 5: 35 / 35
• Subtask 6: 13 / 13