Submission #2178729
Source Code Expand
#include <algorithm> #include <iostream> #include <cstdlib> #include <cstring> #include <cstdio> #include <cctype> #include <stack> #include <cmath> #include <queue> #include <map> #include <set> #define mst(a,b) memset(a,b,sizeof(a)) using namespace std; typedef long long ll; const double PI=3.14159265; const double eps=1e-9; const int inf=0x3f3f3f3f; const int mod=1e7; const int M=1e6; typedef pair<int,int>p; p a[25005]; int main() { int n,t,i,temp=0,d; scanf("%d %d %d",&n,&t,&d); for(i=0;i<n;i++) scanf("%d",&a[i].first), a[i].second=a[i].first+d; sort(a,a+n); a[n].first=inf; int left1=a[0].second; int mm=left1,c=1; for(i=1;i<=n;i++){ if(a[i].first > left1+1){ if(mm>left1){ left1=mm; c+=max((temp/t),1); temp=0; } } if(a[i].first <= left1+1){ if(mm < a[i].second) { mm=a[i].second; } } temp++; // printf("%d %d\n\n",c,temp); } cout<<c<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Airport Bus |
User | vjudge2 |
Language | C++14 (Clang 3.8.0) |
Score | 0 |
Code Size | 938 Byte |
Status | RE |
Exec Time | 102 ms |
Memory | 888 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 | 10 ms | 888 KB |
in2.txt | RE | 98 ms | 384 KB |
in3.txt | RE | 100 ms | 384 KB |
in4.txt | RE | 98 ms | 384 KB |
in5.txt | WA | 1 ms | 256 KB |
in6.txt | RE | 99 ms | 384 KB |
in7.txt | RE | 101 ms | 384 KB |
in8.txt | RE | 102 ms | 384 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |