Submission #968158

#	Time	Username	Problem	Language	Result	Execution time	Memory
968158		LittleOrange	Real Mountains (CCO23_day1problem2)	C++17	25 / 25	2729 ms	261904 KiB

Main

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e6+3;
const ll big = 1e18;
struct l{
    ll x;
    l(const ll &x):x((x+mod)%mod){}
    l(const int &x):x((x+mod)%mod){}
    l operator+(const l& o) const{
        return l(x+o.x);
    }
    l operator-(const l& o) const{
        return l(x-o.x);
    }
    l operator*(const l& o) const{
        return l(x*o.x);
    }
    l operator+(const ll& o) const{
        return l(x+o);
    }
    l operator-(const ll& o) const{
        return l(x-o);
    }
    l operator*(const ll& o) const{
        return l(x*o);
    }
    l operator+(const int& o) const{
        return l(x+o);
    }
    l operator-(const int& o) const{
        return l(x-o);
    }
    l operator*(const int& o) const{
        return l(x*o);
    }
    operator ll() const{
        return (x%mod+mod)%mod;
    }
};
const l rev2 = l(500002);
struct segtree{
    ll n;
    vector<ll> a;
    segtree(ll N):n(N),a(N<<2){}
    void set(ll i, ll l, ll r, ll x, ll v){
        if(l==r) a[i] = v;
        else{
            ll m = l+r>>1;
            if(x<=m) set(i<<1,l,m,x,v);
            else set(i<<1|1,m+1,r,x,v);
            a[i] = min(a[i<<1],a[i<<1|1]);
        }
    }
    void set(ll x, ll v){
        set(1,0,n-1,x,v);
    }
    ll get(ll i, ll l, ll r, ll ql, ll qr){
        if (ql<=l&&r<=qr) return a[i];
        else{
            ll m = l+r>>1;
            ll ret = big;
            if (ql<=m) ret = min(ret,get(i<<1,l,m,ql,qr));
            if (qr>m) ret = min(ret,get(i<<1|1,m+1,r,ql,qr));
            return ret;
        }
    }
    ll get(ll ql, ll qr){
        return get(1,0,n-1,ql,qr);
    }
};
int main(){
    ios::sync_with_stdio(0);cin.tie(0);
    ll n;
    cin >> n;
    vector<ll> a(n);
    ll mxa = 0;
    for(ll &i : a) cin >> i,mxa = max(mxa,i);
    vector<ll> b = a;
    //for(ll i = 1;i<=mxa;i++) b.push_back(i);
    sort(b.begin(),b.end());
    b.erase(unique(b.begin(),b.end()),b.end());
    l ans = 0;
    vector<ll> li = a;
    vector<ll> ri = a;
    for(ll i = 1;i<n;i++) li[i] = max(li[i],li[i-1]);
    for(ll i = n-2;i>=0;i--) ri[i] = max(ri[i],ri[i+1]);
    vector<vector<ll>> add(b.size()),rm(b.size()),fail(b.size());
    for(ll i = 0;i<n;i++){
        ll pos = lower_bound(b.begin(),b.end(),a[i])-b.begin();
        fail[pos].push_back(i);
        if (li[i]>a[i]&&ri[i]>a[i]){
            add[pos].push_back(i);
            ll ed = min(li[i],ri[i]);
            ll ed_pos = lower_bound(b.begin(),b.end(),ed)-b.begin();
            rm[ed_pos].push_back(i);
        }
    }
    segtree t(n);
    for(ll i = 0;i<n;i++) t.set(i,a[i]);
    set<ll> s;
    for(ll j = 0;j<b.size()-1;j++){
        l de = b[j+1]-b[j];
        /*vector<ll> v;
        for(ll i = 0;i<n;i++){
            if (a[i]<=b[j]&&li[i]>b[j]&&ri[i]>b[j]) v.push_back(i);
        }*/
        for(ll i : add[j]) s.insert(i);
        for(ll i : fail[j]) t.set(i,big);
        for(ll i : rm[j]) s.erase(i);
        if(s.empty()) continue;
        ll v_front = *s.begin();
        ll v_back = *s.rbegin();
        //cout << b[j] << ":";
        //for(ll i : s) cout << " " << i;
        //cout << "\n";
        //for(ll i = 0;i<n;i++) cout << L[i] << " \n"[i+1==n];
        //for(ll i = 0;i<n;i++) cout << R[i] << " \n"[i+1==n];
        if (s.size()==1){
            ll i = v_front;
            ans = ans+l(t.get(0,i)+t.get(i,n-1)+b[j])*de+de*(de-1)*rev2;
        }else{
            l base = (t.get(0,v_front)+t.get(v_back,n-1)+t.get(0,n-1));
            l cnt0 = (ll)s.size();
            l cnt = (cnt0*2-3);
            //cout << base << " " << cnt << " " << de << "\n";
            l bj = b[j];
            ans = ans+base*de+cnt*(de*bj+de*(de+1)*rev2)+cnt0*(bj*de+de*(de-1)*rev2);
        }
    }
    cout << ans << "\n";
}

Compilation message (stderr)

Main.cpp: In member function 'void segtree::set(ll, ll, ll, ll, ll)':
Main.cpp:49:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   49 |             ll m = l+r>>1;
      |                    ~^~
Main.cpp: In member function 'll segtree::get(ll, ll, ll, ll, ll)':
Main.cpp:61:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   61 |             ll m = l+r>>1;
      |                    ~^~
Main.cpp: In function 'int main()':
Main.cpp:102:19: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |     for(ll j = 0;j<b.size()-1;j++){
      |                  ~^~~~~~~~~~~

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