oj.uz

Submission #417284

# Submission time Handle Problem Language Result Execution time Memory
417284 2021-06-03T14:23:52 Z kai824 Event Hopping 2 (JOI21_event2) C++17
0 / 100
 42 ms 10352 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 rig[100005],ans[100005];


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=1;i<=a;i++)rig[i]=LLONG_MAX;
  for(int i=0;i<n;i++){
    //cout<<vals[i].f<<' '<<vals[i].s<<'\n';
    rig[vals[i].f]=min(rig[vals[i].f],vals[i].s);//both should be discretised...
  }

  vector<pii> v;int it;
  v.eb(-a,0);
  for(int i=a;i>=1;i--){
    if(rig[i]>a)goto end;
    it=upper_bound(v.begin(),v.end(),mp(-rig[i],LLONG_MAX))-v.begin()-1;
    it=v[it].s+1;
    if(v.back().s>=it)goto end;
    v.eb(-i,it);

    end:;
    ans[i]=v.back().s;
  }
  //for(pii x:v){cout<<-x.f<<' '<<x.s<<'\n';}

  int cnt=0,cur=ans[vals[0].f];
  if(cur<k){
    cout<<"-1";
    return 0;
  }
  cur=0;
  int tt;
  for(int i=0;i<n && cnt<k;i++){
    if(cur+ans[vals[i].f]>=k){
      cout<<i+1<<'\n';
      cnt++;
      cur++;
      if(cnt>=k)break;

      tt=vals[i].s;
      while(vals[i+1].f<tt){
        i++;
      }
    }else{;
    }
  }
  return 0;
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Incorrect 42 ms 10352 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Incorrect 0 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Incorrect 0 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Incorrect 42 ms 10352 KB Output isn't correct
5 Halted 0 ms 0 KB -