QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#718469#6434. Paimon SortingChihiroWA 81ms4992kbC++171.5kb2024-11-06 20:36:162024-11-06 20:36:17

Judging History

你现在查看的是最新测评结果

  • [2024-11-06 20:36:17]
  • 评测
  • 测评结果:WA
  • 用时:81ms
  • 内存:4992kb
  • [2024-11-06 20:36:16]
  • 提交

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;
int 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];
    if (n == 1){
        cout << "0\n";
        return;
    }
    vector<int> ans(n + 1);
    ans[1] = 0;
    add(a[1], 1), st[a[1]] = 1;
    if (!st[a[2]]) add(a[2], 1);
    int cnt = 0;
    for (int i = 1; i <= 2; i++){
        for (int j = 1; j <= 2; j++){
            if (a[i] < a[j]){
                swap(a[i], a[j]);
                cnt++;
            }
        }
    }
    ans[2] = cnt;
    for (int i = 3; i <= n; i++){
        int t = sum(n) - sum(a[i]);
        if (t == 0) ans[i] = ans[i - 1] + 2;
        else ans[i] = ans[i - 1] + t;
        if (!st[a[i]]) add(a[i], 1);
        st[a[i]] = 1;
    }
    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: 0ms
memory: 3616kb

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: 81ms
memory: 4992kb

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 37 43 45 54 58 71 72
0 2 4 10 12 18 23 30 36 39 45 50
0 1 12 9 11 9 13 24 36 41 38 48 50 55 64 61
0 1 6 10 13 15 19 30 34 40
0 1 4 7 11 27 32 37 48 53 54 52 53 58 59 67 71 87
0
0 0
0 1 3
0 2 14 19 27 24 21 26 37 39 51 63 61 63 66 69 83
0 0 2
0 1 3 7 11 15 24
0 1 2 7 9 1...

result:

wrong answer 1st lines differ - expected: '0 2 4 6 7 9 11 16 17 19 28 31 36 41 43 51 55 67 68', found: '0 2 4 6 7 9 11 16 17 19 28 31 37 43 45 54 58 71 72'