QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#697252	#6434. Paimon Sorting	fsy_juruo^#	WA	105ms	8612kb	C++17	1.1kb	2024-11-01 12:27:36	2024-11-01 12:27:37

Judging History

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

[2024-11-01 12:27:37]
评测

测评结果：WA
用时：105ms
内存：8612kb

查看

[2024-11-01 12:27:36]
提交

answer

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define LL long long
using namespace std;
using namespace __gnu_pbds;
typedef pair<long long,int> pii;
tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update> T;
const int maxN=1e5+100;
int t, n;
LL a[maxN];

int main() {
    scanf("%d",&t);
    while(t--) {
        T.clear();
        scanf("%d",&n);
        LL ans = 0;
        for(int i = 1; i <= n; i++) {
            scanf("%lld",a+i);
        }
        if(n==1){
            puts("0");
            continue;
        }
        else printf("0 ");
        T.insert(make_pair(a[1],1));
        for(int i=2;i<=n;i++){
            LL maxx=(--T.end())->first;
            if(a[i]>maxx){
                ans+=2;
                T.insert(make_pair(a[i],i));
            }
            else{
                LL rk=T.order_of_key(make_pair(a[i],n));
                ans+=T.size()-rk;
            }
            if(i!=n)printf("%lld ",ans);
            else printf("%lld",ans);
        }
        puts("");
    }
    return 0;
}

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3952kb

input:

output:

0 2 3 5 7
0 2 4
0

result:

ok 3 lines

Test #2:

score: -100

Wrong Answer

time: 105ms

memory: 8612kb

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 14 15 17 21 23 26 29 31 35 37 41 42
0 2 4 6 6 8 10 12 14 15 17 19
0 1 2 4 6 7 9 11 13 15 15 17 19 21 23 23
0 1 3 5 7 9 11 16 18 22
0 1 3 3 4 6 7 8 10 11 13 15 16 19 21 25 29 34
0
0 0
0 1 1
0 2 4 6 8 8 8 10 12 14 17 20 22 24 26 28 31
0 0 2
0 1 3 5 7 9 11
0 1 3 4 6 8 8
0 1 1 2 4 6 8 10 ...

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 14 15 17 21 23 26 29 31 35 37 41 42'