oj.uz

답안 #946773

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
946773 2024-03-15T04:34:31 Z GrindMachine Fancy Fence (CEOI20_fancyfence) C++17
100 / 100
 28 ms 5340 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n; cin >> n;
    vector<pll> a(n+5);
    rep1(i,n) cin >> a[i].ff;
    rep1(i,n) cin >> a[i].ss;

    vector<ll> p(n+5);
    rep1(i,n+1) p[i] = p[i-1]+a[i].ss;

    ll inv2 = (MOD+1)/2;

    auto ap_sum = [&](ll l, ll r){
        l %= MOD, r %= MOD;
        ll res = r*(r+1)-l*(l-1);
        res = (res%MOD+MOD)%MOD;
        res = res*inv2%MOD;
        return res;
    };

    ll s = 0;
    rep1(i,n) s += a[i].ss;

    // intra block
    ll ans = 0;
    rep1(i,n){
        auto [h,w] = a[i];
        ans += ap_sum(0,h)*ap_sum(0,w);
        ans %= MOD;
    }

    // inter block
    auto f = [&](ll l, ll r){
        ll wsum = (p[r]-p[l-1])%MOD;
        ll hways = ap_sum(0,a[l].ff);
        return wsum*hways%MOD;
    };

    vector<ll> stk;
    ll sum = 0;
    stk.pb(n+1);

    rev(i,n,1){
        auto [h,w] = a[i];
        while(h <= a[stk.back()].ff){
            ll siz = sz(stk);
            sum -= f(stk[siz-1],stk[siz-2]-1);
            sum = (sum%MOD+MOD)%MOD;
            stk.pop_back();
        }

        ll add = sum;

        {
            ll l = i+1, r = stk.back()-1;
            ll wsum = (p[r]-p[l-1])%MOD;
            ll hways = ap_sum(0,h);
            add = (add+wsum*hways)%MOD;
        }

        ans = (ans+add*w)%MOD;
        
        sum = (sum+f(i,stk.back()-1))%MOD;
        stk.pb(i);
    }

    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
0.0 / 0.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 11 ms 2140 KB Output is correct
4 Correct 17 ms 3728 KB Output is correct
5 Correct 17 ms 3804 KB Output is correct
6 Correct 18 ms 3928 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 3 ms 860 KB Output is correct
3 Correct 16 ms 2136 KB Output is correct
4 Correct 28 ms 3892 KB Output is correct
5 Correct 21 ms 4688 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 500 KB Output is correct
3 Correct 4 ms 860 KB Output is correct
4 Correct 12 ms 2236 KB Output is correct
5 Correct 21 ms 4072 KB Output is correct
6 Correct 24 ms 4688 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 3 ms 856 KB Output is correct
9 Correct 11 ms 2520 KB Output is correct
10 Correct 22 ms 4436 KB Output is correct
11 Correct 21 ms 4708 KB Output is correct
12 Correct 0 ms 348 KB Output is correct

Subtask #6
18.0 / 18.0

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

Subtask #7
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 11 ms 2228 KB Output is correct
12 Correct 17 ms 3676 KB Output is correct
13 Correct 17 ms 3968 KB Output is correct
14 Correct 18 ms 3984 KB Output is correct
15 Correct 1 ms 500 KB Output is correct
16 Correct 3 ms 744 KB Output is correct
17 Correct 11 ms 2396 KB Output is correct
18 Correct 21 ms 4688 KB Output is correct
19 Correct 21 ms 4696 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 3 ms 856 KB Output is correct
22 Correct 12 ms 2396 KB Output is correct
23 Correct 22 ms 4580 KB Output is correct
24 Correct 28 ms 4948 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 3 ms 860 KB Output is correct
31 Correct 2 ms 860 KB Output is correct
32 Correct 12 ms 2524 KB Output is correct
33 Correct 11 ms 2396 KB Output is correct
34 Correct 21 ms 4568 KB Output is correct
35 Correct 20 ms 4440 KB Output is correct
36 Correct 22 ms 4688 KB Output is correct
37 Correct 22 ms 4688 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 22 ms 4548 KB Output is correct
40 Correct 21 ms 4688 KB Output is correct
41 Correct 22 ms 4948 KB Output is correct
42 Correct 21 ms 5340 KB Output is correct