oj.uz

Submission #417216

# Submission time Handle Problem Language Result Execution time Memory
417216 2021-06-03T13:20:51 Z kai824 Event Hopping 2 (JOI21_event2) C++17
32 / 100
 3000 ms 9384 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mp make_pair
#define eb emplace_back
#define pii pair<int,int>
#define f first
#define s second

pii vals[100005];
int lef[100005];

/*struct node{
  int s,e,v;
  node *l,*r;
  node(int ss,int ee){
    s=ss;e=ee;
    v=0;
  }
  void copy(node *t){
    v=t->v;
    l=t->l;
    r=t->r;
  }
  void update(){
    ;
  }
} *st[100005];*/

void init_sts(){
  ;
}

vector<pii> v;int it;
int qq(int l,int r){//speed up with segtree somehow later...
  v.clear();v.eb(l,0);
  for(int i=l+1;i<=r;i++){
    if(lef[i]<l)continue;
    it=upper_bound(v.begin(),v.end(),mp(lef[i],LLONG_MAX))-v.begin()-1;
    it=v[it].s+1;
    if(v.back().s>=it)continue;
    v.eb(i,it);
  }
  return v.back().s;
}

int32_t main(){
  ios_base::sync_with_stdio(false);cin.tie(0);
  int n,k,a,b;
  cin>>n>>k;

  vector<pii>disc;//discretisation: raw value, index...
  for(int i=0;i<n;i++){
    cin>>a>>b;
    disc.eb(a,i*2);
    disc.eb(b,i*2+1);
  }
  sort(disc.begin(),disc.end());
  a=1;
  for(int i=0;i<2*n;i++){
    if(i>0 && disc[i].f>disc[i-1].f)a++;
    if(disc[i].s&1)vals[disc[i].s/2].s=a;
    else vals[disc[i].s/2].f=a;
  }
  for(int i=0;i<n;i++){
    //cout<<vals[i].f<<' '<<vals[i].s<<'\n';
    lef[vals[i].s]=max(lef[vals[i].s],vals[i].f);//both should be discretised...
  }
  init_sts();//initialise segtrees...

  int cur=qq(1,a),tmp;
  if(cur<k){
    cout<<-1;
    return 0;
  }//else cout<<cur<<'\n';
  set<pii> ss;ss.insert(mp(1,1));ss.insert(mp(a,a));
  set<pii>::iterator it,it2;
  bool mk[n];memset(mk,0,sizeof(mk));
  for(int i=0;i<n;i++){
    it=ss.lower_bound(vals[i]);
    it2=it--;
    if(it2==ss.end())continue;
    if(it->s<=vals[i].f && vals[i].s<=it2->f){
      tmp=cur;
      tmp+=1+(qq(it->s,vals[i].f)+qq(vals[i].s,it2->f) ) - qq(it->s,it2->f);
      if(tmp>=k){
        mk[i]=true;
        cur=tmp;
        ss.insert(vals[i]);
      }
    }
  }
  int cnt=0;
  for(int i=0;i<n && cnt<k;i++){
    if(mk[i]){
      cout<<i+1<<'\n';
      cnt++;
    }
  }
  return 0;
}
/*
5 4
1 3
2 5
8 9
6 8
10 15
*/

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Execution timed out 3077 ms 9384 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
1.0 / 1.0

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

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 11 ms 588 KB Output is correct
29 Correct 5 ms 588 KB Output is correct
30 Correct 4 ms 592 KB Output is correct
31 Correct 3 ms 588 KB Output is correct
32 Correct 2 ms 588 KB Output is correct
33 Correct 2 ms 588 KB Output is correct
34 Correct 2 ms 584 KB Output is correct
35 Correct 4 ms 848 KB Output is correct
36 Correct 4 ms 796 KB Output is correct
37 Correct 4 ms 708 KB Output is correct
38 Correct 2 ms 588 KB Output is correct
39 Correct 4 ms 716 KB Output is correct
40 Correct 4 ms 792 KB Output is correct
41 Correct 4 ms 816 KB Output is correct
42 Correct 2 ms 580 KB Output is correct
43 Correct 5 ms 588 KB Output is correct
44 Correct 5 ms 668 KB Output is correct
45 Correct 4 ms 588 KB Output is correct
46 Correct 3 ms 584 KB Output is correct
47 Correct 7 ms 704 KB Output is correct
48 Correct 3 ms 660 KB Output is correct
49 Correct 3 ms 588 KB Output is correct
50 Correct 2 ms 588 KB Output is correct
51 Correct 19 ms 700 KB Output is correct
52 Correct 9 ms 708 KB Output is correct
53 Correct 3 ms 588 KB Output is correct
54 Correct 2 ms 624 KB Output is correct
55 Correct 131 ms 804 KB Output is correct
56 Correct 143 ms 780 KB Output is correct
57 Correct 143 ms 800 KB Output is correct
58 Correct 131 ms 708 KB Output is correct
59 Correct 132 ms 800 KB Output is correct
60 Correct 131 ms 792 KB Output is correct
61 Correct 130 ms 708 KB Output is correct
62 Correct 148 ms 800 KB Output is correct
63 Correct 138 ms 792 KB Output is correct
64 Correct 2 ms 588 KB Output is correct

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Execution timed out 3077 ms 9384 KB Time limit exceeded
5 Halted 0 ms 0 KB -