oj.uz

답안 #491867

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

stack <pair<long long,long long>> S;
unsigned 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 mulmod(long long a, long long b)
{
    long long res = 0;
    a = a % mod;
    while (b > 0)
    {
        if (b % 2 == 1)
            res = (res + a) % mod;

        a = (a * 2) % mod;

        b /= 2;
    }

    return (res % mod);
}


long long rectCount(long long x, long long y){
    return mulmod(mulmod(x / 2,x+1),mulmod(y / 2,y+1));
}


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

Compilation message

fancyfence.cpp: In function 'int main()':
fancyfence.cpp:51:34: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'long long int' [-Wsign-compare]
   51 |     while(S.empty() == false && x<S.top().first){
      |                                 ~^~~~~~~~~~~~~~
fancyfence.cpp:62:35: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'long long int' [-Wsign-compare]
   62 |     while(S.empty() == false && x < S.top().first){
      |                                 ~~^~~~~~~~~~~~~~~

Subtask #1
0 / 0.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 15.0

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

Subtask #6
0 / 18.0

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

Subtask #7
0 / 27.0

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