QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#856823#9075. Bits ReverseNana7#AC ✓19ms3584kbC++141.4kb2025-01-14 17:11:362025-01-14 17:11:44

Judging History

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

  • [2025-01-14 17:11:44]
  • 评测
  • 测评结果:AC
  • 用时:19ms
  • 内存:3584kb
  • [2025-01-14 17:11:36]
  • 提交

answer

#include<iostream>
#include<cstdio>
#include<cstring>
#define I inline
#define int long long
using namespace std;

const int N = 110;
int a[N],b[N],pw[N];


I void solve(int T) {
	int x,y,cx1=0,cy1=0,cx2=0,cy2=0;
	cin>>x>>y; 
	memset(a,0,sizeof(a));
	memset(b,0,sizeof(b));
	for(int i=0;i<=63;++i) {
		if(x&pw[i]) {
			a[i]=1;
			if(i%2) cx1++;
			else cx2++;
		}
		if(y&pw[i]) {
			b[i]=1;
			if(i%2) cy1++;
			else cy2++; 
		}
	}
	cout<<"Case "<<T<<": ";	
	
	
	if(cx1!=cy1||cx2!=cy2) {
		cout<<-1<<endl;
		return ;
	}
	int cst=0;
	for(int i=0;i<=63;i+=2) {
		if(a[i]==b[i]) continue;
		if(a[i]==0&&b[i]==1) {
			for(int j=i+2;j<=63;j+=2) {
				if(a[j]==1) {
					a[j]=0; a[i]=1;
					cst+=(j-i)/2;
					break;
				}
			}
		} else {
			for(int j=i+2;j<=63;j+=2) {
				if(b[j]==1) {
					b[j]=0; b[i]=1;
					cst+=(j-i)/2;
					break;
				}
			}
		}
	}
	for(int i=1;i<=63;i+=2) {
		if(a[i]==b[i]) continue;
		if(a[i]==0&&b[i]==1) {
			for(int j=i+2;j<=63;j+=2) {
				if(a[j]==1) {
					a[j]=0; a[i]=1;
					cst+=(j-i)/2;
					break;
				}
			}
		} else {
			for(int j=i+2;j<=63;j+=2) {
				if(b[j]==1) {
					b[j]=0; b[i]=1;
					cst+=(j-i)/2;
					break;
				}
			}
		}
	}
	cout<<cst<<endl;
}
/*
 3
 0 3
 3 6
 6 9

*/
signed main()
{
	{
		pw[0]=1;
		for(int i=1;i<=63;++i) pw[i]=pw[i-1]<<1;
	}
	int T; cin>>T;
	for(int i=1;i<=T;++i) solve(i);
}

这程序好像有点Bug,我给组数据试试?

详细

Test #1:

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

input:

3
0 3
3 6
6 9

output:

Case 1: -1
Case 2: 1
Case 3: 2

result:

ok 9 tokens

Test #2:

score: 0
Accepted
time: 19ms
memory: 3584kb

input:

10000
7710 15375
973222 834469
471452 56651
188265 356262
937670 799667
271275 139758
478003 921397
326270 989759
660733 773404
704847 823278
657246 469149
175141 657754
885471 995694
100976 10574
184105 671365
194858 212648
181670 412313
361081 15451
632193 21228
745707 981594
911635 884353
863600 ...

output:

Case 1: 4
Case 2: 13
Case 3: 12
Case 4: 16
Case 5: 9
Case 6: 11
Case 7: 18
Case 8: 8
Case 9: 17
Case 10: -1
Case 11: 18
Case 12: 14
Case 13: 12
Case 14: 11
Case 15: 12
Case 16: 8
Case 17: 12
Case 18: 10
Case 19: 19
Case 20: -1
Case 21: 11
Case 22: 14
Case 23: 9
Case 24: 6
Case 25: 6
Case 26: 7
Case ...

result:

ok 30000 tokens

Extra Test:

score: 0
Extra Test Passed