Submission #1417247


Source Code Expand

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

#define PI 4*atan(1)
#define INF 1e8

typedef long long ll;

int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};

int main(){
  ll N, C, K;
  cin >> N >> C >> K;
  vector<int> T(N);
  for(int i = 0; i < N; i++){
    cin >> T[i];
  }
  sort(T.begin(), T.end());
  ll c = 0, ans = 0, l;
  for(int i = 0; i < N; i++){
    if(l < T[i]){
      ans++;
      l = T[i] + K;
      c = 1;
    }else{
      c++;
    }
    if(c == C){
      c = 0;
      l = 0;
    }
  }
  cout << ans << endl;
}

Submission Info

Submission Time
Task A - Airport Bus
User yuta0802
Language C++14 (GCC 5.4.1)
Score 300
Code Size 562 Byte
Status AC
Exec Time 52 ms
Memory 640 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 12
Set Name Test Cases
Sample sample1.txt, sample2.txt
All 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 AC 1 ms 256 KB
in2.txt AC 46 ms 640 KB
in3.txt AC 46 ms 640 KB
in4.txt AC 52 ms 640 KB
in5.txt AC 2 ms 256 KB
in6.txt AC 47 ms 640 KB
in7.txt AC 41 ms 640 KB
in8.txt AC 47 ms 640 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB