Submission #977222

#TimeUsernameProblemLanguageResultExecution timeMemory
977222NewtonabcPilot (NOI19_pilot)C++14
40 / 100
1049 ms5968 KiB
#include<bits/stdc++.h> using namespace std; const int N=1e6+10; int arr[N],que[N]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n,ind,q,sum=0,ans=0; cin>>n >>q; for(int i=1;i<=n;i++) cin>>arr[i]; for(int i=1;i<=q;i++) cin>>que[i]; if((long long)n*(long long)q>=100000000){ for(int i=1;i<=q;i++){ ind=upper_bound(arr+1,arr+n+1,que[i])-arr; cout<<(1+ind)*ind/2 <<"\n"; } } for(int i=1;i<=q;i++){ ans=0,sum=0; for(int j=1;j<=n;j++){ if(que[i]>=arr[j]) sum++; else sum=0; ans+=sum; } cout<<ans <<"\n"; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...