QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#524144#8129. Binary Sequencesolar_express#AC ✓56ms12184kbC++14879b2024-08-19 11:07:272024-08-19 11:07:27

Judging History

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

  • [2024-08-19 11:07:27]
  • 评测
  • 测评结果:AC
  • 用时:56ms
  • 内存:12184kb
  • [2024-08-19 11:07:27]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
int N=36;
string ans[40];
string count(char x,int len){
	string RE;
	RE+=" ";
	RE[RE.size()-1]=x;
	while(len){
		RE+=" ";
		RE[RE.size()-1]=len%2+'0';
		len/=2;
	}
	return RE;
}
int main(){
	string s="1";
	ans[1]=s;
	for(int i=1;i<=N;i++){
		s+=" ";
		string ss;int zz=0;
		for(int j=0;j+1<s.size();j++){
			if(s[j]!=s[j+1]){
				ss+=count(s[j],j-zz+1);
				zz=j+1;
			}
		}
		s=ss;
		ans[i+1]=ss;
	}
	int T;
	long long n,m;
	cin>>T;
	while(T--){
		scanf("%lld%lld",&n,&m);
		if(n<=36){
			if(ans[n].size()<=m)puts("0");
			else{
				putchar(ans[n][m]);
				putchar('\n');
			}
		}
		else{
			char xx1=ans[36][m],xx2=ans[37][m];
			if(xx1==xx2){
				putchar(xx1);
				putchar('\n');
			}
			else{
				if(n&1)putchar(xx2);
				else putchar(xx1);
				putchar('\n');
			}
		}
	}
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 39ms
memory: 11968kb

input:

10
4 0
4 1
4 2
4 3
4 4
4 5
4 6
6 3
6 7
118999881999119725 3

output:

1
1
0
1
1
1
0
1
1
0

result:

ok 10 numbers

Test #2:

score: 0
Accepted
time: 43ms
memory: 12052kb

input:

10
28 69772
10 7908
4 3198
4 85913
14 52729
3 20445
9 88912
17 23743
25 37356
2 97697

output:

0
0
0
0
0
0
0
0
0
0

result:

ok 10 numbers

Test #3:

score: 0
Accepted
time: 43ms
memory: 12180kb

input:

100
29 110358
18 13645
18 590344
36 550462
11 133055
8 769352
11 265432
7 158530
12 29189
2 830361
11 584395
31 693707
7 879812
19 25069
21 616926
3 85158
31 675739
17 118385
24 315535
29 59615
10 33445
17 609235
8 738138
20 209540
4 287616
32 522302
26 959741
5 453537
27 74313
28 296289
28 857972
2...

output:

0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
1
0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
1
1
0
0
0
0
1
0
0
0
0
0
1
0
1
0
1
0
1
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
1
0
0

result:

ok 100 numbers

Test #4:

score: 0
Accepted
time: 56ms
memory: 12184kb

input:

100000
702433635413308636 962533
864089450531108488 538792
262747333715821506 454514
859830947243984718 105219
365621373252206174 447331
890829905503831899 507146
116987306031929573 154370
157986473366693144 364746
502917586764426513 49981
874588963478161584 594867
467219058104100510 790503
11034861...

output:

1
1
1
1
1
1
1
0
1
0
1
0
1
1
1
1
0
1
1
1
1
1
0
1
0
0
0
0
1
1
1
0
0
1
1
0
0
1
0
1
1
1
1
0
0
0
0
1
1
0
0
1
0
0
1
0
1
1
1
1
1
1
1
0
1
1
1
0
0
0
1
1
1
0
1
1
1
1
1
1
0
1
0
1
1
1
0
0
0
1
0
0
1
0
1
1
1
1
1
1
0
0
0
0
0
0
0
1
0
0
1
0
1
0
1
0
1
1
0
1
1
0
1
0
0
0
1
1
0
1
1
0
0
1
1
1
1
1
0
0
0
0
0
0
1
1
1
0
0
1
...

result:

ok 100000 numbers

Extra Test:

score: 0
Extra Test Passed