QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#482593#7109. Traveling on the Axisharper886AC ✓2ms3872kbC++20710b2024-07-17 20:12:542024-07-17 20:12:55

Judging History

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

  • [2024-07-17 20:12:55]
  • 评测
  • 测评结果:AC
  • 用时:2ms
  • 内存:3872kb
  • [2024-07-17 20:12:54]
  • 提交

answer

#include <bits/stdc++.h>
#define int long long
#define yes cout<<"YES"<<'\n'
#define no 	cout<<"NO"<<'\n'

using namespace std;
typedef pair<int, int> PII;
const int N = 200008;
char s[N + 10];
const long long inf = 0x3f3f3f3f3f3f3f3f;
void solve() {
	int sm = 0;
	scanf("%s", s + 1);
	int ans = 0;
	for (int i = 1; s[i]; i++) {
		if (s[i] == s[i - 1]) {
			sm += 2 * (i - 1);
		} else {
			sm += i - 1;
		}
		if (s[i] == '1') {
			sm++;
		} else sm += 2;
		ans += sm;
	}
	cout << ans << '\n';

}

signed main () {
//	std::ios::sync_with_stdio(false), std::cin.tie(nullptr), std::cout.tie(nullptr);
	int t = 1;
	cin >> t;
	while (t) {
		solve();
		t--;
	}


	return 0;
}

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

详细

Test #1:

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

input:

3
101
011
11010

output:

12
15
43

result:

ok 3 lines

Test #2:

score: 0
Accepted
time: 2ms
memory: 3872kb

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