oj.uz

Submission #856102

# Submission time Handle Problem Language Result Execution time Memory
856102 2023-10-02T16:41:12 Z sofijavelkovska Fancy Fence (CEOI20_fancyfence) C++14
100 / 100
 65 ms 7864 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAXN=1e5, MOD=1e9+7;

long long h[MAXN], w[MAXN];

bool compare(int x, int y)
{
    return h[x]<h[y];
}

long long outer(int i, long long leftsum, long long rightsum)
{
    long long rectangles=0;
    rectangles=(rectangles+h[i]*w[i]%MOD*leftsum%MOD)%MOD;
    rectangles=(rectangles+h[i]*(h[i]-1)/2%MOD*w[i]%MOD*leftsum%MOD)%MOD;
    rectangles=(rectangles+h[i]*w[i]%MOD*rightsum%MOD)%MOD;
    rectangles=(rectangles+h[i]*(h[i]-1)/2%MOD*w[i]%MOD*rightsum%MOD)%MOD;
    rectangles=(rectangles+h[i]*leftsum%MOD*rightsum%MOD)%MOD;
    rectangles=(rectangles+h[i]*(h[i]-1)/2%MOD*leftsum%MOD*rightsum%MOD)%MOD;

    return rectangles;
}

long long inner(int i)
{
    long long rectangles=0;
    rectangles=(rectangles+h[i]*w[i]%MOD)%MOD;
    rectangles=(rectangles+w[i]*(w[i]-1)/2%MOD*h[i]%MOD)%MOD;
    rectangles=(rectangles+h[i]*(h[i]-1)/2%MOD*w[i]%MOD)%MOD;
    rectangles=(rectangles+h[i]*(h[i]-1)/2%MOD*(w[i]*(w[i]-1)/2%MOD)%MOD)%MOD;

    return rectangles;
}

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

    int n, x, left, right, i;
    long long leftsum, rightsum, total=0;
    set<int> processed;
    cin >> n;
    int index[n];
    long long prefixsum[n];
    for (i=0; i<n; i++)
        cin >> h[i];
    for (i=0; i<n; i++)
        cin >> w[i];
    for (i=0; i<n; i++)
        index[i]=i;
    sort(index, index+n, compare);
    prefixsum[0]=w[0];
    for (i=1; i<n; i++)
        prefixsum[i]=prefixsum[i-1]+w[i];
    processed.insert(-1);
    processed.insert(n);
    for (i=0; i<n; i++)
    {
        x=index[i];
        auto it=processed.lower_bound(x);
        right=*it;
        it--;
        left=*it;
        rightsum=(prefixsum[right-1]-prefixsum[x])%MOD;
        leftsum=(prefixsum[x]-w[x]-(prefixsum[left+1]-w[left+1]))%MOD;
        total=(total+outer(x, leftsum, rightsum)+inner(x))%MOD;
        processed.insert(x);
    }
    cout << total;

    return 0;
}

Subtask #1
0.0 / 0.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

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 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 18 ms 4184 KB Output is correct
4 Correct 36 ms 7764 KB Output is correct
5 Correct 36 ms 7764 KB Output is correct
6 Correct 39 ms 7840 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 4 ms 1116 KB Output is correct
3 Correct 18 ms 4188 KB Output is correct
4 Correct 38 ms 7764 KB Output is correct
5 Correct 41 ms 7792 KB Output is correct
6 Correct 0 ms 344 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 4 ms 1116 KB Output is correct
4 Correct 19 ms 4084 KB Output is correct
5 Correct 38 ms 7856 KB Output is correct
6 Correct 40 ms 7816 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 4 ms 1116 KB Output is correct
9 Correct 20 ms 3932 KB Output is correct
10 Correct 42 ms 7764 KB Output is correct
11 Correct 46 ms 7764 KB Output is correct
12 Correct 0 ms 348 KB Output is correct

Subtask #6
18.0 / 18.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 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 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 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 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
27.0 / 27.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 1 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 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 464 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 19 ms 3960 KB Output is correct
12 Correct 38 ms 7764 KB Output is correct
13 Correct 38 ms 7760 KB Output is correct
14 Correct 37 ms 7864 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 4 ms 1116 KB Output is correct
17 Correct 19 ms 4184 KB Output is correct
18 Correct 42 ms 7764 KB Output is correct
19 Correct 44 ms 7692 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 5 ms 1208 KB Output is correct
22 Correct 20 ms 4188 KB Output is correct
23 Correct 42 ms 7816 KB Output is correct
24 Correct 46 ms 7820 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 5 ms 1112 KB Output is correct
31 Correct 5 ms 1112 KB Output is correct
32 Correct 25 ms 4188 KB Output is correct
33 Correct 32 ms 4020 KB Output is correct
34 Correct 59 ms 7676 KB Output is correct
35 Correct 56 ms 7696 KB Output is correct
36 Correct 59 ms 7760 KB Output is correct
37 Correct 58 ms 7764 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 65 ms 7720 KB Output is correct
40 Correct 54 ms 7764 KB Output is correct
41 Correct 46 ms 7760 KB Output is correct
42 Correct 45 ms 7764 KB Output is correct