QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#164290#7109. Traveling on the Axisucup-team1329WA 10ms3836kbC++111019b2023-09-04 21:18:282023-09-04 21:18:28

Judging History

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

  • [2023-09-04 21:18:28]
  • 评测
  • 测评结果:WA
  • 用时:10ms
  • 内存:3836kb
  • [2023-09-04 21:18:28]
  • 提交

answer

#include <bits/stdc++.h>

#define i64 long long
#define endl '\n'
#define PII std::pair<int, int>
#define init_0(x) memset(x, 0, sizeof(x))
#define init_inf(x) memset(x, 0x3f, sizeof(x))

inline i64 read() {
	bool sym = 0; i64 res = 0; char ch = getchar();
	while (!isdigit(ch)) sym |= (ch == '-'), ch = getchar();
	while (isdigit(ch)) res = (res << 3) + (res << 1) + (ch ^ 48), ch = getchar();
	return sym ? -res : res;
}

const int N = 2e5, mod = 998244353, inf = 0x3f3f3f3f;

void solve() {
	std::string s;
	std::cin >> s;
	int n = s.length(), odd = 0, even = 0;
	i64 ans = 0;
	for (int i = 0; i < n; i++) {
		even++;
		// printf("%d %d\n", odd, even);
		if (s[i] == '1') {
			ans += odd * (n - i); odd += even; even = 0;
		} else {
			ans += even * (n - i); even += odd; odd = 0;
		}
		// printf("%lld\n", ans);
	}
	for (int i = 1; i <= n; i++) {
		ans += 1ll * i * (n - i + 1);
	}
	printf("%lld\n", ans);
}

int main() {
	int T = read();
	while (T--) solve();
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3
101
011
11010

output:

12
15
43

result:

ok 3 lines

Test #2:

score: -100
Wrong Answer
time: 10ms
memory: 3836kb

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 6102nd lines differ - expected: '151538662672591', found: '151414108621007'