Submission #1156750

---

Source Code Expand

#include <bits/stdc++.h>
#include <iomanip>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef long double LD;
typedef pair<LD, LD> PLDLD;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define CLR(a) memset((a), 0 ,sizeof(a))
#define ALL(a) a.begin(),a.end()

LL MOD=1000000007;

int main()
{
    LL n,c,k;
    cin>>n>>c>>k;
    vector<LL> t(n);
    REP(i,n)
        cin>>t[i];
    
    sort(ALL(t));
    LL ans=0;
    LL cnt=0,tim=-1;

    if(c==1)
    {
        cout<<n<<endl;
        return 0;
    }

    REP(i,n)
    {
        if(cnt==0)
        {
            tim=t[i]+k;
            cnt++;
            ans++;
        }
        else
        {
            if(t[i]<=tim)
            {
                cnt++;
                if(cnt>=c)
                {
                    cnt=0;
                }
            }
            else
            {
                cnt=1;
                tim=t[i]+k;
                ans++;
            }
        }
    }
    cout<<ans<<endl;
    
}

Submission Info

Judge Result