| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1359132 | eweirdf274r | Pilot (NOI19_pilot) | C++20 | 1092 ms | 1400 KiB |
#include<bits/stdc++.h>
using namespace std;
int h[1000005],x[1005][1005],qu[1000005],sum[1000005];
int main(){
int n,q;cin>>n>>q;
int chk2=0;
for(int i=1;i<=n;i++)cin>>h[i];
for(int i=2;i<=n;i++){
if(h[i]<=h[i-1])chk2=1;
}
int chk=0;
for(int i=1;i<=q;i++){
cin>>qu[i];
if(qu[i]!=1000000)chk=1;
}
if(chk2==1){
for(int i=1;i<=q;i++){
int u=upper_bound(h+1,h+1+n,qu[i])-h-1-1;
cout<<(u*(u+1))/2;
}
}
if(chk==1){
for(int i=1;i<=n;i++){
for(int j=i;j<=n;j++){
int mx=0;
for(int k=i;k<=j;k++){
mx=max(mx,h[k]);
}
x[i][j]=mx;
}
}
for(int k=1;k<=q;k++){
int cnt=0;
for(int i=1;i<=n;i++){
for(int j=i;j<=n;j++){
if(x[i][j]<=qu[k])cnt++;
}
}
cout<<cnt<<'\n';
}
}
else{
cout<<(n*(n+1))/2<<'\n';
}
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
