QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#788473	#6434. Paimon Sorting	nayzteam	WA	92ms	4684kb	C++20	1.3kb	2024-11-27 17:05:37	2024-11-27 17:05:38

Judging History

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

[2024-11-27 17:05:38]
评测

测评结果：WA
用时：92ms
内存：4684kb

查看

[2024-11-27 17:05:37]
提交

answer

#include<bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pii pair<int,int>
#define pli pair<ll,int>
#define fi first
#define se second
#define mk make_pair
using namespace std;
ll read(){
    ll X = 0 ,r = 1;
    char ch = getchar();
    while(!isdigit(ch) && ch != '-') ch = getchar();
    if(ch == '-') r = -1,ch = getchar();
    while(isdigit(ch)) X = X*10+ch-'0',ch = getchar();
    return X*r;
}
const int N = 1e5+10;
int n,a[N];
int t[N],flag[N];
void init(){
	for(int i=1;i<=n;i++) t[i] = flag[i] = 0;
} 
void add(int x,int y){
	flag[x]++;
	if(flag[x] == 1)
		while(x <= n){
			t[x] += y;
			x += x&(-x);
		}
}
int ask(int x){
	int res = 0;
	while(x){
		res += t[x];
		x -= x&(-x);
	}
	return res;
}
void solve(){
	n = read();
	for(int i=1;i<=n;i++) a[i] = read();
	if(n == 1) return puts("0"),void();
	init();
	cout << "0 ";
	ll sum = 0,mx = a[1],now = 1,s = 0;
	for(int i=2;i<=n;i++){
		if(a[i] > mx){
			add(mx,1);
			mx = a[i]; now++;
			s = i-1;
		}else if(a[i] < mx){
			add(a[i],1);
			sum += ask(n)-ask(a[i]);
		}
		s += a[i] < mx;
		if(i != n) cout << sum+s+now-1 << " ";
		else cout << sum+s+now-1 << "\n";
	}
}
int main(){
	int T = read();
	while(T--) solve();
    return 0;
}
/*

1
6
1 3 4 2 4 2
*/

源文件, 语言: C++20

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3592kb

input:

output:

0 2 3 5 7
0 2 4
0

result:

ok 3 lines

Test #2:

score: -100

Wrong Answer

time: 92ms

memory: 4684kb

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'