Submission #3229957

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <limits.h>
#include <queue>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(int i=0; i<n; i++)
#define TLIM 2*110100

bool hist[31][TLIM];
int main(){
    int N, C;
    cin >> N >> C;
    int s,t,c;
    REP(i,N){
        cin >> s >> t >> c;
        s = s*2 - 1;
        t *= 2;
        for(;s < t; s++)
            hist[c][s] = true;
    }

    int ans = 0;
    REP(t,2*TLIM){
        int num = 0;
        REP(ch, C+1){
            if(hist[ch][t]) num++;
        }
        ans = max(ans, num);
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result