oj.uz

답안 #534883

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
534883 2022-03-09T05:40:18 Z vector Fancy Fence (CEOI20_fancyfence) C++17
15 / 100
 1000 ms 2680 KB 
#include<bits/stdc++.h>
#define MOD 1000000007
#define SIZE 100010
using namespace std;
typedef long long ll;
struct st2
{
    ll h,w,idx;
};
ll N,psum[SIZE],ans;
pair<ll,ll>seg[SIZE<<2];
st2 A[SIZE];
vector<st2>v;
void init(ll l,ll r,ll node)
{
    if(l==r){
        seg[node]={v[l].h,v[l].h};
        return;
    }
    ll mid=l+r>>1;
    init(l,mid,node<<1);
    init(mid+1,r,node<<1|1);
    seg[node]={max(seg[node<<1].first,seg[node<<1|1].first),min(seg[node<<1].second,seg[node<<1|1].second)};
}
pair<ll,ll>query(ll l,ll r,ll node,ll s,ll e)
{
    if(l>e||r<s||s>e)return {0,1e18};
    if(l==r)return seg[node];
    ll mid=l+r>>1;
    pair<ll,ll>p=query(l,mid,node<<1,s,e),q=query(mid+1,r,node<<1|1,s,e);
    return {max(p.first,q.first),min(p.second,q.second)};
}
ll S(ll x)
{
    x%=MOD;
    return (x*(x+1)/2)%MOD;
}
int main()
{
    ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    cin>>N;
    for(int i=1;i<=N;i++)cin>>A[i].h;
    for(int i=1;i<=N;i++)cin>>A[i].w;
    bool f=false;
    st2 temp={0,0,0};
    v.push_back(temp);
    for(int i=1;i<=N;i++){
        if(f){
            if(temp.h==A[i].h)temp.w+=A[i].w;
            else{
                v.push_back(temp);
                f=false;
            }
        }
        if(!f){
            temp.h=A[i].h;
            temp.w=A[i].w;
            f=true;
        }
    }
    v.push_back(temp);
    N=v.size()-1;
    for(int i=1;i<=N;i++){
        v[i].idx=i;
        psum[i]=psum[i-1]+v[i].w;
    }
    init(1,N,1);
    for(int i=1;i<=N;i++){
        ll l=1,r=i,mid,a,b,c,d,mx=0;
        pair<ll,ll>t;
        while(l<r){
            mid=l+r>>1;
            t=query(1,N,1,mid,i);
            if(t.second>=v[i].h)r=mid;
            else l=mid+1;
        }
        a=r;
        l=i,r=N;
        while(l<r){
            mid=l+r+1>>1;
            t=query(1,N,1,i,mid);
            if(t.second>=v[i].h)l=mid;
            else r=mid-1;
        }
        b=l;
        l=1,r=i;
        while(l<r){
            mid=l+r>>1;
            t=query(1,N,1,mid,i);
            if(t.first<=v[i].h)r=mid;
            else l=mid+1;
        }
        c=r;
        l=i,r=N;
        while(l<r){
            mid=l+r+1>>1;
            t=query(1,N,1,i,mid);
            if(t.first<=v[i].h)l=mid;
            else r=mid-1;
        }
        d=l;
        mx=max(query(1,N,1,c,i-1).first,query(1,N,1,i+1,d).first);
        ans=(ans+S(psum[b]-psum[a-1])*(S(v[i].h)-S(mx)+MOD))%MOD;
    }
    cout<<ans;
}

Compilation message

fancyfence.cpp: In function 'void init(ll, ll, ll)':
fancyfence.cpp:20:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   20 |     ll mid=l+r>>1;
      |            ~^~
fancyfence.cpp: In function 'std::pair<long long int, long long int> query(ll, ll, ll, ll, ll)':
fancyfence.cpp:29:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   29 |     ll mid=l+r>>1;
      |            ~^~
fancyfence.cpp: In function 'int main()':
fancyfence.cpp:72:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   72 |             mid=l+r>>1;
      |                 ~^~
fancyfence.cpp:80:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   80 |             mid=l+r+1>>1;
      |                 ~~~^~
fancyfence.cpp:88:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   88 |             mid=l+r>>1;
      |                 ~^~
fancyfence.cpp:96:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   96 |             mid=l+r+1>>1;
      |                 ~~~^~

Subtask #1
0.0 / 0.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 13.0

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

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 460 KB Output is correct
3 Correct 10 ms 1396 KB Output is correct
4 Correct 19 ms 2636 KB Output is correct
5 Correct 24 ms 2672 KB Output is correct
6 Correct 0 ms 332 KB Output is correct

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 11 ms 1496 KB Output is correct
5 Correct 20 ms 2636 KB Output is correct
6 Correct 22 ms 2680 KB Output is correct
7 Correct 70 ms 332 KB Output is correct
8 Execution timed out 1083 ms 1480 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

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

Subtask #7
0 / 27.0

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