oj.uz

답안 #544351

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
544351 2022-04-01T18:59:20 Z ValiAntonie Fancy Fence (CEOI20_fancyfence) C++17
100 / 100
 44 ms 6120 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,j,val,Max,st2[100005],dr2[100005];
long long suma[100001],total1,val1, val2,total2;
pair <int,int > sor[100005];


long long bin(long long  x){
	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;
}
sort(sor+1,sor+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++){
    total1 = (total1 + rectCount(suma[dr[sor[i].second]-1] - suma[st[sor[i].second]],sor[i].first)) % 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)) % mod;
}
if(total1 < total2)
    total1 += mod;
cout << total1 - total2;
    return 0;
}

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 344 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 324 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 15 ms 2612 KB Output is correct
4 Correct 28 ms 5188 KB Output is correct
5 Correct 29 ms 4872 KB Output is correct
6 Correct 33 ms 4600 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 856 KB Output is correct
3 Correct 14 ms 3004 KB Output is correct
4 Correct 30 ms 5576 KB Output is correct
5 Correct 31 ms 5580 KB Output is correct
6 Correct 1 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 824 KB Output is correct
4 Correct 15 ms 3016 KB Output is correct
5 Correct 29 ms 5528 KB Output is correct
6 Correct 32 ms 5600 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 5 ms 844 KB Output is correct
9 Correct 16 ms 3220 KB Output is correct
10 Correct 28 ms 6060 KB Output is correct
11 Correct 28 ms 6120 KB Output is correct
12 Correct 0 ms 340 KB Output is correct

Subtask #6
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 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 1 ms 340 KB Output is correct

Subtask #7
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 18 ms 2644 KB Output is correct
12 Correct 27 ms 5124 KB Output is correct
13 Correct 29 ms 4856 KB Output is correct
14 Correct 28 ms 4608 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 836 KB Output is correct
17 Correct 15 ms 2968 KB Output is correct
18 Correct 30 ms 5548 KB Output is correct
19 Correct 32 ms 5596 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 3 ms 852 KB Output is correct
22 Correct 16 ms 3264 KB Output is correct
23 Correct 28 ms 5968 KB Output is correct
24 Correct 28 ms 6088 KB Output is correct
25 Correct 1 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 5 ms 852 KB Output is correct
31 Correct 4 ms 856 KB Output is correct
32 Correct 20 ms 2772 KB Output is correct
33 Correct 20 ms 2808 KB Output is correct
34 Correct 39 ms 5068 KB Output is correct
35 Correct 39 ms 5132 KB Output is correct
36 Correct 44 ms 5452 KB Output is correct
37 Correct 39 ms 5288 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 37 ms 5272 KB Output is correct
40 Correct 35 ms 5380 KB Output is correct
41 Correct 30 ms 5328 KB Output is correct
42 Correct 29 ms 5296 KB Output is correct