QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#653029#6434. Paimon Sortinglllei#WA 163ms6588kbC++141.5kb2024-10-18 19:28:132024-10-18 19:28:18

Judging History

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

  • [2024-10-18 19:28:18]
  • 评测
  • 测评结果:WA
  • 用时:163ms
  • 内存:6588kb
  • [2024-10-18 19:28:13]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
struct TREE{
	int to[2],siz;
}tree[N*22];
int siz=1;
void push(int num)
{
	int now=1;
	tree[now].siz++;
	for(int i=20;i>=0;i--)
	{
		int to=0;
		if(num&(1<<i)) to=1;
		else to=0;
		if(!tree[now].to[to])
		{
			tree[now].to[to]=++siz;
			tree[siz]=tree[0];
		}
		now=tree[now].to[to];
		tree[now].siz++;
	}
	return;
}
int rnk(int num)
{
	int ct=0;
	int now=1;
	for(int i=20;i>=0;i--)
	{
		int to=0;
		if(num&(1<<i)) to=1;
		else to=0;
		if(to)
		{
			if(tree[now].to[0])
				ct+=tree[tree[now].to[0]].siz;
		}
		if(tree[now].to[to]){
			now=tree[now].to[to];
		}
		else return ct;
	}
	ct+=tree[now].siz;
	return ct;
}
int n,a[N],vis[N];
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int T;
	cin>>T;
	while(T--)
	{
		siz=1;
		tree[1]=tree[0];
		cin>>n;
		for(int i=1;i<=n;i++) vis[i]=0;
		for(int i=1;i<=n;i++) cin>>a[i];
		long long ans=0;
		if(n!=1)
		cout<<ans<<' ';
		else
		cout<<ans;
		int mx=0;
		int ct=0;
		int fst=0;
		for(int i=2;i<=n;i++)
		{
			if(a[1]<a[i])
			{
				ans++;
				swap(a[1],a[i]);
				fst=0;
			}
			if(a[1]==a[i]&&!fst) fst=i;
			mx=max(mx,a[i]);
			ans+=(i-2)-ct-rnk(a[i]);
			if(!vis[a[i]])
			{
			push(a[i]);
			vis[a[i]]=1;
			}
			else ct++;
			//if(mx<a[1]) ans++;
			long long anss=ans;
			if(fst)
				anss+=fst-1;
			else
				anss+=i-1;
			if(i!=n)
			cout<<anss<<' ';
			else cout<<anss;
		}
		cout<<'\n';
	}
	return 0;
}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3736kb

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: 163ms
memory: 6588kb

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 7 9 11 15 18 19 23 26
0 1 3 5 7 8 11 16 22 26 27 32 34 38 43 43
0 1 3 5 7 9 11 17 19 23
0 1 3 4 5 9 11 13 17 19 27 29 30 34 36 42 46 55
0
0 1
0 1 2
0 2 4 6 9 10 10 12 16 21 27 33 35 38 42 46 55
0 1 3
0 1 3 5 8 10 14
0 1 3 4 6 9 10
0 1 2 4 7 ...

result:

wrong answer 2nd lines differ - expected: '0 2 4 6 6 8 10 14 17 18 22 25', found: '0 2 4 6 7 9 11 15 18 19 23 26'