# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
801596 | gun_gan | Fancy Fence (CEOI20_fancyfence) | C++17 | 27 ms | 7876 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;
typedef long long ll;
const int MX = 1e5 + 5, mod = 1e9 + 7, inv = 500000004;
int N;
ll h[MX], w[MX];
ll L[MX], R[MX], sum[MX];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> N;
for(int i = 1; i <= N; i++) cin >> h[i];
for(int i = 1; i <= N; i++) cin >> w[i];
vector<pair<ll,ll>> v;
for(int i = 1; i <= N; i++) {
while(!v.empty() && v.back() > make_pair(h[i], (ll)i)) v.pop_back();
if(!v.empty()) L[i] = v.back().second;
v.push_back({h[i], i});
}
v.clear();
for(int i = N; i >= 1; i--) {
while(!v.empty() && v.back() > make_pair(h[i], (ll)i)) v.pop_back();
# | 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... |