oj.uz

Submission #855562

# Submission time Handle Problem Language Result Execution time Memory
855562 2023-10-01T12:35:44 Z sofijavelkovska Fancy Fence (CEOI20_fancyfence) C++14
12 / 100
 1 ms 604 KB 
#include <bits/stdc++.h>
using namespace std;

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

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

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

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

    return rectangles;
}

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

    return rectangles;
}

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

    long long n, x, left, right, i;
    long long leftsum, rightsum, total=0;
    set<long long> processed;
    cin >> n;
    long long 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);
    /*cout << "sorted by height ";
    for (i=0; i<n; i++)
        cout << index[i] << " ";
    cout << '\n';*/
    prefixsum[0]=w[0];
    for (i=1; i<n; i++)
        prefixsum[i]=prefixsum[i-1]+w[i];
    /*cout << "prefixsum of widths ";
    for (i=0; i<n; i++)
        cout << prefixsum[i] << " ";
    cout << '\n';*/
    processed.insert(-1);
    processed.insert(n);
    /*cout << "processed " << '\n';
    for (auto item : processed)
        cout << item << " ";
    cout << '\n';*/
    for (i=0; i<n; i++)
    {
        x=index[i];
        //for (int j=0; j<n; j++)
          //  cout << index[j] << " ";
        //cout << '\n';
        //cout << "i x " << i << " " << x << '\n';
        auto it=processed.lower_bound(x);
        right=*it;
        it--;
        left=*it;
        //cout << "left right " << left << " " << right << '\n';
        rightsum=(prefixsum[right-1]-prefixsum[x])%MOD;
        leftsum=(prefixsum[x]-w[x]-(prefixsum[left+1]-w[left+1]))%MOD;
        //cout << "lsum rsum " << leftsum << " " << rightsum << '\n';
        //cout << "inner outer " << inner(x) << " " << outer(x, leftsum, rightsum) << '\n';
        total=(total+outer(x, leftsum, rightsum)+inner(x))%MOD;
        processed.insert(x);
    }
    //cout << "ANSWER ";
    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
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 1 ms 604 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Runtime error 1 ms 604 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #6
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 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 396 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Runtime error 1 ms 600 KB Execution killed with signal 11
9 Halted 0 ms 0 KB -

Subtask #7
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 0 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 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Runtime error 1 ms 604 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -