QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#233810 | #6434. Paimon Sorting | 8xin | WA | 95ms | 8140kb | C++14 | 2.4kb | 2023-10-31 23:48:36 | 2023-10-31 23:48:37 |
Judging History
answer
// #include <iostream>
// #include <cstdio>
// #include <algorithm>
// #include <cstring>
// #include <cmath>
// #include <vector>
// #include <queue>
// #include <map>
// #include <unordered_map>
// #include <bitset>
// #include <set>
// #include <stack>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll,ll>
#define inf 0x3f3f3f3f
#define endl "\n"
#define pi acos(-1)
#define eps 1e-9
const ll mod = 1e9 + 7;
ll qpow(ll base, ll power) {
ll res = 1;
while (power > 0) {
if (power & 1)
res = base * res % mod;
power >>= 1;
base = base * base % mod;
}
return res;
}
ll gcd(ll a, ll b) {
return b == 0 ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
double dis(double x, double y, double x1, double y1) {
return sqrt((x - x1) * (x - x1) + (y - y1) * (y - y1));
}
ll dis1(ll x, ll y, ll z, ll x1, ll y1, ll z1) {
return (x - x1) * (x - x1) + (y - y1) * (y - y1) + (z - z1) * (z - z1);
}
int chaji(int x1, int x2, int y1, int y2) {
return x1 * y2 - x2 * y1;
}
const int N = 1e6 + 10;
int n;
int a[N];
int tr[N];
int vis[N];
int lowbit(int x) {
return x & -x;
}
void add(int x, int d) {
for (int i = x; i <= n; i += lowbit(i)) {
tr[i] += d;
}
}
ll query(int x) {
int res = 0;
for (int i = x; i; i -= lowbit(i)) {
res += tr[i];
}
return res;
}
void solve() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
ll ans = 0;
vis[a[1]] = 1;
add(a[1], 1);
if(n==1) cout << 0 << endl;
else cout << 0 << " ";
for (int i = 2; i <= n; i++) {
if (!vis[a[i]]) {
add(a[i], 1);
}
vis[a[i]] ++;
if (a[1] < a[i]) {
ans ++;
ans += vis[a[1]] - 1;
swap(a[1], a[i]);
}
ans += query(n) - query(a[i]);
cout << ans;
if(i!=n) cout << " ";
else cout << endl;
}
for (int i = 1; i <= n; i++)
tr[i] = 0, vis[i] = 0;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
cin >> t;
// scanf("%d",&t);
while (t--) {
//cout << "Case #" << ++cnt << ": ";
solve();
}
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 7788kb
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: 95ms
memory: 8140kb
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 21 23 24 28 30 36 40 49 0 0 0 0 1 1 0 2 4 6 9 9 9 11 15 19 25 31 33 36 40 44 53 0 0 3 0 1 3 5 8 10 14 0 1 3 4 6 9 9 0 1 1 3 6 10 ...
result:
wrong answer 5th lines differ - expected: '0 1 3 3 4 8 10 12 16 18 27 29 30 34 36 42 46 55', found: '0 1 3 3 4 8 10 12 16 18 21 23 24 28 30 36 40 49'