oj.uz

Submission #544386

# Submission time Handle Problem Language Result Execution time Memory
544386 2022-04-01T20:09:44 Z ValiAntonie Fancy Fence (CEOI20_fancyfence) C++17
100 / 100
 31 ms 4352 KB 
#include <bits/stdc++.h>
#define mod 1000000007

using namespace std;

stack <pair<int,int>> S;
int n,v[100005],i,dr[100005],st[100005],x,Max,st2[100005];
long long suma[100001],total1,val1, val2,total2,nr;
pair <int,int > sor[100005];


long long bin(long long  x){
    if(x > mod){
	x %= mod;
    }
    return ((x*(x+1))/2)%mod;
}
long long rectCount(long long x, long long y){
    return (bin(x)*bin(y))%mod;
}


int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n;
for(i=1;i<=n;i++){
    cin>>v[i];
    sor[i].first = v[i];
    sor[i].second = i;
    dr[i] = n + 1;
}
for(i=1;i<=n;i++){
    cin>>x;
    suma[i] = suma[i-1] + x;
}
for(i=1;i<=n;i++){
    x = v[i];
    while(S.empty() == false && x<S.top().first){
        dr[S.top().second] = i;
        S.pop();
    }
    S.push({x,i});
}
while(S.empty() == false){
    S.pop();
}
for(i=n;i>=1;i--){
    x = v[i];
    while(S.empty() == false && x <S.top().first){
        st[S.top().second] = i;
        S.pop();
    }
    S.push({x,i});
}

while(S.empty() == false){
    S.pop();
}
for(i=n;i>=1;i--){
    x = v[i];
    while(S.empty() == false && x<=S.top().first){
        st2[S.top().second] = i;
        S.pop();
    }
    S.push({x,i});
}
for(i=1;i<=n;i++){
    nr = suma[dr[sor[i].second]-1] - suma[st[sor[i].second]];
    total1 = (total1 + rectCount(nr,sor[i].first));
    if(total1 > mod){
        total1 -= mod;
    }
    Max = max(v[st2[sor[i].second]],v[dr[sor[i].second]]);
    total2 = (total2 + rectCount(nr,Max));
    if(total2 > mod){
        total2 -= mod;
    }
}
if(total1 < total2)
    total1 += mod;
cout << total1 - total2;
    return 0;
}

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 11 ms 2004 KB Output is correct
4 Correct 21 ms 3984 KB Output is correct
5 Correct 22 ms 3660 KB Output is correct
6 Correct 21 ms 3476 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 596 KB Output is correct
3 Correct 16 ms 1960 KB Output is correct
4 Correct 26 ms 3584 KB Output is correct
5 Correct 27 ms 3624 KB Output is correct
6 Correct 0 ms 340 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 3 ms 596 KB Output is correct
4 Correct 12 ms 2036 KB Output is correct
5 Correct 25 ms 3596 KB Output is correct
6 Correct 27 ms 3564 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 14 ms 2280 KB Output is correct
10 Correct 28 ms 4268 KB Output is correct
11 Correct 25 ms 4180 KB Output is correct
12 Correct 0 ms 340 KB Output is correct

Subtask #6
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct

Subtask #7
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 12 ms 2004 KB Output is correct
12 Correct 23 ms 3936 KB Output is correct
13 Correct 22 ms 3660 KB Output is correct
14 Correct 21 ms 3420 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 13 ms 2056 KB Output is correct
18 Correct 25 ms 3568 KB Output is correct
19 Correct 27 ms 3568 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 3 ms 724 KB Output is correct
22 Correct 14 ms 2196 KB Output is correct
23 Correct 24 ms 4208 KB Output is correct
24 Correct 27 ms 4352 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 3 ms 596 KB Output is correct
31 Correct 3 ms 596 KB Output is correct
32 Correct 14 ms 1876 KB Output is correct
33 Correct 14 ms 1876 KB Output is correct
34 Correct 28 ms 3412 KB Output is correct
35 Correct 28 ms 3404 KB Output is correct
36 Correct 27 ms 3312 KB Output is correct
37 Correct 31 ms 3440 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 28 ms 3408 KB Output is correct
40 Correct 26 ms 3376 KB Output is correct
41 Correct 25 ms 3412 KB Output is correct
42 Correct 26 ms 3432 KB Output is correct