Submission #1868511


Source Code Expand

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

#define pb push_back
#define pf push_front
#define pp pop_back
#define sz(a) (int)(a.size())
#define mp make_pair
#define F first
#define S second
#define next _next
#define prev _prev
#define left _left
#define right _right
#define y1 _y1
#define all(x) x.begin(), x.end()

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int N = (int)1e6 + 123;
const ll INF = (ll)1e18 + 123;
const int inf = (int)1e9 + 123;
const int MOD = (int)1e9 + 7;

void megaRandom() {
	unsigned int FOR;
 	asm("rdtsc" : "=A"(FOR));
  srand(FOR);
}

int n, c, k;
int t[N];

int main() {
	megaRandom();
	cin >> n >> c >> k;
	for(int i = 1; i <= n; i++) {
		cin >> t[i];
	}
	sort(t + 1, t + n + 1);
	int last = -1, cnt = 0, cur_c = c;
	for(int i = 1; i <= n; i ++) {
		if(last == -1) {
			cnt ++;	
		} else {
			if(t[i] - last > k || cur_c == 0) {
				i = i - 1;
				last = -1;
				cur_c = c;
				continue;
			}
		}
		last = t[i], cur_c --;
	}
	cout << cnt;
	return 0;         
}

Submission Info

Submission Time
Task A - Airport Bus
User Aidyn_A
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1177 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 × 7
WA × 5
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 WA 60 ms 640 KB
in4.txt AC 59 ms 640 KB
in5.txt WA 2 ms 256 KB
in6.txt WA 60 ms 640 KB
in7.txt WA 52 ms 640 KB
in8.txt WA 60 ms 640 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 3 ms 256 KB