Submission #907518

#	Time	Username	Problem	Language	Result	Execution time	Memory
907518		sysia	Fancy Fence (CEOI20_fancyfence)	C++17	12 / 100	127 ms	262144 KiB

fancyfence

//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;

void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << "'" << x << "'";}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

#define int long long
typedef pair<int, int> T;
const int oo = 1e18, oo2 = 1e9+7, K = 30;
const int mod = 1e9+7;
const int I = (mod+1)/2;

int mul(int a, int b){
    return (a*b)%mod;
}

int C2(int x){
    return mul(x, mul(x-1, I));
}

void add(int &a, int b){
    a += b;
    if (a >= mod) a-=mod;
}

void solve(){
    int n; cin >> n;
    vector<int>tab;
    vector<int>h(n+1);
    for (int i = 1; i<=n; i++) cin >> h[i];
    for (int i = 1; i<=n; i++){
        int w; cin >> w;
        while (w--) tab.emplace_back(h[i]);
    }
    debug(tab);
    int m = (int)tab.size();
    int ans = 0;
    for (int i = 0; i<m; i++){
        int mn = oo;
        for (int j = i; j<m; j++){
            mn = min(mn, tab[j]);
            add(ans, C2(mn+1));
        }
    }
    cout << ans << "\n";
}

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    //cin >> t;
    while (t--) solve();

    return 0;
}

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