QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#179367#7109. Traveling on the Axischeerfulli#WA 19ms3712kbC++17387b2023-09-14 20:58:172023-09-14 20:58:17

Judging History

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

  • [2023-09-14 20:58:17]
  • 评测
  • 测评结果:WA
  • 用时:19ms
  • 内存:3712kb
  • [2023-09-14 20:58:17]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
int main()
{
	int T;
	cin>>T;
	while(T--)
	{
		string str;
		cin>>str;
		int n=str.size();
		str=" "+str;
		int x=0;
		LL res=0;
		for(int i=1;i<=n;i++)
		{
			int t=(str[i]=='0')+1;
			if(str[i]!=str[i-1])
				x=x+i-1+t;
			else x=x+2*(i-1)+t;
			res+=x;
		}
		cout<<res<<endl;
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3
101
011
11010

output:

12
15
43

result:

ok 3 lines

Test #2:

score: -100
Wrong Answer
time: 19ms
memory: 3712kb

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:

wrong answer 6101st lines differ - expected: '132147063634996', found: '16092752329780'