oj.uz

Submission #930721

# Submission time Handle Problem Language Result Execution time Memory
930721 2024-02-20T10:17:50 Z LucaIlie Fancy Fence (CEOI20_fancyfence) C++17
55 / 100
 64 ms 3288 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 1e5;
const int MOD = 1e9 + 7;
int h[MAX_N], w[MAX_N], p[MAX_N];
vector <int> s;

int lgPut( int x, int n ) {
    if ( n == 0 )
        return 1;

    int p = lgPut( x, n / 2 );
    p = (long long)p * p % MOD;
    if ( n % 2 == 1 )
        p = (long long)p * x % MOD;

    return p;
}

const int inv2 = (MOD + 1) / 2;
int nchoose2( int n ) {
    return (long long)n * (n + 1) % MOD * inv2 % MOD;
}

int main() {
    int n;

    cin >> n;
    for ( int i = 0; i < n; i++ )
        cin >> h[i];
    for ( int i = 0; i < n; i++ )
        cin >> w[i];


    int ans = 0, sum = 0;
    for ( int i = 0; i < n; i++ ) {
        while ( !s.empty() && h[i] < h[s.back()] ) {
            sum = (sum - (long long)nchoose2( h[s.back()] ) * p[s.back()] % MOD + MOD) % MOD;
            p[i] = (p[i] + p[s.back()]) % MOD;
            s.pop_back();
        }
        s.push_back( i );

        sum = (sum + (long long)nchoose2( h[i] ) * p[i]) % MOD;
        ans = (ans + (long long)nchoose2( h[i] ) * nchoose2( w[i] )) % MOD;
        ans = (ans + (long long)sum * w[i]) % MOD;
        sum = (sum + (long long)nchoose2( h[i] ) * w[i]) % MOD;

        p[i] += w[i];
    }

    cout << ans << "\n";

    return 0;
}

Subtask #1
0.0 / 0.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 0 ms 348 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 21 ms 1656 KB Output is correct
4 Correct 40 ms 3288 KB Output is correct
5 Correct 40 ms 3028 KB Output is correct
6 Correct 40 ms 2852 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 6 ms 860 KB Output is correct
3 Correct 29 ms 1948 KB Output is correct
4 Correct 56 ms 3280 KB Output is correct
5 Correct 59 ms 3232 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #5
15.0 / 15.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 6 ms 820 KB Output is correct
4 Correct 30 ms 2044 KB Output is correct
5 Correct 56 ms 3280 KB Output is correct
6 Correct 61 ms 3264 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 6 ms 860 KB Output is correct
9 Correct 33 ms 2084 KB Output is correct
10 Correct 55 ms 3280 KB Output is correct
11 Correct 64 ms 3280 KB Output is correct
12 Correct 0 ms 348 KB Output is correct

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 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 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -