oj.uz

답안 #491861

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
491861 2021-12-04T20:15:47 Z ValiAntonie Fancy Fence (CEOI20_fancyfence) C++14
12 / 100
 42 ms 980 KB 
#include <bits/stdc++.h>
#define mod 1000000007
using namespace std;

stack <pair<long long,long long>> S;
long long n,v[100005],i,dr[100005],st[100005],x,suma[100001],mars[100001],j,val,Max[100005];
pair <long long,long long > sor[100005];
long long total;
long long rectCount(long long n, long long m)
{
    return ((((((1LL * m % 1000000007 * n % 1000000007) % 1000000007 * (n + 1) % 1000000007) % 1000000007 * (m + 1)) % 1000000007) % 1000000007)/ 4) % 1000000007;
}


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;
}
sort(sor+1,sor+n+1);
for(i=1;i<=n;i++){
    cin>>x;
    suma[i] = (suma[i-1] % 1000000007+ x) % 1000000007;
}
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});
}
for(i=1;i<=n;i++){
    if(!dr[i])
    dr[i] = n + 1;
}
for(i=1;i<=n;i++){
    total += rectCount(suma[dr[sor[i].second]-1] - suma[st[sor[i].second]],sor[i].first) % 1000000007;
    total -= rectCount(suma[dr[sor[i].second]-1] - suma[st[sor[i].second]],Max[sor[i].second]) % 1000000007;
    for(j=st[sor[i].second];j<=dr[sor[i].second];j++){
        Max[j] = sor[i].first;
    }
}
cout << total % 1000000007;
    return 0;
}

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Incorrect 1 ms 332 KB Output isn't correct

Subtask #2
12.0 / 12.0

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

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Incorrect 1 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Incorrect 42 ms 972 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Incorrect 38 ms 980 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Incorrect 1 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Incorrect 1 ms 332 KB Output isn't correct