# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
165819 |
2019-11-29T08:32:23 Z |
muhi1112 |
Baloni (COCI15_baloni) |
C++17 |
|
282 ms |
38560 KB |
#include <bits/stdc++.h>
using namespace std;
#define f1 first
#define s2 second
#define pb push_back
#define mp make_pair
#define ll long long
#define fri(a) freopen(a,"r",stdin);
#define fro(a) freopen(a,"w",stdout);
const int N=1e6+5;
int n,a,ans,sayi[N],k,m;
vector<int>height[N],dizi;
int main(){
//fri("in.txt");
//fro("out.txt");
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
dizi.pb(a);
sayi[dizi[i]]++;
height[dizi[i]].pb(i);
}
//cout<<"sa"<<endl;
for(int i=1e6;i>0;i--){
ans+=sayi[i];
while(sayi[i]--){
//cout<<sayi[i]<<endl;
k=i;
m=*height[k].begin();
height[k].erase(height[k].begin());
//cout<<m<<endl;
while(m<n){
//cout<<"sa"<<endl;
k--;
auto it=lower_bound(height[k].begin(),height[k].end(),m);
if(it==height[k].end()){
break;
}
m=*it;
sayi[dizi[*it]]--;
height[k].erase(it);
}
}
}
//cout<<"sa"<<endl;
cout<<ans<<endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
34 ms |
27768 KB |
Output is correct |
2 |
Correct |
33 ms |
27768 KB |
Output is correct |
3 |
Correct |
34 ms |
27768 KB |
Output is correct |
4 |
Correct |
34 ms |
27896 KB |
Output is correct |
5 |
Correct |
231 ms |
38236 KB |
Output is correct |
6 |
Correct |
282 ms |
38560 KB |
Output is correct |
7 |
Correct |
252 ms |
38492 KB |
Output is correct |
8 |
Correct |
230 ms |
36988 KB |
Output is correct |
9 |
Correct |
242 ms |
38496 KB |
Output is correct |
10 |
Correct |
255 ms |
37852 KB |
Output is correct |