Task: | Kyselyt |
Sender: | jnalanko |
Submission time: | 2020-10-17 00:59:50 +0300 |
Language: | C++ (C++17) |
Status: | READY |
Result: | 12 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 12 |
#2 | TIME LIMIT EXCEEDED | 0 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#2 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#3 | TIME LIMIT EXCEEDED | -- | 3 | details |
#4 | TIME LIMIT EXCEEDED | -- | 3 | details |
#5 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <iostream> #include <vector> #include <utility> #include <algorithm> //#include "stdlib_printing.hh" using namespace std; typedef long long LL; void solve(vector<LL>& v, vector<LL>& S, vector<LL>& C, LL l, LL r){ LL k = max_element(v.begin() + l, v.begin()+r+1) - v.begin(); cout << S[l] - S[k] + v[k] * (r-k+1) - (C[r+1] - C[l]) << "\n"; } int main(int argc, char** argv){ LL n,q; cin >> n >> q; vector<LL> v(n); for(LL i = 0; i < n; i++) cin >> v[i]; vector<LL> C(n+1); // C[i] = sum A[0..) for(LL i = 0; i < n; i++) C[i+1] = C[i] + v[i]; vector<LL> S(n); vector<pair<LL, LL> > suf; // Value, run length LL sum = 0; for(LL i = n-1; i >= 0; i--){ LL deleted = 0; while(suf.size() > 0 && v[i] > suf.back().first){ sum -= suf.back().first * suf.back().second; deleted += suf.back().second; suf.pop_back(); } suf.push_back({v[i], deleted+1}); sum += (deleted+1)*v[i]; S[i] = sum; } while(q--){ LL l,r; cin >> l >> r; l--; r--; solve(v,S,C,l,r); } }
Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
100 100 70 8 72 88 42 78 85 41 23 36 6... |
correct output |
---|
99 0 922 2579 1892 ... |
user output |
---|
99 0 922 2579 1892 ... Truncated |
Test 2
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
200000 200000 98 99 29 92 29 81 100 52 89 80... |
correct output |
---|
1497732 2810356 9532632 6655773 5403513 ... |
user output |
---|
(empty) |
Test 3
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
200000 200000 818377786 934884634 816080381 ... |
correct output |
---|
86877225712611 94684086875470 92703793485296 38149694892093 61948503092286 ... |
user output |
---|
(empty) |
Test 4
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
200000 200000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
correct output |
---|
0 0 0 0 0 ... |
user output |
---|
(empty) |
Test 5
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
200000 200000 200000 199999 199998 199997 19... |
correct output |
---|
15920862903 3193483321 18874982071 4846348926 3970697055 ... |
user output |
---|
(empty) |