QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#169132#7109. Traveling on the Axischtholly3#AC ✓10ms4548kbC++20997b2023-09-09 13:02:292023-09-09 13:02:31

Judging History

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

  • [2023-09-09 13:02:31]
  • 评测
  • 测评结果:AC
  • 用时:10ms
  • 内存:4548kb
  • [2023-09-09 13:02:29]
  • 提交

answer

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PII pair<int,int>
#define cp complex<double>
const int maxn = 1e5+10, maxm = 3e3 + 100;
const ll inf = 0x3f3f3f3f3f3f3f3f, mod = 1919810;
int a[maxn], suf[maxn];
string s;
void init(int n) {
	n++;
	for (int i = 0; i <= n; i++) a[i] = suf[i] = 0;
}
void solve() {
	cin >> s;
	int n = s.length();
	init(n);
	a[1] = 1;
	for (int i = 2; i <= n; i++) a[i] = (s[i - 1] == s[i - 2]) ? 2 : 1;
	ll ans = 0, now = 0, pre = 0;
	//for (int i = n; i >= 1; i--) suf[i] = suf[i + 1] + a[i];
	//for (int i = 1; i <= n; i++) printf("%d ", a[i]);
	//printf("\n");
	for (int i = 1; i <= n; i++) {
		now = pre + 1ll * a[i] * (i - 1) + ((s[i - 1] == '0') ? 2 : 1);
		pre = now;
		//printf("%d: %lld\n", i, now);
		ans += now;
	}

	cout << ans << endl;
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int t; cin >> t;
	while (t--) solve();
	return 0;
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3
101
011
11010

output:

12
15
43

result:

ok 3 lines

Test #2:

score: 0
Accepted
time: 10ms
memory: 4548kb

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