oj.uz

답안 #544388

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
544388 2022-04-01T20:10:58 Z ValiAntonie Fancy Fence (CEOI20_fancyfence) C++17
100 / 100
 32 ms 4284 KB 
#include <bits/stdc++.h>
#define mod 1000000007

using namespace std;

stack <pair<int,int>> S,S2;
int n,v[100005],i,dr[100005],st[100005],x,Max,st2[100005];
long long suma[100001],total1,val1, val2,total2;
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();
    }
    while(S2.empty() == false && x<=S2.top().first){
        st2[S2.top().second] = i;
        S2.pop();
    }
    S2.push({x,i});
    S.push({x,i});
}
for(i=1;i<=n;i++){
    total1 = (total1 + rectCount(suma[dr[sor[i].second]-1] - suma[st[sor[i].second]],sor[i].first));
    if(total1 > mod){
        total1 -= mod;
    }
    Max = max(v[st2[sor[i].second]],v[dr[sor[i].second]]);
    total2 = (total2 + rectCount(suma[dr[sor[i].second]-1] - suma[st[sor[i].second]],Max));
    if(total2 > mod){
        total2 -= mod;
    }
}
if(total1 < total2)
    total1 += mod;
cout << total1 - total2;
    return 0;
}

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 10 ms 2004 KB Output is correct
4 Correct 22 ms 4056 KB Output is correct
5 Correct 22 ms 3696 KB Output is correct
6 Correct 20 ms 3540 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 596 KB Output is correct
3 Correct 12 ms 2128 KB Output is correct
4 Correct 24 ms 3872 KB Output is correct
5 Correct 27 ms 3812 KB Output is correct
6 Correct 0 ms 340 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 3 ms 640 KB Output is correct
4 Correct 14 ms 2132 KB Output is correct
5 Correct 29 ms 3824 KB Output is correct
6 Correct 27 ms 3796 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 15 ms 2284 KB Output is correct
10 Correct 25 ms 4280 KB Output is correct
11 Correct 25 ms 4264 KB Output is correct
12 Correct 0 ms 340 KB Output is correct

Subtask #6
18.0 / 18.0

# 결과 실행 시간 메모리 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 0 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

# 결과 실행 시간 메모리 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 0 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 11 ms 2044 KB Output is correct
12 Correct 21 ms 4024 KB Output is correct
13 Correct 22 ms 3772 KB Output is correct
14 Correct 21 ms 3540 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 2060 KB Output is correct
18 Correct 25 ms 3788 KB Output is correct
19 Correct 31 ms 3908 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 25 ms 4232 KB Output is correct
24 Correct 26 ms 4284 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 576 KB Output is correct
31 Correct 3 ms 596 KB Output is correct
32 Correct 13 ms 1876 KB Output is correct
33 Correct 14 ms 1880 KB Output is correct
34 Correct 25 ms 3432 KB Output is correct
35 Correct 32 ms 3428 KB Output is correct
36 Correct 27 ms 3412 KB Output is correct
37 Correct 29 ms 3400 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 26 ms 3408 KB Output is correct
40 Correct 25 ms 3468 KB Output is correct
41 Correct 24 ms 3488 KB Output is correct
42 Correct 25 ms 3796 KB Output is correct