# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
856065 | sofijavelkovska | Fancy Fence (CEOI20_fancyfence) | C++14 | 67 ms | 8004 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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)
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |