# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
298995 | square1001 | Fancy Fence (CEOI20_fancyfence) | C++14 | 47 ms | 4216 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 <set>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
const int mod = 1000000007;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int N;
cin >> N;
vector<int> H(N), W(N);
for(int i = 0; i < N; ++i) cin >> H[i];
for(int i = 0; i < N; ++i) cin >> W[i];
vector<int> WS(N);
for(int i = 0; i < N; ++i) {
WS[i + 1] = WS[i] + W[i];
if(WS[i + 1] >= mod) WS[i + 1] -= mod;
}
vector<int> perm(N);
for(int i = 0; i < N; ++i) {
perm[i] = i;
}
sort(perm.begin(), perm.end(), [&](int i, int j) { return H[i] > H[j]; });
set<pair<int, int> > s;
long long current = 0;
int ans = 0;
for(int i = 0; i < perm.size(); ++i) {
int id = perm[i];
current = (current + 1LL * W[id] * (W[id] + 1)) % mod;
Compilation message (stderr)
# | 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... |