oj.uz

Submission #930638

# Submission time Handle Problem Language Result Execution time Memory
930638 2024-02-20T08:41:31 Z LucaIlie Fancy Fence (CEOI20_fancyfence) C++17
30 / 100
 61 ms 3792 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;
}

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 inv2 = lgPut( 2, MOD - 2 );
    int ans = 0, sum = 0;
    for ( int i = 0; i < n; i++ ) {
        while ( !s.empty() && h[i] <= h[s.back()] ) {
            sum = (sum - (long long)h[i] * (h[i] + 1) % MOD * inv2 % MOD * 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)h[i] * (h[i] + 1) % MOD * inv2 % MOD * p[i] % MOD) % MOD;

        ans = (ans + ((long long)h[i] * (h[i] + 1) % MOD * inv2 % MOD) * ((long long)w[i] * (w[i] + 1) % MOD * inv2 % MOD)) % MOD;

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

        sum = (sum + (long long)h[i] * (h[i] + 1) % MOD * inv2 % MOD * w[i] % MOD) % MOD;

       // sum = (sum + w[i]) % MOD;
    }

    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
0 / 12.0

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

Subtask #3
0 / 13.0

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

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 6 ms 572 KB Output is correct
3 Correct 30 ms 1876 KB Output is correct
4 Correct 59 ms 3412 KB Output is correct
5 Correct 61 ms 3408 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 600 KB Output is correct
4 Correct 31 ms 1884 KB Output is correct
5 Correct 59 ms 3384 KB Output is correct
6 Correct 61 ms 3628 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 6 ms 832 KB Output is correct
9 Correct 31 ms 2140 KB Output is correct
10 Correct 58 ms 3724 KB Output is correct
11 Correct 60 ms 3792 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 0 ms 348 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 -