oj.uz

답안 #1019355

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1019355 2024-07-10T18:13:06 Z DobromirAngelov Fancy Fence (CEOI20_fancyfence) C++14
100 / 100
 48 ms 3520 KB 
#include<bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second

using namespace std;

const int MAXN=1e5+5;
const int MOD=1e9+7;
const int INV2SQ=250000002;

int n;
int h[MAXN];
int w[MAXN];
long long pref[MAXN];
int ord[MAXN];
bool used[MAXN];
vector<pair<int,int> > ev;
pair<int,int> rng[MAXN];
int ans=0;

int rect(long long w,long long h)
{
    w%=MOD;
    h%=MOD;
    return (((w*(w+1))%MOD)*((h*(h+1))%MOD)%MOD*INV2SQ)%MOD;
}

void sum(int &a,int val)
{
    a+=val;
    if(a>=MOD) a-=MOD;
}

void subtr(int &a,int val)
{
    a-=val;
    if(a<0) a+=MOD;
}

void addL(int ind)
{
    ev.push_back({rng[ind-1].fi, ind});
    long long d=pref[ind-1]-pref[rng[ind-1].fi-1];
    subtr(ans, rect(d,h[ind]));
}

void changeRngL(int ind)
{
    int l=rng[ind-1].fi;
    int r=rng[ind].se;
    rng[l]={rng[l].fi, rng[r].se};
    rng[r]={rng[l].fi, rng[r].se};
}

void addR(int ind)
{
    ev.push_back({ind, rng[ind+1].se});
    long long d=pref[rng[ind+1].se]-pref[ind];
    subtr(ans, rect(d,h[ind]));
}

void changeRngR(int ind)
{
    int l=rng[ind].fi;
    int r=rng[ind+1].se;
    rng[l]={rng[l].fi, rng[r].se};
    rng[r]={rng[l].fi, rng[r].se};
}

void calc(int h)
{
    for(auto cur: ev)
    {
        long long d=pref[cur.se]-pref[cur.fi-1];
        sum(ans, rect(d,h));
    }
    ev.clear();
}

bool cmp(int x,int y)
{
    if(h[x]==h[y]) return x<y;
    return h[x]>h[y];
}

signed main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);

cin>>n;
for(int i=1;i<=n;i++) cin>>h[i];
for(int i=1;i<=n;i++) cin>>w[i];

for(int i=1;i<=n;i++) pref[i]=pref[i-1]+w[i];
for(int i=1;i<=n;i++) rng[i]={i,i};

iota(ord,ord+n,1);
sort(ord,ord+n,cmp);

for(int i=0;i<n;i++)
{
    if(i>0 && h[ord[i]]<h[ord[i-1]]) calc(h[ord[i-1]]);

    int ind=ord[i];

    pair<int,int> last({-1,-1});
    if(!ev.empty()) last=ev.back();

    if(used[ind-1])
    {
        if(ind-1==last.se) last.se++, ev.back().se++;
        else addL(ind);
        changeRngL(ind);
    }
    if(ev.size()>0) last=ev.back();
    if(used[ind+1])
    {
        if(last.se==ind)
        {
            last.se=rng[ind+1].se; ev.back().se=rng[ind+1].se;
            long long d=pref[rng[ind+1].se]-pref[ind];
            subtr(ans, rect(d,h[ind]));
        }
        else addR(ind);
        changeRngR(ind);
    }

    if(!used[ind-1] && !used[ind+1]) sum(ans, rect(w[ind], h[ind]));

    used[ind]=1;
}
calc(h[ord[n-1]]);

cout<<ans<<endl;

return 0;
}

Subtask #1
0.0 / 0.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 10 ms 2908 KB Output is correct
4 Correct 19 ms 3164 KB Output is correct
5 Correct 20 ms 3420 KB Output is correct
6 Correct 17 ms 3420 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 9 ms 2704 KB Output is correct
4 Correct 26 ms 3160 KB Output is correct
5 Correct 22 ms 3164 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 4 ms 2396 KB Output is correct
4 Correct 17 ms 2688 KB Output is correct
5 Correct 26 ms 3296 KB Output is correct
6 Correct 20 ms 3164 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 2 ms 2392 KB Output is correct
9 Correct 10 ms 2908 KB Output is correct
10 Correct 18 ms 3236 KB Output is correct
11 Correct 19 ms 3164 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct

Subtask #6
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct

Subtask #7
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2408 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 12 ms 2916 KB Output is correct
12 Correct 24 ms 3332 KB Output is correct
13 Correct 23 ms 3520 KB Output is correct
14 Correct 22 ms 3416 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 4 ms 2396 KB Output is correct
17 Correct 17 ms 2908 KB Output is correct
18 Correct 25 ms 3264 KB Output is correct
19 Correct 22 ms 3160 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 2 ms 2396 KB Output is correct
22 Correct 12 ms 2912 KB Output is correct
23 Correct 28 ms 3164 KB Output is correct
24 Correct 19 ms 3164 KB Output is correct
25 Correct 0 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2552 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 3 ms 2396 KB Output is correct
31 Correct 3 ms 2392 KB Output is correct
32 Correct 21 ms 2908 KB Output is correct
33 Correct 13 ms 2908 KB Output is correct
34 Correct 27 ms 3288 KB Output is correct
35 Correct 28 ms 3164 KB Output is correct
36 Correct 27 ms 3296 KB Output is correct
37 Correct 48 ms 3164 KB Output is correct
38 Correct 1 ms 2396 KB Output is correct
39 Correct 34 ms 3284 KB Output is correct
40 Correct 25 ms 3164 KB Output is correct
41 Correct 22 ms 3164 KB Output is correct
42 Correct 43 ms 3252 KB Output is correct