Submission #1996495
Source Code Expand
#include <algorithm> #include <cmath> #include <iostream> #include <iomanip> #include <map> #include <string> #include <vector> #include <queue> #include <stack> #include <set> #include <list> #include <cstdio> #define INF 1000000000000 #define MOD 1000000007ll #define EPS 1e-10 #define REP(i,m) for(long long i=0; i<m; i++) #define FOR(i,n,m) for(long long i=n; i<m; i++) #define DUMP(a) for(long long dump=0; dump<(ll)a.size(); dump++) { cout<<a[dump]; if(dump!=(ll)a.size()-1) cout<<" "; else cout<<endl; } #define ALL(v) v.begin(),v.end() #define pb push_back using namespace std; typedef long long int ll; typedef pair<ll, ll> P; typedef long double ld; using namespace std; int main(){ int n, c, k; cin >> n >> c >> k; int t[n]; REP(i, n) cin >> t[i]; sort(t, t+n); int ans = 1; int ct = t[0]; int cp = 1; REP(i, n){ if(ct + k < t[i] || cp > c){ ans++; ct = t[i]; cp = 1; } cp++; } if(cp > c) ans++; cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Airport Bus |
User | EctoPlasma |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1016 Byte |
Status | WA |
Exec Time | 60 ms |
Memory | 640 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 59 ms | 640 KB |
in3.txt | AC | 60 ms | 640 KB |
in4.txt | WA | 59 ms | 640 KB |
in5.txt | AC | 2 ms | 256 KB |
in6.txt | AC | 60 ms | 640 KB |
in7.txt | AC | 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 |