QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#687875 | #6434. Paimon Sorting | Palbudir | WA | 395ms | 8276kb | C++20 | 2.2kb | 2024-10-29 21:40:50 | 2024-10-29 21:40:51 |
Judging History
answer
#include <bits/stdc++.h>
using i80 = __int128;
using i64 = long long;
using f80 = long double;
template <typename T>
struct Fenwick {
int n;
std::vector<T> a;
Fenwick(int n_ = 0) {
init(n_);
}
void init(int n_) {
n = n_;
a.assign(n, T{});
}
void add(int x, const T& v) {
for (int i = x + 1; i <= n; i += i & -i) {
a[i - 1] = a[i - 1] + v;
}
}
T sum(int x) {
T ans{};
for (int i = x; i > 0; i -= i & -i) {
ans = ans + a[i - 1];
}
return ans;
}
T rangeSum(int l, int r) {
return sum(r) - sum(l);
}
int select(const T& k) {
int x = 0;
T cur{};
for (int i = 1 << std::__lg(n); i; i /= 2) {
if (x + i <= n && cur + a[x + i - 1] <= k) {
x += i;
cur = cur + a[x - 1];
}
}
return x;
}
};
void work() {
int n;
std::cin >> n;
std::vector<std::vector<int>> set(n + 1);
Fenwick<int> tr(n + 2);
int max = 0, ans = 0;
for (int i = 0; i < n; ++i) {
int x;
std::cin >> x;
if (i == 0) {
std::cout << 0;
max = std::max(max, x);
set[x].push_back(i);
if (set[x].size() == 1) {
tr.add(x, 1);
}
continue;
}
int res;
if (max < x) {
int y = max;
if (set[y].size() == 1) {
res = 2;
} else {
res = i - set[y][1] + 2;
}
} else if (max == x) {
res = 0;
} else {
res = tr.rangeSum(x + 1, n + 1);
}
ans += res;
std::cout << " " << ans;
max = std::max(max, x);
set[x].push_back(i);
if (set[x].size() == 1) {
tr.add(x, 1);
}
}
std::cout << "\n";
return;
}
void init() {
}
int main() {
init();
std::ios::sync_with_stdio(false);
// std::cin.tie(nullptr), std::cout.tie(nullptr);
int t = 1;
std::cin >> t;
while (t--) {
work();
}
return 0;
}
/*
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3624kb
input:
3 5 2 3 2 1 5 3 1 2 3 1 1
output:
0 2 3 5 7 0 2 4 0
result:
ok 3 lines
Test #2:
score: -100
Wrong Answer
time: 395ms
memory: 8276kb
input:
6107 19 10 13 8 8 11 18 12 9 15 19 6 13 11 11 17 9 14 2 18 12 1 8 10 2 10 2 6 1 5 9 5 7 16 14 4 2 15 12 14 10 3 2 9 15 4 12 9 5 15 10 3 2 5 6 7 8 6 1 6 4 18 6 5 12 12 11 2 10 10 5 10 13 15 13 10 17 7 11 2 1 1 2 1 1 3 2 1 2 17 11 15 3 10 7 15 15 10 5 17 3 3 14 13 11 11 2 3 2 2 3 7 6 1 7 5 3 5 1 7 2 1...
output:
0 2 4 6 7 9 11 16 17 19 28 31 36 41 43 51 55 67 68 0 2 4 6 6 8 10 14 17 18 22 25 0 1 3 5 7 8 11 16 22 26 26 31 33 37 42 42 0 1 3 5 7 9 11 17 19 23 0 1 3 3 4 8 10 12 16 18 27 29 30 34 36 42 46 55 0 0 0 0 1 1 0 2 4 6 9 9 9 11 15 21 27 33 35 38 42 46 55 0 0 3 0 1 3 5 8 10 14 0 1 3 4 6 9 9 0 1 1 3 7 11 ...
result:
wrong answer 6104th lines differ - expected: '0 0 1 2 4 7 10 14 18 22 27 32 ...161222304 3161285479 3161348654', found: '0 0 1 2 4 7 10 14 18 22 27 32 ...3744992 -1133681817 -1133618642'