Submission #967995

#	Time	Username	Problem	Language	Result	Execution time	Memory
967995		LittleOrange	Real Mountains (CCO23_day1problem2)	C++17	10 / 25	1882 ms	61548 KiB

Main

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e6+3;
const ll big = 1e18;
struct obj{
    ll i,h;
    bool operator<(const obj &o) const{
        return h<o.h;
    }
};
struct segtree{
    ll n;
    vector<obj> a;
    segtree(ll N):n(N),a(N<<2){}
    void set(ll i, ll l, ll r, ll x, ll o){
        if (l==r) a[i] = {l,o};
        else{
            ll m = l+r>>1;
            if (x<=m) set(i<<1,l,m,x,o);
            else set(i<<1|1,m+1,r,x,o);
            a[i] = min(a[i<<1],a[i<<1|1]);
        }
    }
    void set(ll x, ll o){
        set(1,0,n-1,x,o);
    }
    obj get(ll i, ll l, ll r, ll ql, ll qr){
        if (ql<=l&&r<=qr) return a[i];
        ll m = l+r>>1;
        if (qr<=m) return get(i<<1,l,m,ql,qr);
        if (ql>m) return get(i<<1|1,m+1,r,ql,qr);
        return min(get(i<<1,l,m,ql,qr),get(i<<1|1,m+1,r,ql,qr));
    }
    obj 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);
    for(ll &i : a) cin >> i;
    vector<ll> b = a;
    sort(b.begin(),b.end());
    b.erase(unique(b.begin(),b.end()),b.end());
    ll ans = 0;
    vector<ll> l = a;
    vector<ll> r = a;
    for(ll i = 1;i<n;i++) l[i] = max(l[i],l[i-1]);
    for(ll i = n-2;i>=0;i--) r[i] = max(r[i],r[i+1]);
    for(ll j = 0;j<b.size()-1;j++){
        ll de = b[j+1]-b[j];
        vector<ll> v;
        for(ll i = 0;i<n;i++){
            if (a[i]<=b[j]&&l[i]>b[j]&&r[i]>b[j]) v.push_back(i);
        }
        if(v.empty()) break;
        //cout << b[j] << ":";
        //for(ll i : v) cout << " " << i;
        //cout << "\n";
        vector<ll> L(n,big),R(n,big);
        for(ll i = 0;i<n;i++) if(a[i]>b[j]) L[i] = R[i] = a[i];
        for(ll i = 1;i<n;i++) L[i] = min(L[i],L[i-1]);
        for(ll i = n-2;i>=0;i--) R[i] = min(R[i],R[i+1]);
        //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];
        de%=mod;
        if (v.size()==1){
            ll i = v[0];
            ans += (L[i]+R[i]+b[j])*de%mod+(de*(de-1)/2)%mod;
        }else{
            ll base = L[v.front()]+R[v.back()]+min(R[v.front()],L[v.back()]);
            ll cnt = v.size()*2-3;
            ll cnt0 = v.size();
            //cout << base << " " << cnt << " " << de << "\n";
            ans += base*de%mod+cnt*(b[j]*de%mod+de*(de+1)/2%mod)%mod+cnt0*(b[j]*de%mod+de*(de-1)/2%mod)%mod;
        }
        ans%=mod;
    }
    cout << ans%mod << "\n";
}

Compilation message (stderr)

Main.cpp: In member function 'void segtree::set(ll, ll, ll, ll, ll)':
Main.cpp:19:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   19 |             ll m = l+r>>1;
      |                    ~^~
Main.cpp: In member function 'obj segtree::get(ll, ll, ll, ll, ll)':
Main.cpp:30:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   30 |         ll m = l+r>>1;
      |                ~^~
Main.cpp: In function 'int main()':
Main.cpp:53: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]
   53 |     for(ll j = 0;j<b.size()-1;j++){
      |                  ~^~~~~~~~~~~

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