oj.uz

Submission #856068

# Submission time Handle Problem Language Result Execution time Memory
856068 2023-10-02T16:15:01 Z sofijavelkovska Fancy Fence (CEOI20_fancyfence) C++14
12 / 100
 1 ms 604 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)
{
    //if (h[x]==h[y])
      //  return x<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 348 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 1 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 600 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 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 #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 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Runtime error 1 ms 604 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 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 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 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Runtime error 1 ms 604 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -