Submission #1370316
Source Code Expand
#include <map> #include <set> #include <list> #include <cmath> #include <ctime> #include <deque> #include <queue> #include <stack> #include <string> #include <bitset> #include <cstdio> #include <limits> #include <vector> #include <climits> #include <cstring> #include <cstdlib> #include <fstream> #include <numeric> #include <sstream> #include <cassert> #include <iomanip> #include <iostream> #include <algorithm> #include <unordered_set> #include <unordered_map> using namespace std; #define f first #define s second #define pb push_back #define pp pop_back #define mp make_pair #define ll long long #define ld double #define ull unsigned long long #define PI pair < int, int > const int N = 5e5 + 123; const int M = 123; const ld Pi = acos(-1); const ll Inf = 1e18; const int inf = 1e9; const int mod = 1e9 + 7; const int Sz = 501; const int MOD = 1e9 + 7; void add(int &a, int b) { a += b; if (a >= mod) a -= mod; } int mult(int a, int b) { return 1ll * a * b % mod; } int sum(int a, int b) { add(a, b); return a; } int n, c, k, a[N], ans; void solve() { cin >> n >> c >> k; for (int i = 1;i <= n;i++) cin >> a[i]; sort(a + 1, a + n + 1); for (int i = 1;i <= n;i++) { int lim = min(n, i + c - 1); int j = i; while(j < lim && a[j + 1] <= a[i] + k) { j++; } i = j; ans++; } cout << ans << endl; } int main() { #ifdef wws freopen("in", "r", stdin); // freopen("in", "w", stdout); #endif ios_base::sync_with_stdio(0); int tt = 1; while(tt--) solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Airport Bus |
User | SmallBoy |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1630 Byte |
Status | AC |
Exec Time | 18 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 | 1 ms | 256 KB |
in2.txt | AC | 18 ms | 640 KB |
in3.txt | AC | 18 ms | 640 KB |
in4.txt | AC | 18 ms | 640 KB |
in5.txt | AC | 1 ms | 256 KB |
in6.txt | AC | 18 ms | 640 KB |
in7.txt | AC | 16 ms | 640 KB |
in8.txt | AC | 18 ms | 640 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |