Submission #1589730


Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cmath>
using namespace std;

int Train(int N, int C, int K, int T[]) {
	int ans = 0;
	int f, cnt = 0;
	f = T[0];
	for (int i = 0;i < N;i++) {
		//我慢の限界の客がいるor定員が集まったらバスを出す

		

		if (cnt == C - 1) {
			cnt = 0;
			ans++;
			f = T[i + 1];
		}
		else if (T[i] - f > K) {
			cnt = 0;
			ans++;
			f = T[i];
			if (i == N - 1) ans++;
		}
		else {
			cnt++;
			if (i == N - 1) ans++;

		}

		//cout << cnt << " " << ans << endl;

	}
	return ans;
}

int main() {
	int N, C, K, T[100005];
	cin >> N >> C >> K;
	for (int i = 0;i < N;i++) {
		cin >> T[i];
	}

	sort(T, T + N);

	cout << Train(N, C, K, T) << endl;
	return 0;
}

Submission Info

Submission Time
Task A - Airport Bus
User takiteke
Language C++14 (GCC 5.4.1)
Score 0
Code Size 828 Byte
Status WA
Exec Time 60 ms
Memory 640 KB

Judge Result

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