# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
842541 | 8pete8 | Pilot (NOI19_pilot) | C++17 | 1022 ms | 126332 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include<bitset>
//#include "supertrees.h"
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define pb push_back
#define all(x) x.begin(),x.end()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
#define int long long
const int mxn=1e6,mod=998244353,lg=20,root=80,inf=1e9;
void setIO(string name) {
ios_base::sync_with_stdio(0); cin.tie(0);
freopen((name+".in").c_str(),"r",stdin);
freopen((name+".out").c_str(),"w",stdout);
}
int n,m,ct;
vector<int>pos[mxn+10];
set<int>cur;
int pre[mxn+10];
int32_t main(){
fastio
cin>>n>>m;
for(int i=1;i<=n;i++){
int a;cin>>a;
pos[a].pb(i);
}
for(int i=1;i<=mxn;i++)pre[i]=pre[i-1]+i;
ct=mxn;
vector<pii>q(m);
vector<int>ans(m);
for(int i=0;i<m;i++){
cin>>q[i].f;
q[i].s=i;
}
int sum=pre[n];
cur.insert(0);
cur.insert(n+1);
sort(q.begin(),q.end());
for(int i=m-1;i>=0;i--){
while(ct>q[i].f){
for(auto j:pos[ct]){
cur.insert(j);
auto it=cur.lower_bound(j);
auto it2=it;
it2++;
it--;
sum-=pre[((*it2)-(*it)-1)];
it2--;
sum+=pre[(*it2)-(*it)-1];
it2++;
it++;
sum+=pre[(*it2)-(*it)-1];
}
ct--;
}
ans[q[i].s]=sum;
}
for(auto i:ans)cout<<i<<'\n';
return 0;
}
Compilation message (stderr)
# | 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... |