Submission #1627392
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int,int> P; typedef pair<int,P> P1; typedef pair<P,P> P2; #define pu push #define pb push_back #define mp make_pair #define eps 1e-7 #define INF 1000000000 #define mod 1000000007 #define fi first #define sc second #define rep(i,x) for(int i=0;i<x;i++) #define repn(i,x) for(int i=1;i<=x;i++) #define SORT(x) sort(x.begin(),x.end()) #define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end()) #define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) #define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) int n,c,k,t[100005]; int main(){ cin>>n>>c>>k; rep(i,n)cin>>t[i]; sort(t,t+n); int pre = 0,ans = 0; for(int i=0;i<n;i++){ if(t[i]-t[pre] > k){ pre = i; ans++; } else if(i-pre+1==c){ pre = i+1; ans++; } } if(pre!=n) ans++;cout<<ans<<endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Airport Bus |
User | IH19980412 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 894 Byte |
Status | AC |
Exec Time | 60 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 | 59 ms | 640 KB |
in3.txt | AC | 60 ms | 640 KB |
in4.txt | AC | 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 | 60 ms | 640 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |