oj.uz

Submission #659186

# Submission time Handle Problem Language Result Execution time Memory
659186 2022-11-16T23:56:37 Z zaneyu Event Hopping 2 (JOI21_event2) C++14
1 / 100
 136 ms 27336 KB 
/*input
5 2
4 10
4 5
1 2
2 3
3 6
*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace __gnu_pbds;
typedef tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<ll,ll>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET(v,x) lower_bound(ALL(v),x)-v.begin()
const int maxn=2e5+5;
const ll INF=0x3f3f3f3f;
const ld PI=acos(-1.0l);
const ld eps=1e-6;
const ll INF64=4e18+1;
const int MOD=1e9+7;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?"\n":"");
    return out;
}
inline ll mult(ll a,ll b){
    return a*b%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
int l[maxn],r[maxn];
int suff[maxn];
int mn[maxn][20];
int get(int l,int r){
    int ans=0;
    for(int j=19;j>=0;j--){
        if(mn[l][j]<=r){
            l=mn[l][j];
            ans+=(1<<j);
        }
    }
    return ans;
}
int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n,k;
    cin>>n>>k;
    vector<pii> v;
    vector<int> dsc;
    REP(i,n){
        cin>>l[i]>>r[i];
        //--r[i];
        dsc.pb(l[i]),dsc.pb(r[i]);
    }
    SORT_UNIQUE(dsc);
    REP(i,2*n) suff[i]=INF;
    REP(i,n){
        l[i]=GET(dsc,l[i]),r[i]=GET(dsc,r[i]);
        MNTO(suff[l[i]],r[i]);
    }  
    for(int i=2*n-2;i>=0;i--) MNTO(suff[i],suff[i+1]);
    REP(i,2*n){
        //cout<<suff[i]<<' ';
        mn[i][0]=suff[i];
    }
    REP1(j,19){
        REP(i,2*n){
            if(mn[i][j-1]<INF) mn[i][j]=mn[mn[i][j-1]][j-1];
            else mn[i][j]=INF;
            //cout<<i<<' '<<j<<' '<<mn[i][j]<<'\n';
        }
    }
    set<pii> s;
    s.insert({0,0}),s.insert({2*n-1,2*n-1});
    vector<int> ans;
    int tot=get(0,2*n-1);
    if(tot<k){
        cout<<-1;
        return 0;
    }
    REP(i,n){
        auto it=s.lower_bound({l[i],r[i]});
        if((it!=s.begin() and (*prev(it)).s>l[i]) or (it!=s.end() and ((*it).f)<r[i])){
            continue;
        }
        if(tot-get((*prev(it)).s,(*it).f)+1+get((*prev(it)).s,l[i])+get(r[i],(*it).f)>=k){
            s.insert({l[i],r[i]});
            ans.pb(i+1);
        }
        if(sz(ans)==k) break;
    }
    if(sz(ans)!=k) cout<<-1;
    else cout<<ans;
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 136 ms 25404 KB Output is correct
5 Correct 132 ms 26944 KB Output is correct
6 Correct 126 ms 26640 KB Output is correct
7 Correct 121 ms 25908 KB Output is correct
8 Correct 132 ms 27336 KB Output is correct
9 Correct 128 ms 27072 KB Output is correct
10 Correct 130 ms 26580 KB Output is correct
11 Correct 117 ms 25968 KB Output is correct
12 Correct 127 ms 24596 KB Output is correct
13 Correct 116 ms 24340 KB Output is correct
14 Correct 108 ms 24212 KB Output is correct
15 Correct 104 ms 23680 KB Output is correct
16 Correct 93 ms 21188 KB Output is correct
17 Correct 86 ms 21124 KB Output is correct
18 Correct 83 ms 20960 KB Output is correct
19 Correct 74 ms 20404 KB Output is correct
20 Incorrect 79 ms 20356 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 332 KB Output is correct

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 2 ms 980 KB Output is correct
29 Incorrect 2 ms 980 KB Output isn't correct
30 Halted 0 ms 0 KB -

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 136 ms 25404 KB Output is correct
5 Correct 132 ms 26944 KB Output is correct
6 Correct 126 ms 26640 KB Output is correct
7 Correct 121 ms 25908 KB Output is correct
8 Correct 132 ms 27336 KB Output is correct
9 Correct 128 ms 27072 KB Output is correct
10 Correct 130 ms 26580 KB Output is correct
11 Correct 117 ms 25968 KB Output is correct
12 Correct 127 ms 24596 KB Output is correct
13 Correct 116 ms 24340 KB Output is correct
14 Correct 108 ms 24212 KB Output is correct
15 Correct 104 ms 23680 KB Output is correct
16 Correct 93 ms 21188 KB Output is correct
17 Correct 86 ms 21124 KB Output is correct
18 Correct 83 ms 20960 KB Output is correct
19 Correct 74 ms 20404 KB Output is correct
20 Incorrect 79 ms 20356 KB Output isn't correct
21 Halted 0 ms 0 KB -