Submission #3229553

---

Source Code Expand

#include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

using namespace std;

typedef long long ll;
typedef pair<int, int> P;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define SP cout << fixed << setprecision(10)
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }

int n, C;
int s[100000], t[100000], c[100000];
int sm[200002];
int tt[200002];

int main(void) {
    // code

    cin >> n >> C;
    rep(i, n) cin >> s[i] >> t[i] >> c[i];

    for (int i = 1; i <= C; i++) {
        rep(j, 200002) tt[j] = 0;
        rep(j, n) {
            if (c[j] == i) {
                tt[s[j] * 2 - 1]++, tt[t[j] * 2]--;
            }
        }
        FOR(j, 1, 200002) tt[j] += tt[j - 1];
        rep(j, 200002) {
            if (tt[j] > 0) {
                sm[j]++;
            }
        }
    }
    int mx = 0;
    rep(j, 200002) {
        if (mx < sm[j]) {
            mx = sm[j];
        }
    }

    cout << mx << endl;
    return 0;
}

Submission Info

Judge Result