oj.uz

Submission #946769

# Submission time Handle Problem Language Result Execution time Memory
946769 2024-03-15T04:29:46 Z GrindMachine Fancy Fence (CEOI20_fancyfence) C++17
30 / 100
 1000 ms 3924 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;
    };

    stack<ll> stk;
    ll sum = 0;
    stk.push(n+1);

    rev(i,n,1){
        auto [h,w] = a[i];
        // while(h <= a[stk.top()].ff){
        //     stk.pop();
        // }

        vector<pll> pos;
        pos.pb({i,h});
        for(int j = i+1; j <= n+1; ++j){
            if(a[j].ff < pos.back().ss){
                pos.pb({j,a[j].ff});
            }
        }

        ll siz = sz(pos);
        ll add = 0;

        rep(j,siz-1){
            ll l = pos[j].ff, r = pos[j+1].ff-1;
            add = (add+f(l,r))%MOD;
        }

        add -= f(pos[0].ff,pos[1].ff-1);

        {
            ll l = i+1, r = pos[1].ff-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;
    }

    cout << ans << endl;
}

int main()
{
    fastio;

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

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

    return 0;
}

Compilation message

fancyfence.cpp: In function 'void solve(int)':
fancyfence.cpp:99:8: warning: unused variable 'sum' [-Wunused-variable]
   99 |     ll sum = 0;
      |        ^~~

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 921 ms 2140 KB Output is correct
4 Execution timed out 1024 ms 3556 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 38 ms 828 KB Output is correct
3 Correct 853 ms 2396 KB Output is correct
4 Execution timed out 1101 ms 3924 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 38 ms 860 KB Output is correct
4 Correct 862 ms 2396 KB Output is correct
5 Execution timed out 1035 ms 3920 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #6
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 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 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 456 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 360 KB Output is correct
9 Correct 1 ms 428 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 878 ms 2392 KB Output is correct
12 Execution timed out 1034 ms 3472 KB Time limit exceeded
13 Halted 0 ms 0 KB -