Submission #1157578


Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cassert>  // assert(x>=10), 部分点問題
#include <iostream>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <set>

#define repl(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) (x).begin(), (x).end()
#define SORT(v,n) sort(v,v+n)
#define VSORT(v) sort(all(x))
#define FILL(v, value) (v+(sizeof(v) / sizeof *(v)), value);
#define inf 999999999
#define dbg(x) cout<<#x<<":"<<x<<endl;
#define pb(a) push_back((a))
#define mp(a) make_pair((a))
#define pi 2*acos(0.0)
#define in scanf
#define out printf
#define fi first
#define se second

// --
#define bit(n) (1LL<<(n)) // 左bitシフト
// --

using namespace std;

typedef long long llong;
typedef pair<int, int> pii;
typedef pair<llong, llong> pll;
typedef pair<llong, pll> plp;

const int MOD=1000000007;
const int dx[]={1,0,-1,0}, dy[]={0,-1,0,1};  // 右下左上


int main(int argc, char**argv){

  long n, c, k;
  cin >> n >> c >> k;
  vector<int> t;
  rep(i, n) {
    int tmp;
    cin >> tmp;
    t.push_back(tmp);
  }
  sort(all(t));
  // rep(i, n){
    // cout << i << ':';
    // cout << t[i] << endl;
  // }

  int ans = 0;
  int rider = 0;
  int pri_bus_time = 0;
  int first_time = 0;
  bool gone = true;
  rep(i, n){
    if (gone) {
      first_time = t[i];
      gone = false;
    }
    rider++;
    if (rider >= c || t[i+1] - first_time >= k){
      // bus go
      ans++;
      rider = 0;
      gone = true;
    }
    if (i == n-1) ans++;
  }

  cout << ans << endl;

	return 0;
}

Submission Info

Submission Time
Task A - Airport Bus
User Tyler
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1768 Byte
Status WA
Exec Time 47 ms
Memory 892 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 2
AC × 10
WA × 2
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 47 ms 892 KB
in3.txt WA 47 ms 892 KB
in4.txt WA 47 ms 892 KB
in5.txt AC 2 ms 256 KB
in6.txt AC 47 ms 892 KB
in7.txt AC 41 ms 892 KB
in8.txt AC 47 ms 892 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB