Submission #2660897

Source Code Expand

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

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#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))

int solve(int N, int C, int K, vi& T) {
    sort(ALL(T));

    int ans = 0;
    int onb = 0, tw = -1;
    rep(i,N){
        if (T[i] <= tw) {
            ++onb;
        } else {
            // tw < T[i]
            if (onb > 0) {
                ++ans;
                // printf("[onboard=%d, at %d?]\n", onb, tw);
                onb = 0; tw = -1;
            }
            onb = 1; tw = T[i]+K;
        }
        if (onb == C) {
            ++ans;
            // printf("[onboard=%d, at %d]\n", onb, tw);
            onb = 0; tw = -1;
        }
    }
    if (onb > 0) {
        ++ans;
        // printf("[onboard=%d, at %d]\n", onb, tw);
    }

    return ans;
}

int main() {
    int N,C,K; cin >> N>>C>>K; // 2-1e5, 1-1e9, 1-1e9
    vi T(N); // 1-1e9
    rep(i,N) cin>>T[i];
    cout << solve(N,C,K,T) << endl;
    return 0;
}

Submission Info

Submission Time
Task A - Airport Bus
User naoya_t
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1944 Byte
Status
Exec Time 48 ms
Memory 640 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample1.txt, sample2.txt
All 300 / 300 sample1.txt, sample2.txt, in1.txt, in2.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, sample1.txt, sample2.txt
Case Name Status Exec Time Memory
in1.txt 1 ms 256 KB
in2.txt 48 ms 640 KB
in3.txt 47 ms 640 KB
in4.txt 47 ms 640 KB
in5.txt 2 ms 256 KB
in6.txt 47 ms 640 KB
in7.txt 41 ms 640 KB
in8.txt 47 ms 640 KB
sample1.txt 1 ms 256 KB
sample2.txt 1 ms 256 KB