QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#718793 | #6434. Paimon Sorting | Chihiro | WA | 103ms | 6292kb | C++17 | 1.4kb | 2024-11-06 21:27:33 | 2024-11-06 21:27:33 |
Judging History
answer
#include <bits/stdc++.h>
#define fixed(s) fixed<<setprecision(12)<<s
using namespace std;
typedef long long ll;
typedef array<int, 3> Arr;
typedef pair<int, int> PII;
const int N = 2e5 + 7;
int n;
ll tr[N], st[N];
int lowbit(int x){
return x & -x;
}
void add(int x, int c){
for (int i = x; i <= n; i += lowbit(i)) tr[i] += c;
}
int sum(int x){
int res = 0;
for (int i = x; i; i -= lowbit(i)) res += tr[i];
return res;
}
void solve(){
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++){
cin >> a[i];
tr[i] = 0;
st[i] = 0;
}
if (n == 1){
cout << "0\n";
return;
}
vector<int> ans(n + 1);
ans[1] = 0;
add(a[1], 1), st[a[1]] = 1;
int pos = 2, mx = a[1];
for (int i = 2; i <= n; i++){
int t = sum(n) - sum(a[i]);
if (a[i] > mx) ans[i] = ans[i - 1] + 2 + i - pos, pos = i + 1;
else ans[i] = ans[i - 1] + t;
if (a[i] != mx && pos == i) pos++;
if (!st[a[i]]) add(a[i], 1);
st[a[i]] = 1;
mx = max(mx, a[i]);
}
for (int i = 1; i <= n; i++){
cout << ans[i];
if (i != n) cout << ' ';
}
cout << '\n';
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int T = 1;
cin >> T;
while(T--){
solve();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 5864kb
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: 103ms
memory: 6292kb
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'