Submission #1370268

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define forn(i, s, f) for(int i = (s); i <= (f); ++i)
#define for1(i, f, s) for(int i = (f); i >= (s); --i)
#define fora(i, x) for (auto i : x)
#define show(x) cout << #x << " = " << x << " ";
#define skip continue;
#define pb push_back
#define _1 first
#define _2 second

typedef long long ll;

const int N3 = 1e3 + 5;
const int N4 = 1e4 + 5;
const int N5 = 1e5 + 5;
const int N6 = 1e6 + 5;
const int N7 = 1e7 + 5;
const int N8 = 1e8 + 5;
const int N9 = 1e9 + 5;

int n, c, k, l, r, ct, bus;

pair < int, int > a[N5];

int main()
{
    cin >> n >> c >> k;
    forn (i, 1, n)
    {
        cin >> a[i]._1;
        a[i]._2 = a[i]._1 + k;
    }
    sort(a + 1, a + n + 1);
    forn (i, 1, n)
    {
        if (i == 1)
        {
            r = a[i]._2;
            ct = 1;
        }
        else
        {
            l = a[i]._1;
            if (ct + 1 <= c && l <= r)
            {
                ++ct;
            }
            else
            {
                ct = 1;
                ++bus;
                r = a[i]._2;
            }
        }
    }
    cout << bus + (ct > 0);
}

Submission Info

Judge Result