Submission #1870472
Source Code Expand
#define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <sstream> #include <iomanip> #include <cstdio> #include <cstdlib> #include <cmath> #include <cctype> #include <cstring> #include <vector> #include <list> #include <queue> #include <deque> #include <stack> #include <map> #include <set> #include <algorithm> #include <iterator> #include <bitset> #include <ctime> #include<complex> using namespace std; #define FOR(i,a,b) for (int i = (a); i < (b); i++) #define RFOR(i,b,a) for (int i = (b)-1; i >= (a); i--) #define ITER(it,a) for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++) #define FILL(a,value) memset(a, value, sizeof(a)) #define SZ(a) (int)a.size() #define ALL(a) a.begin(), a.end() #define PB push_back #define MP make_pair typedef long long LL; typedef vector<int> VI; typedef pair<int, int> PII; const double PI = acos(-1.0); const int INF = 1000 * 1000 * 1000 + 7; const LL LINF = INF * (LL)INF; const int MAX = 100000 + 47; const int MOD = 1000 * 1000 * 1000 + 7; int A[MAX]; int main() { //freopen("in.txt", "r", stdin); //freopen("out.txt", "w", stdout); ios::sync_with_stdio(false); cin.tie(0); int n, c, k; cin >> n >> c >> k; FOR(i, 0, n) { cin >> A[i]; } sort(A, A + n); int cnt = 1; int last = 0; int ans = 0; FOR(i, 1, n) { if (cnt == c || A[i] - A[last] > k) { ans++; cnt = 1; last = i; continue; } cnt++; } ans++; cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Airport Bus |
User | vjudge4 |
Language | C++14 (Clang 3.8.0) |
Score | 300 |
Code Size | 1427 Byte |
Status | AC |
Exec Time | 114 ms |
Memory | 640 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
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 | 2 ms | 256 KB |
in2.txt | AC | 114 ms | 640 KB |
in3.txt | AC | 113 ms | 640 KB |
in4.txt | AC | 114 ms | 640 KB |
in5.txt | AC | 2 ms | 256 KB |
in6.txt | AC | 113 ms | 640 KB |
in7.txt | AC | 99 ms | 640 KB |
in8.txt | AC | 113 ms | 640 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |