QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#165032#7109. Traveling on the Axiszhoujiu#AC ✓7ms4552kbC++20758b2023-09-05 15:35:292023-09-05 15:35:29

Judging History

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

  • [2023-09-05 15:35:29]
  • 评测
  • 测评结果:AC
  • 用时:7ms
  • 内存:4552kb
  • [2023-09-05 15:35:29]
  • 提交

answer

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

const int N=1e5+10;

int T;

void solve()
{
	string a;
	cin >> a;
	a = ' ' + a;
	int n = a.size() - 1;
	
	vector <int> f(n + 3);

	char flag = a[n];
	for(int i = n - 1, cnt = 1; i >= 0; i--)
	{
		f[i] = f[i + 1];

		if(a[i] == flag && i)
			f[i] += cnt;

		cnt++;
		flag = a[i]; 
	}

	// for(int i = 0; i <= n; i++)
	// 	cerr << f[i] << ' ';
	// cerr << '\n';

	int ans = 0;
	for(int i = 0; i <= n - 1; i++)
	{	
		ans += (n - i) * (n - i + 1) / 2 + f[i+1];
		
		if(a[i + 1] == '0')
			ans += n - i;
	}

	cout << ans << '\n';
}

signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin>>T;

	while(T--)
		solve();

	return 0;
}

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

詳細信息

Test #1:

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

input:

3
101
011
11010

output:

12
15
43

result:

ok 3 lines

Test #2:

score: 0
Accepted
time: 7ms
memory: 4552kb

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

Extra Test:

score: 0
Extra Test Passed