Submission #1156419
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> using namespace std; typedef long long lli; lli n,c,k; vector<lli> t; lli ans = 0; int main(int argc, char const *argv[]) { cin >> n >> c >> k; t = vector<lli> (n); for(lli i = 0;i < n;i++) cin >> t[i]; sort(t.begin(),t.end(),greater<lli>()); lli d = t[0]; lli p = 1; ans = 1; for(lli i = 1;i < n;i++){ if(d-t[i] > k || p == c) ans++,p = 1,d = t[i]; else p++; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Airport Bus |
User | deoxy |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 537 Byte |
Status | AC |
Exec Time | 47 ms |
Memory | 1024 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 | 47 ms | 1024 KB |
in3.txt | AC | 46 ms | 1024 KB |
in4.txt | AC | 47 ms | 1024 KB |
in5.txt | AC | 2 ms | 256 KB |
in6.txt | AC | 47 ms | 1024 KB |
in7.txt | AC | 41 ms | 896 KB |
in8.txt | AC | 47 ms | 1024 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |