oj.uz

Submission #967993

# Submission time Handle Problem Language Result Execution time Memory
967993 2024-04-23T06:39:45 Z LittleOrange Real Mountains (CCO23_day1problem2) C++17
10 / 25
 1852 ms 56004 KB 
#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];
        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

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.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 6 ms 772 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 496 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 6 ms 764 KB Output is correct
12 Correct 6 ms 776 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 6 ms 772 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 496 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 6 ms 764 KB Output is correct
12 Correct 6 ms 776 KB Output is correct
13 Correct 8 ms 776 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 8 ms 776 KB Output is correct
17 Correct 8 ms 780 KB Output is correct
18 Correct 8 ms 776 KB Output is correct
19 Correct 8 ms 764 KB Output is correct
20 Correct 2 ms 740 KB Output is correct
21 Correct 1 ms 776 KB Output is correct
22 Correct 2 ms 980 KB Output is correct
23 Correct 6 ms 756 KB Output is correct
24 Correct 6 ms 776 KB Output is correct
25 Correct 6 ms 764 KB Output is correct
26 Correct 6 ms 776 KB Output is correct
27 Correct 6 ms 764 KB Output is correct
28 Correct 6 ms 764 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 600 KB Output is correct

Subtask #3
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 6 ms 772 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 496 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 6 ms 764 KB Output is correct
12 Correct 6 ms 776 KB Output is correct
13 Correct 8 ms 776 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 8 ms 776 KB Output is correct
17 Correct 8 ms 780 KB Output is correct
18 Correct 8 ms 776 KB Output is correct
19 Correct 8 ms 764 KB Output is correct
20 Correct 2 ms 740 KB Output is correct
21 Correct 1 ms 776 KB Output is correct
22 Correct 2 ms 980 KB Output is correct
23 Correct 6 ms 756 KB Output is correct
24 Correct 6 ms 776 KB Output is correct
25 Correct 6 ms 764 KB Output is correct
26 Correct 6 ms 776 KB Output is correct
27 Correct 6 ms 764 KB Output is correct
28 Correct 6 ms 764 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 600 KB Output is correct
35 Correct 327 ms 900 KB Output is correct
36 Correct 327 ms 748 KB Output is correct
37 Correct 330 ms 888 KB Output is correct
38 Correct 326 ms 968 KB Output is correct
39 Correct 322 ms 1208 KB Output is correct
40 Correct 2 ms 772 KB Output is correct
41 Correct 2 ms 776 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 283 ms 756 KB Output is correct
44 Correct 267 ms 856 KB Output is correct
45 Correct 267 ms 752 KB Output is correct
46 Incorrect 1 ms 604 KB Output isn't correct
47 Halted 0 ms 0 KB -

Subtask #4
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 6 ms 772 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 496 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 6 ms 764 KB Output is correct
12 Correct 6 ms 776 KB Output is correct
13 Correct 8 ms 776 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 8 ms 776 KB Output is correct
17 Correct 8 ms 780 KB Output is correct
18 Correct 8 ms 776 KB Output is correct
19 Correct 8 ms 764 KB Output is correct
20 Correct 2 ms 740 KB Output is correct
21 Correct 1 ms 776 KB Output is correct
22 Correct 2 ms 980 KB Output is correct
23 Correct 6 ms 756 KB Output is correct
24 Correct 6 ms 776 KB Output is correct
25 Correct 6 ms 764 KB Output is correct
26 Correct 6 ms 776 KB Output is correct
27 Correct 6 ms 764 KB Output is correct
28 Correct 6 ms 764 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 600 KB Output is correct
35 Correct 327 ms 900 KB Output is correct
36 Correct 327 ms 748 KB Output is correct
37 Correct 330 ms 888 KB Output is correct
38 Correct 326 ms 968 KB Output is correct
39 Correct 322 ms 1208 KB Output is correct
40 Correct 2 ms 772 KB Output is correct
41 Correct 2 ms 776 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 283 ms 756 KB Output is correct
44 Correct 267 ms 856 KB Output is correct
45 Correct 267 ms 752 KB Output is correct
46 Incorrect 1 ms 604 KB Output isn't correct
47 Halted 0 ms 0 KB -

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 6 ms 772 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 496 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 6 ms 764 KB Output is correct
12 Correct 6 ms 776 KB Output is correct
13 Correct 8 ms 776 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 8 ms 776 KB Output is correct
17 Correct 8 ms 780 KB Output is correct
18 Correct 8 ms 776 KB Output is correct
19 Correct 8 ms 764 KB Output is correct
20 Correct 2 ms 740 KB Output is correct
21 Correct 1 ms 776 KB Output is correct
22 Correct 2 ms 980 KB Output is correct
23 Correct 6 ms 756 KB Output is correct
24 Correct 6 ms 776 KB Output is correct
25 Correct 6 ms 764 KB Output is correct
26 Correct 6 ms 776 KB Output is correct
27 Correct 6 ms 764 KB Output is correct
28 Correct 6 ms 764 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 600 KB Output is correct
35 Correct 1852 ms 55820 KB Output is correct
36 Correct 1846 ms 55604 KB Output is correct
37 Correct 1844 ms 56004 KB Output is correct
38 Correct 1813 ms 55576 KB Output is correct
39 Correct 1824 ms 55800 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 253 ms 55600 KB Output is correct
43 Correct 251 ms 55636 KB Output is correct
44 Correct 271 ms 55852 KB Output is correct
45 Correct 1444 ms 55800 KB Output is correct
46 Correct 1425 ms 55584 KB Output is correct
47 Correct 1423 ms 55620 KB Output is correct
48 Correct 1528 ms 55684 KB Output is correct
49 Correct 1540 ms 55844 KB Output is correct
50 Correct 1575 ms 55860 KB Output is correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 6 ms 772 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 496 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 6 ms 764 KB Output is correct
12 Correct 6 ms 776 KB Output is correct
13 Correct 8 ms 776 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 8 ms 776 KB Output is correct
17 Correct 8 ms 780 KB Output is correct
18 Correct 8 ms 776 KB Output is correct
19 Correct 8 ms 764 KB Output is correct
20 Correct 2 ms 740 KB Output is correct
21 Correct 1 ms 776 KB Output is correct
22 Correct 2 ms 980 KB Output is correct
23 Correct 6 ms 756 KB Output is correct
24 Correct 6 ms 776 KB Output is correct
25 Correct 6 ms 764 KB Output is correct
26 Correct 6 ms 776 KB Output is correct
27 Correct 6 ms 764 KB Output is correct
28 Correct 6 ms 764 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 600 KB Output is correct
35 Correct 327 ms 900 KB Output is correct
36 Correct 327 ms 748 KB Output is correct
37 Correct 330 ms 888 KB Output is correct
38 Correct 326 ms 968 KB Output is correct
39 Correct 322 ms 1208 KB Output is correct
40 Correct 2 ms 772 KB Output is correct
41 Correct 2 ms 776 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 283 ms 756 KB Output is correct
44 Correct 267 ms 856 KB Output is correct
45 Correct 267 ms 752 KB Output is correct
46 Incorrect 1 ms 604 KB Output isn't correct
47 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 6 ms 772 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 496 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 6 ms 764 KB Output is correct
12 Correct 6 ms 776 KB Output is correct
13 Correct 8 ms 776 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 8 ms 776 KB Output is correct
17 Correct 8 ms 780 KB Output is correct
18 Correct 8 ms 776 KB Output is correct
19 Correct 8 ms 764 KB Output is correct
20 Correct 2 ms 740 KB Output is correct
21 Correct 1 ms 776 KB Output is correct
22 Correct 2 ms 980 KB Output is correct
23 Correct 6 ms 756 KB Output is correct
24 Correct 6 ms 776 KB Output is correct
25 Correct 6 ms 764 KB Output is correct
26 Correct 6 ms 776 KB Output is correct
27 Correct 6 ms 764 KB Output is correct
28 Correct 6 ms 764 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 600 KB Output is correct
35 Correct 327 ms 900 KB Output is correct
36 Correct 327 ms 748 KB Output is correct
37 Correct 330 ms 888 KB Output is correct
38 Correct 326 ms 968 KB Output is correct
39 Correct 322 ms 1208 KB Output is correct
40 Correct 2 ms 772 KB Output is correct
41 Correct 2 ms 776 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 283 ms 756 KB Output is correct
44 Correct 267 ms 856 KB Output is correct
45 Correct 267 ms 752 KB Output is correct
46 Incorrect 1 ms 604 KB Output isn't correct
47 Halted 0 ms 0 KB -