Submission #2115383
Source Code Expand
#include<vector> #include<iostream> #include<string> #include<algorithm> #include<math.h> #include<map> #include<functional> #include<queue> #include<stack> #include<string.h> #include<list> #define ll long long int #define MOD 1000000007LL using namespace std; int main() { ll n,t; cin>>n>>t; ll a; ll b[114514]; cin>>a; ll m=a; ll ma=0; for(int i=1;i<n;i++){ cin>>a; b[i]=(t/2)*(a-m); m=min(m,a); ma=max(ma,b[i]); } ll ans=0; for(int i=0;i<n;i++){ if(b[i]==ma){ ans++; } } cout<<ans<<endl; }
Submission Info
Submission Time | |
---|---|
Task | D - An Invisible Hand |
User | TAISA_ |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 644 Byte |
Status | AC |
Exec Time | 44 ms |
Memory | 1152 KB |
Judge Result
Set Name | sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | large_01.txt, large_02.txt, random_01.txt, random_02.txt, sample_01.txt, sample_02.txt, sample_03.txt, small_01.txt, small_02.txt, spec_01.txt, spec_02.txt, spec_03.txt, spec_04.txt, spec_05.txt, spec_06.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
large_01.txt | AC | 41 ms | 1024 KB |
large_02.txt | AC | 29 ms | 1024 KB |
random_01.txt | AC | 40 ms | 1024 KB |
random_02.txt | AC | 41 ms | 1024 KB |
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 2 ms | 384 KB |
small_01.txt | AC | 1 ms | 256 KB |
small_02.txt | AC | 1 ms | 256 KB |
spec_01.txt | AC | 44 ms | 1024 KB |
spec_02.txt | AC | 41 ms | 1024 KB |
spec_03.txt | AC | 41 ms | 1024 KB |
spec_04.txt | AC | 41 ms | 1024 KB |
spec_05.txt | AC | 41 ms | 1152 KB |
spec_06.txt | AC | 44 ms | 1024 KB |