Submission #3774711

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
  ll n,C;cin>>n>>C;
  ll s[n],t[n],c[n];
  vector<double>tukeru[31],kesu[31];
  vector<pair<ll,ll>>v[31];
  for(ll i=0;i<n;i++){
    cin>>s[i]>>t[i]>>c[i];
    v[c[i]].push_back(make_pair(s[i],t[i]));
  }
  for(ll i=1;i<31;i++){
    if(v[i].size()==0)continue;
    sort(v[i].begin(),v[i].end());
    tukeru[i].push_back(v[i][0].first-0.5);
    kesu[i].push_back(v[i][0].second);
    for(ll j=1;j<v[i].size();j++){
      ll f=v[i][j].first,s=v[i][j].second;
      if(f==kesu[i].back()){
        kesu[i].pop_back();
      }
      else{
        //kesu[i][kesu[i].size()-1]++;
        tukeru[i].push_back(f-0.5);
      }
      kesu[i].push_back(s);
    }
    //kesu[i][kesu[i].size()-1]++;
  }
  //for(ll i=1;i<=C;i++)for(ll j=0;j<kesu[i].size();j++)cout<<tukeru[i][j]<<endl;
  ll now=0,ans=0;
  ll ban[31];
  //cout<<tukeru[2][0];return 0;
  fill(ban,ban+31,0);
  for(double i=0;i<=100001;i+=0.5){
    for(ll j=1;j<31;j++){
      if(v[j].size()==0)continue;
      if(tukeru[j][ban[j]]==i){
        now++; 
      }
      if(kesu[j][ban[j]]==i){
        now--;
        ban[j]++;
      }
      //cout<<j<<" "<<ban[j]<<endl;
    }
   //if(i<=100)cout<<now<<endl;
      ans=max(now,ans);
  }
  ll d[100010];
  fill(d,d+100010,0);
  for(ll i=0;i<n;i++){
    
    d[s[i]]++;
    d[t[i]+1]--;
  }
  ll noww=0,anss=0;
  for(ll i=1;i<=100000;i++){
    noww+=d[i];
    anss=max(anss,noww);
  }
  cout<<min(ans,anss);
}

Submission Info

Judge Result