Submission #1157582
Source Code Expand
#include <iostream> #include<string> #include<cstring> #include<algorithm> #include<stdio.h> #include<cmath> #include<queue> #include<stack> #include<map> #include<set> #define cle(a) memset(a,0,sizeof(a)) #define maxn 1000005 using namespace std; typedef long long ll; //n个人 每辆车 c个人 超过k分钟生气 int n,c,k; int a[100005]; int main() { while(cin>>n>>c>>k) { memset(a,0,sizeof(a)); for(int i=0;i<n;i++) cin>>a[i]; sort(a,a+n); int flag=0; //表示车 for(int i=0;i<n;i++) { //cout<<"adjfklasjdf"<<i<<endl; int temp=1; int j; for( j=i+1;;) { if(a[j]>a[i]+k){j--;break;} else temp++; if(temp>c){j-- ;break;} if(j>=n)break; j++; } i=j; flag++; } cout<<flag<<endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Airport Bus |
User | zcc |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 967 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 | 2 ms | 640 KB |
in2.txt | AC | 60 ms | 640 KB |
in3.txt | AC | 60 ms | 640 KB |
in4.txt | AC | 59 ms | 640 KB |
in5.txt | AC | 2 ms | 640 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 | 640 KB |
sample2.txt | AC | 1 ms | 640 KB |