QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#153156#7109. Traveling on the AxisPhantomThreshold#AC ✓18ms8016kbC++20645b2023-08-29 14:57:332023-08-29 14:57:34

Judging History

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

  • [2023-08-29 14:57:34]
  • 评测
  • 测评结果:AC
  • 用时:18ms
  • 内存:8016kb
  • [2023-08-29 14:57:33]
  • 提交

answer

#include <bits/stdc++.h>
#define ll long long
#define int long long
using namespace std;

const int maxn = 210000;

string str;
int n;
int a[maxn];
int f[maxn][2];

signed main()
{
	ios_base::sync_with_stdio(false);
	
	int Tcase; cin>>Tcase;
	while(Tcase--) {
		
		cin>>str; n=str.size(); str=' '+str;
		for(int i=1;i<=n;i++)
			a[i]=str[i]-'0';
		
		int ans=0;
		f[n+1][0]=f[n+1][1]=0;
		for(int i=n;i>=1;i--)
		{
			for(int j=0;j<2;j++)
			{
				int cc=a[i]^j;
				if(cc) f[i][j]=(n-i+1)+f[i+1][j^1];
				else f[i][j]=(n-i+1)*2+f[i+1][j];
			}
			ans+= f[i][0];
		}
		cout<<ans<<'\n';
	}
	
	return 0;
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3500kb

input:

3
101
011
11010

output:

12
15
43

result:

ok 3 lines

Test #2:

score: 0
Accepted
time: 18ms
memory: 8016kb

input:

6107
1010101
010110100110101
1010
1010101010010101010
101011
0101101011010101010
0101101011
11011010101
010
1011010
10110101010101010100
010101010110101
10101010101011
0101010101010101011
00101010011000
1010101010010110110
01010101001010101010
101010101010101
100100101010101010
01
011
0101010100101
...

output:

96
889
24
1515
69
1567
279
345
14
106
1702
791
621
1447
764
1615
1755
736
1333
6
15
542
44
1689
1515
140
833
497
596
24
1640
694
462
30
425
14
1041
1446
96
504
124
75
560
970
771
945
6
1
321
137
786
720
206
769
46
103
225
74
554
2
100
529
260
207
197
2
197
1041
140
857
207
1
74
1604
41
343
1041
14
1...

result:

ok 6107 lines