oj.uz

Submission #791399

# Submission time Handle Problem Language Result Execution time Memory
791399 2023-07-24T06:01:51 Z peteza Fancy Fence (CEOI20_fancyfence) C++14
30 / 100
 27 ms 4164 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;

ll n, h[100005], w[100005];
stack<pll> stk;

ll mod = 1e9+7, mod6 = 166666668ll;
ll cans = 0, csum = 0;

void upd(ll&x){
    if(x<0) x += mod;
    if(x >= mod) x-=mod;
}

ll func(ll x) {
    return (x*(x+1)/2)%mod;
}

int main() {
    cin.tie(0) -> sync_with_stdio(0);
    cin >> n;
    for(int i=0;i<n;i++) cin >> h[i];
    for(int i=0;i<n;i++) cin >> w[i];
    for(int i=0;i<n;i++) {
        cans += (((h[i]+1)*h[i]/2)%mod)*(((w[i]+1)*w[i]/2)%mod)%mod; upd(cans);
        ll cw = w[i];
        while(!stk.empty() && stk.top().first > h[i]) {
            cw += stk.top().second; upd(cw);
            csum -= ((1ll*func(stk.top().first)*stk.top().second) % mod);
            upd(csum);
            stk.pop();
        }
        cans += w[i]*csum%mod; upd(cans);
        stk.emplace(h[i], cw);
        csum += cw*func(h[i])%mod; upd(csum);
    }
    cout << cans;
}

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 3 ms 828 KB Output is correct
3 Correct 12 ms 2368 KB Output is correct
4 Correct 27 ms 4132 KB Output is correct
5 Correct 24 ms 4072 KB Output is correct
6 Correct 0 ms 328 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 3 ms 848 KB Output is correct
4 Correct 12 ms 2380 KB Output is correct
5 Correct 25 ms 4056 KB Output is correct
6 Correct 25 ms 4124 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 3 ms 828 KB Output is correct
9 Correct 12 ms 2512 KB Output is correct
10 Correct 23 ms 4164 KB Output is correct
11 Correct 24 ms 4044 KB Output is correct
12 Correct 1 ms 212 KB Output is correct

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -