제출 #1287727

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1287727		ghammazhassan	Real Mountains (CCO23_day1problem2)	C++20	0 / 25	1 ms	572 KiB

Main

// #include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <vector>
#include <iomanip>
#include <string>
#include <queue>
#include <set>
#include <deque>
using namespace std;
#define int long long
#define endl "\n"
#define fi first
#define se second
const int M=1e6+3;
const int inf = 1e14;
const int LOG=18;
const int N=1e6+5;
int n , m , c , w , k , t=1 , q=1 , x , y , z , l , r;
int seg[4*N];
int a[N];
void update(int i,int s=0,int e=n,int v=1){
    if (i<s or i>=e)return;
    if (e-s==1){
        seg[v]=a[i];
        return;
    }
    int li=(2*v);
    int ri=(2*v+1);
    int m=(s+e)/2;
    update(i,s,m,li);
    update(i,m,e,ri);
    seg[v]=min(seg[li],seg[ri]);
}
int query(int l,int r,int s=0,int e=n,int v=1){
    if (r<=s or l>=e){
        return inf;
    }
    if (l<=s and e<=r){
        return seg[v];
    }
    int li=(2*v);
    int ri=(2*v+1);
    int m=(s+e)/2;
    return min(query(l,r,s,m,li),query(l,r,m,e,ri));
}
void solve()
{   
    cin >> n;
    for (int i=0;i<n;i++){
        cin >> a[i];
        update(i);
    }
    vector<pair<int,int>>p(n);
    for (int i=0;i<n;i++){
        p[i]={a[i],i};
    }
    sort(p.begin(),p.end());
    vector<vector<int>>l;
    l.push_back({p[0].se});
    for (int i=1;i<n;i++){
        if(p[i].fi==p[i-1].fi){
            l[l.size()-1].push_back(p[i].se);
        }
        else{
            l.push_back({p[i].se});
        }
    }
    c=0;
    for (vector<int>p:l){
        x=a[p[0]];
        for (int i:p){
            if (i==0 or i==n-1){
                continue;
            }
            int u1=query(0,i);
            int u2=query(i+1,n);
            if (u1==inf)u1=0;
            if (u2==inf)u2=0;
            int u=min(u1,u2)-a[i];
            // cout << i << " " << u1 << " " << u2 << endl;
            if (u<=0){
                continue;
            }
            c+=(u1+u2+a[i])*u+u*(u-1)/2;
            a[i]+=u;
            update(i);
        }
        reverse(p.begin(),p.end());
        for (int i:p){
            if (i==0 or i==n-1 or a[i]!=x){
                a[i]=inf;
                update(i);
                continue;
            }
            int u1=query(0,i);
            int u2=query(i+1,n);
            if (u1==inf)u1=0;
            if (u2==inf)u2=0;
            int u=min(u1,u2)-a[i];
            // cout << i << " " << u1 << " " << u2 << endl;
            if (u<=0){
                a[i]=inf;
                update(i);
                continue;
            }
            c+=(u1+u2+a[i])*u+u*(u-1)/2;
            a[i]=inf;
            update(i);
        }
    }
    // for (int i=0;i<n;i++){
    //     cout << a[i] << " ";
    // }
    cout << c << endl;
}
signed main()    
{

    ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
    cin.tie(0), cout.tie(0);//DO NOT USE IN INTERACTIVE
    cout << fixed << setprecision(9);
    srand(time(0));
    // int t=1;
    // cin >> t;
    for (int _=1;_<=t;_++){
        solve();
        q++;
    }
} 

• Subtask 1: 0 / 3
• Subtask 2: 0 / 3
• Subtask 3: 0 / 3
• Subtask 4: 0 / 3
• Subtask 5: 0 / 4
• Subtask 6: 0 / 5
• Subtask 7: 0 / 4