제출 #304648

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
304648		nicolaalexandra	Fancy Fence (CEOI20_fancyfence)	C++14	100 / 100	179 ms	5496 KiB

fancyfence

#include <bits/stdc++.h>
#define DIM 100010
#define MOD 1000000007

using namespace std;

long long h[DIM],w[DIM];
deque<pair <long long,long long> > d;
int n,i;
int main (){

    //ifstream cin ("date.in");
    //ofstream cout ("date.out");

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

    n++; /// mai adaug un dreptunghi fictiv

    d.push_back(make_pair(0,0));
    long long sol = 0;
    for (i=1;i<=n;i++){
        long long latime = 0;
        while (!d.empty() && h[i] < d.back().first){

            /// trb sa adun partea de sus care ar ramane cand scot asta din stiva
            long long h_ant = max (h[i],d[d.size()-2].first);
            long long dif = (d.back().first - h_ant + MOD) % MOD; /// inalimea partii de sus
            latime = (latime + d.back().second) % MOD;

            /// mai trb sa numar si dreptunghiurile care au inceputu in partea aia de sus si se continua in jos

            sol += ( dif * (dif + 1) / 2 % MOD + dif * h_ant % MOD) % MOD * (1LL * latime * (latime+1) / 2 % MOD) % MOD;
            sol %= MOD;

            d.pop_back();
        }

        w[i] = (w[i] + latime) % MOD;

        if (h[i] == d.back().first)
            d.back().second = (d.back().second + w[i]) % MOD;

        else d.push_back(make_pair(h[i],w[i]));
    }

    cout<<(sol+MOD)%MOD;


    return 0;
}

• Subtask 1: 0 / 0
• Subtask 2: 12 / 12
• Subtask 3: 13 / 13
• Subtask 4: 15 / 15
• Subtask 5: 15 / 15
• Subtask 6: 18 / 18
• Subtask 7: 27 / 27