Submission #1156777

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cassert>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define rep(i,n) FOR(i,0,n)
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define vint vector<int>
#define vdouble vector<double>
#define vstring vector<string>
using namespace std;

#include<map>
#include<set>
#include<queue>

typedef long long ll;
typedef unsigned long long ull;

const int MAX_N = 1000000;

ll T[MAX_N];

int main() {
    ll N, C, K;
    cin >> N >> C >> K;
    rep(i, N){ cin >> T[i]; }

    ll t = -1;
    ll c = 0;
    ll ret = 0;

    sort(&T[0], &T[N]);

    rep(i, N){cerr << T[i] << " ";}
    cerr << endl;

    rep(i, N){
        if (t == -1){t = T[i];}

        if ( (T[i] > t + K) ){
            ret++;
            t = T[i];
            c = 0;
        }

        c++;

        if (c >= C){
            // cerr << T[i] << " " << c << endl;
            ret++;
            t = -1;
            c = 0;
        }
    }
    if (c > 0) ret++;

    cout << ret << endl;
}

Submission Info

Judge Result