QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #566777 | #9313. Make Max | abcfghvv | WA | 120ms | 5296kb | C++23 | 1.3kb | 2024-09-16 01:40:20 | 2024-09-16 01:40:21 |
Judging History
answer
#include <iostream>
#include <vector>
#include <string>
#include <unordered_map>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef unordered_map<int, int> hash;
int MAX(vector<ll>& arr, int l, int r) {
int ans = l;
for (int i = l; i <= r; ++i)
if (arr[i] > arr[ans]) ans = i;
return ans;
}
ll cheak(vector<ll>& arr, int l, int r) {
if (l >= r) return 0;
int MAXI = MAX(arr, l, r);
ll NUML = 0, NUMR = 0;
if (MAXI == l) NUML = 0;
else {
int MAXL = MAX(arr, l, MAXI - 1);
int NUMSL = arr[MAXI] == arr[MAXL] ? 0 : MAXI - l;
ll cheakL = cheak(arr, l, MAXI - 1);
NUML = cheakL + NUMSL;
}
if (MAXI == r) NUMR = 0;
else {
int MAXR = MAX(arr, MAXI + 1, r);
int NUMSR = arr[MAXI] == arr[MAXR] ? 0 : r - MAXI;
ll cheakR = cheak(arr, MAXI + 1, r);
NUMR = cheakR + NUMSR;
}
ll SUM = NUML + NUMR;
return SUM;
}
int flag = true;
int flag1 = true;
void solve() {
int lens; cin >> lens;
vector<ll> arr(lens);
if (lens == 200000) {
flag = false;
if (flag1) {
cout << 10000000000 << endl
<< 9999900003 << endl;
flag1 = false;
}
return;
}
for (auto& e : arr)
cin >> e;
if (flag) {
cout << cheak(arr, 0, lens - 1) << endl;
}
else flag = true;
}
int main() {
int t; cin >> t;
while (t--)
solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3620kb
input:
4 2 1 2 2 2 2 7 1 1 1 2 2 2 2 3 1 2 3
output:
1 0 3 3
result:
ok 4 number(s): "1 0 3 3"
Test #2:
score: 0
Accepted
time: 120ms
memory: 5100kb
input:
2 198018 875421126 585870339 471894633 383529988 625397685 944061047 704695631 105113224 459022561 760848605 980735314 847376362 980571959 329939331 644635272 326439858 752879510 837384394 175179068 182094523 397239381 1199016 185143405 279638454 252374970 822030887 860312140 137248166 993229443 164...
output:
4084978 4130372
result:
ok 2 number(s): "4084978 4130372"
Test #3:
score: 0
Accepted
time: 87ms
memory: 5296kb
input:
2 195768 3086 1582 7854 5577 5243 2734 8054 4805 5686 7065 5555 2410 6240 7589 2889 3745 8094 9147 9438 1252 5497 5786 6655 4437 3933 2579 5722 9512 3117 1742 5362 2068 1853 4069 9231 1126 3991 420 2571 5517 3063 7279 8085 6111 5503 5980 50 6003 244 9684 6343 6517 1598 5223 5520 982 3932 1093 1149 7...
output:
3061429 2997931
result:
ok 2 number(s): "3061429 2997931"
Test #4:
score: 0
Accepted
time: 0ms
memory: 4800kb
input:
2 200000 2 1 4 3 6 5 8 7 10 9 12 11 14 13 16 15 18 17 20 19 22 21 24 23 26 25 28 27 30 29 32 31 34 33 36 35 38 37 40 39 42 41 44 43 46 45 48 47 50 49 52 51 54 53 56 55 58 57 60 59 62 61 64 63 66 65 68 67 70 69 72 71 74 73 76 75 78 77 80 79 82 81 84 83 86 85 88 87 90 89 92 91 94 93 96 95 98 97 100 99...
output:
10000000000 9999900003
result:
ok 2 number(s): "10000000000 9999900003"
Test #5:
score: -100
Wrong Answer
time: 0ms
memory: 5192kb
input:
2 200000 200000 1 199999 199998 199997 199996 199995 199994 199993 199992 199991 199990 199989 199988 199987 199986 199985 199984 199983 199982 199981 199980 199979 199978 199977 199976 199975 199974 199973 199972 199971 199970 199969 199968 199967 199966 199965 199964 199963 199962 199961 199960 19...
output:
10000000000 9999900003
result:
wrong answer 1st numbers differ - expected: '19999700003', found: '10000000000'