Submission #1830697


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#define NDEBUG
#include "cout11.h"
#endif
#undef NDEBUG
#include <cassert>

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))

#define INTSPACE 12
char _buf[INTSPACE*3 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}
int loadvec(vector<int>& v, int N=-1) {
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    // assert(i <= N);
    return i;
}

ll solve(int N, int C, vvi& stc) {
    priority_queue<ii> pq; // (endtime, channel)

    int Nc = 0;

    sort(ALL(stc));
    rep(i, N){
        int si = stc[i][0]*2, ti = stc[i][1]*2, ci = stc[i][2];
        if (pq.empty()) {
            ++Nc;
            pq.push(ii(-ti, ci));
            continue;
        }
        else {
            if (-pq.top().first <= si-1) {
                // just use it
                pq.pop();
                pq.push(ii(-ti, ci));
                continue;
            }

            bool done = false;
            vector<ii> tmp;
            while (!pq.empty() && -pq.top().first == si) {
                if (pq.top().second == ci) {
                    // just use it
                    pq.pop();
                    done = true;
                    break;
                }
                tmp.pb(pq.top());
                pq.pop();
            }
            for (ii item : tmp) pq.push(item);

            if (!done) {
                ++Nc;
            }
            pq.push(ii(-ti, ci));
        }
    }
    return Nc;
}

int main() {
    vi tmp(3); loadvec(tmp, 2);
    int N = tmp[0], C = tmp[1];

    vvi stc(N, vi(3));
    rep(i, N) {
        loadvec(stc[i], 3);
    }

    cout << solve(N, C, stc) << endl;
    return 0;
}

Submission Info

Submission Time
Task D - Recording
User naoya_t
Language C++14 (GCC 5.4.1)
Score 400
Code Size 3103 Byte
Status
Exec Time 44 ms
Memory 5760 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample_01.txt, sample_02.txt, sample_03.txt
All 400 / 400 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
01.txt 41 ms 5760 KB
02.txt 42 ms 5760 KB
03.txt 41 ms 5760 KB
04.txt 44 ms 5760 KB
05.txt 37 ms 5760 KB
06.txt 18 ms 2944 KB
07.txt 13 ms 2176 KB
08.txt 1 ms 256 KB
09.txt 41 ms 5760 KB
10.txt 40 ms 5760 KB
11.txt 40 ms 5760 KB
12.txt 1 ms 256 KB
13.txt 1 ms 256 KB
14.txt 1 ms 256 KB
15.txt 1 ms 256 KB
16.txt 40 ms 5760 KB
17.txt 40 ms 5760 KB
18.txt 41 ms 5760 KB
19.txt 41 ms 5760 KB
sample_01.txt 1 ms 256 KB
sample_02.txt 1 ms 256 KB
sample_03.txt 1 ms 256 KB