# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
314113 | kimbj0709 | Pilot (NOI19_pilot) | C++14 | 734 ms | 83756 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 <bits/stdc++.h>
using namespace std;
#define int long long
#define maxn 1000050
#define f first
#define s second
int currsum = 0;
vector<int> ufds(maxn);
vector<int> s(maxn,1);
int find(int k){
if(ufds[k]!=k){
ufds[k] = find(ufds[k]);
}
return ufds[k];
}
void merge(int a,int b){
int temp1 = find(a);
int temp2 = find(b);
currsum -= (s[temp1]*(s[temp1]+1))/2;
currsum -= (s[temp2]*(s[temp2]+1))/2;
int tt = s[temp1]+s[temp2];
currsum += (tt*(tt+1))/2;
ufds[temp1] = temp2;
s[temp2] = tt;
s[temp1] = tt;
}
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int n,q;
vector<pair<int,int> > height,query;
vector<int> visited(maxn,0);
int input;
cin >> n >> q;
for(int i=0;i<ufds.size();i++){
ufds[i] = i;
}
for(int i=1;i<=n;i++){
cin >> input;
height.push_back({input,i});
}
vector<int> ans(q);
for(int i=0;i<q;i++){
cin >> input;
query.push_back({input,i});
}
sort(height.begin(),height.end());
sort(query.begin(),query.end());
int currpos = 0;
for(int i=0;i<query.size();i++){
while(currpos<height.size()&&height[currpos].f<=query[i].f){
currsum++;
visited[height[currpos].s] = 1;
if(visited[height[currpos].s-1]==1){
merge(height[currpos].s,height[currpos].s-1);
}
if(visited[height[currpos].s+1]==1){
merge(height[currpos].s,height[currpos].s+1);
}
currpos++;
}
ans[query[i].s] = currsum;
}
for(auto k:ans){
cout << k << "\n";
}
}
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... |