oj.uz

답안 #855232

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
855232 2023-10-01T01:43:30 Z anhphant Fancy Fence (CEOI20_fancyfence) C++14
73 / 100
 19 ms 19036 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'

ll N, H[500007], W[500007];
const ll mod = 1e9 + 7;

void initialize() {
    ios_base :: sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    if (fopen("FILE.INP", "r")) {
        freopen("FILE.INP", "r", stdin);
        freopen("FILE.OUT", "w", stdout);
    }
    cin >> N;
    for(int i = 1; i <= N; ++i) cin >> H[i];
    for(int i = 1; i <= N; ++i) cin >> W[i];
}

namespace subtask2 {
    ll A[1007][1007];

    void solve() {
        ll lastw = 0;
        for(int i = 1; i <= N; ++i) {
            for(int h = 1; h <= H[i]; ++h) {
                for(int w = lastw + 1; w <= lastw + W[i]; ++w) {
                    A[h][w] = 1;
                }
            }
            lastw += W[i];
        }

        /*for(int i = 1; i <= 50; ++i) {
            for(int j = 1; j <= 50; ++j) {
                cerr << A[i][j];
            }
            cerr << endl;
        }*/

        for(int i = 1; i <= 50; ++i) {
            for(int j = 1; j <= 50; ++j) {
                A[i][j] = A[i][j - 1] + A[i - 1][j] + A[i][j] - A[i - 1][j - 1];
            }
        }

        ll ans = 0;

        for(int i = 1; i <= 50; ++i) {
            for(int j = 1; j <= 50; ++j) {
                for(int k = i; k <= 50; ++k) {
                    for(int l = j; l <= 50; ++l) {
                        ans += (A[k][l] - A[i - 1][l] - A[k][j - 1] + A[i - 1][j - 1])
                                == ((k - i + 1) * (l - j + 1));
                    }
                }
            }
        }

        cout << ans;
    }

    void process() {
        memset(A, 0, sizeof(A));
        solve();
    }
}

namespace subtask3 {
    ll fsum(ll n) {
        ll x1 = n;
        ll x2 = n + 1;
        if (x1 % 2 == 0) x1 /= 2;
        else x2 /= 2;
        x1 %= mod;
        x2 %= mod;
        return (x1 * x2) % mod;
    }

    void solve() {
        vector<ll> split;
        split.push_back(0);
        for(int i = 1; i <= N; ++i) {
            if (H[i] == 1 && split.back() > 0) split.push_back(0);
            if (H[i] == 2) split[split.size() - 1] += W[i];
        }

        ll sum1 = accumulate(W + 1, W + 1 + N, 0LL);
        sum1 = fsum(sum1);
        ll sum2 = 0;
        for(ll c : split) {
            sum2 = (sum2 + fsum(c));
            sum2 %= mod;
        }
        sum2 = (sum2 * 2) % mod;
        cout << (sum1 + sum2) % mod;
    }

    void process() {
        solve();
    }
}

namespace subtask4 {
    ll fsum(ll n) {
        ll x1 = n;
        ll x2 = n + 1;
        if (x1 % 2 == 0) x1 /= 2;
        else x2 /= 2;
        x1 %= mod;
        x2 %= mod;
        return (x1 * x2) % mod;
    }

    void solve() {
        ll sum1 = H[1];
        ll sum2 = accumulate(W + 1, W + 1 + N, 0LL);

        //cerr << sum1 << " " << sum2 << endl;

        cout << (fsum(sum1) * fsum(sum2)) % mod;
    }

    void process() {
        solve();
    }
}

namespace subtask5 {
    ll fsum(ll n) {
        ll x1 = n;
        ll x2 = n + 1;
        if (x1 % 2 == 0) x1 /= 2;
        else x2 /= 2;
        x1 %= mod;
        x2 %= mod;
        return (x1 * x2) % mod;
    }

    void solve() {
        ll sum = accumulate(W + 1, W + 1 + N, 0LL);
        ll ans = 0;

        for(int i = 1; i <= N; ++i) {
            ll total = (fsum(sum) * fsum(H[i])) % mod;
            total -= (fsum(sum) * fsum(H[i - 1])) % mod;
            total = (total + mod) % mod;

            ans = (ans + total) % mod;
            sum -= W[i];
        }

        cout << ans;
    }

    void process() {
        solve();
    }
}

namespace subtask6 {
    ll fsum(ll n) {
        ll x1 = n;
        ll x2 = n + 1;
        if (x1 % 2 == 0) x1 /= 2;
        else x2 /= 2;
        x1 %= mod;
        x2 %= mod;
        return (x1 * x2) % mod;
    }

    ll rmin[1007][1007];

    void rmin_calculate() {
        for(int i = 1; i <= N; ++i) {
            rmin[i][i] = H[i];
            for(int j = i + 1; j <= N; ++j) {
                rmin[i][j] = min(rmin[i][j - 1], H[j]);
            }
        }

        /*for(int i = 1; i <= N; ++i) {
            for(int j = i; j <= N; ++j) {
                cerr << i << " " << j << " " << rmin[i][j] << endl;
            }
        }*/
    }

    void solve() {
        ll ans = 0;

        for(int i = 1; i <= N; ++i) {
            ans += (fsum(H[i]) * fsum(W[i])) % mod;
            ans %= mod;
        }

        for(int i = 1; i <= N; ++i) {
            for(int j = i + 1; j <= N; ++j) {
                ll total = fsum(rmin[i][j]);
                total = (total * W[i]) % mod;
                total = (total * W[j]) % mod;
                ans += total;
                ans %= mod;

                /*cerr << i << " " << j << endl;
                cerr << rmin[i][j] << " " << W[i] << " " << W[j] << " " << total << endl;
                cerr << endl;*/
            }
        }

        cout << ans;
    }

    void process() {
        rmin_calculate();
        solve();
    }
}

namespace subtask7 {
    ll fsum(ll n) {
        ll x1 = n;
        ll x2 = n + 1;
        if (x1 % 2 == 0) x1 /= 2;
        else x2 /= 2;
        x1 %= mod;
        x2 %= mod;
        return (x1 * x2) % mod;
    }

    void Cong(ll& a, ll b) {
        a = ((a % mod) + (b % mod)) % mod;
    }

    ll Tong(ll a, ll b) {
        return ((a % mod) + (b % mod)) % mod;
    }

    void Tru(ll& a, ll b) {
        a = ((a % mod) - (b % mod) + mod) % mod;
    }

    ll Hieu(ll a, ll b) {
        return ((a % mod) - (b % mod) + mod) % mod;
    }

    void Nhan(ll& a, ll b) {
        a = ((a % mod) * (b % mod)) % mod;
    }

    ll Tich(ll a, ll b) {
        return ((a % mod) * (b % mod)) % mod;
    }

    pair<pair<ll, ll>, ll> A[100007];
    set<pair<ll, ll>> se;
    ll PreSumW[100007];
    ll ans = 0;
    ll fsum_segment = 0;

    void pre_process() {
        for(int i = 1; i <= N; ++i) A[i] = {{H[i], W[i]}, i};
        se.insert({1, N});
        for(int i = 1; i <= N; ++i) PreSumW[i] = PreSumW[i - 1] + W[i];

        sort(A + 1, A + 1 + N);

        fsum_segment = fsum(accumulate(W + 1, W + 1 + N, 0LL));
        ans = Tich(fsum_segment, A[1].first.first);
    }

    void solve() {
        for(int i = 1; i <= N; ++i) {
            if (A[i].first.first > A[i - 1].first.first) {
                ll tmp = Tich(fsum_segment, A[i].first.first);
                Tru(tmp, Tich(fsum_segment, A[i - 1].first.first));
                Cong(ans, tmp);
            }

            pair<ll, ll> s = *prev(se.lower_bound({A[i].second, 9999999999}));
            assert(s.first <= A[i].second && A[i].second <= s.second);

            Tru(fsum_segment, fsum(PreSumW[s.second] - PreSumW[s.first - 1]));
            se.erase(s);

            pair<ll, ll> sleft = {s.first, A[i].second - 1};
            pair<ll, ll> sright = {A[i].second + 1, s.second};

            if (sleft.first <= sleft.second) {
                Cong(fsum_segment, fsum(PreSumW[sleft.second] - PreSumW[sleft.first - 1]));
                se.insert(sleft);
            }
            if (sright.first <= sright.second) {
                Cong(fsum_segment, fsum(PreSumW[sright.second] - PreSumW[sright.first]));
                se.insert(sright);
            }
        }

        cout << ans;
    }

    void process() {
        pre_process();
        solve();
    }
}

int main() {
    initialize();

    ll maxh = *max_element(H + 1, H + 1 + N);
    ll minh = *min_element(H + 1, H + 1 + N);
    ll maxw = *max_element(W + 1, W + 1 + N);
    ll minw = *min_element(W + 1, W + 1 + N);

    if (N <= 50 && maxh <= 50 && maxw == 1) subtask2 :: process();
    else if (maxh == 2) subtask3 :: process();
    else if (minh == maxh) subtask4 :: process();
    else if (is_sorted(H + 1, H + 1 + N)) subtask5 :: process();
    else if (N <= 1000) subtask6 :: process();
    else subtask7 :: process();
}

Compilation message

fancyfence.cpp: In function 'int main()':
fancyfence.cpp:315:8: warning: unused variable 'minw' [-Wunused-variable]
  315 |     ll minw = *min_element(W + 1, W + 1 + N);
      |        ^~~~
fancyfence.cpp: In function 'void initialize()':
fancyfence.cpp:13:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |         freopen("FILE.INP", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
fancyfence.cpp:14:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |         freopen("FILE.OUT", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0.0 / 0.0

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

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 16728 KB Output is correct
2 Correct 5 ms 16732 KB Output is correct
3 Correct 5 ms 16732 KB Output is correct
4 Correct 5 ms 16732 KB Output is correct
5 Correct 5 ms 16856 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 8 ms 9176 KB Output is correct
4 Correct 13 ms 9548 KB Output is correct
5 Correct 14 ms 9816 KB Output is correct
6 Correct 13 ms 9560 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Correct 3 ms 8860 KB Output is correct
3 Correct 8 ms 9308 KB Output is correct
4 Correct 16 ms 9804 KB Output is correct
5 Correct 16 ms 9796 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 4 ms 8792 KB Output is correct
4 Correct 8 ms 9304 KB Output is correct
5 Correct 16 ms 9816 KB Output is correct
6 Correct 17 ms 9820 KB Output is correct
7 Correct 1 ms 8536 KB Output is correct
8 Correct 4 ms 8796 KB Output is correct
9 Correct 10 ms 9308 KB Output is correct
10 Correct 17 ms 9820 KB Output is correct
11 Correct 19 ms 9820 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct

Subtask #6
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 9 ms 18944 KB Output is correct
3 Correct 5 ms 16732 KB Output is correct
4 Correct 6 ms 16732 KB Output is correct
5 Correct 5 ms 16848 KB Output is correct
6 Correct 6 ms 16732 KB Output is correct
7 Correct 5 ms 16732 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 1 ms 8540 KB Output is correct
10 Correct 1 ms 8672 KB Output is correct
11 Correct 1 ms 10584 KB Output is correct
12 Correct 4 ms 14680 KB Output is correct
13 Correct 10 ms 19036 KB Output is correct
14 Correct 8 ms 19032 KB Output is correct
15 Correct 9 ms 18780 KB Output is correct
16 Correct 1 ms 8540 KB Output is correct

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 11 ms 18780 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 10 ms 18948 KB Output is correct
5 Correct 5 ms 16732 KB Output is correct
6 Correct 5 ms 16740 KB Output is correct
7 Correct 5 ms 16872 KB Output is correct
8 Correct 5 ms 16732 KB Output is correct
9 Correct 5 ms 16732 KB Output is correct
10 Correct 1 ms 8540 KB Output is correct
11 Correct 9 ms 9308 KB Output is correct
12 Correct 14 ms 9692 KB Output is correct
13 Correct 13 ms 9820 KB Output is correct
14 Correct 15 ms 9552 KB Output is correct
15 Correct 2 ms 8540 KB Output is correct
16 Correct 3 ms 8800 KB Output is correct
17 Correct 9 ms 9312 KB Output is correct
18 Correct 16 ms 9828 KB Output is correct
19 Correct 17 ms 9820 KB Output is correct
20 Correct 1 ms 8536 KB Output is correct
21 Correct 3 ms 8800 KB Output is correct
22 Correct 12 ms 9396 KB Output is correct
23 Correct 18 ms 9928 KB Output is correct
24 Correct 19 ms 9820 KB Output is correct
25 Correct 2 ms 10584 KB Output is correct
26 Correct 4 ms 14680 KB Output is correct
27 Correct 10 ms 18948 KB Output is correct
28 Correct 8 ms 18920 KB Output is correct
29 Correct 9 ms 18780 KB Output is correct
30 Incorrect 6 ms 9052 KB Output isn't correct
31 Halted 0 ms 0 KB -