QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#209393#7109. Traveling on the AxisPetroTarnavskyi#AC ✓22ms9096kbC++17855b2023-10-10 14:51:042023-10-10 14:51:04

Judging History

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

  • [2023-10-10 14:51:04]
  • 评测
  • 测评结果:AC
  • 用时:22ms
  • 内存:9096kb
  • [2023-10-10 14:51:04]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first	
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

void solve()
{
	string s;
	cin >> s;
	int n = SZ(s);
	vector<vector<LL>> f(n + 1, vector<LL>(2));
	LL res = 0;
	RFOR(i, n, 0)
	{
		FOR(j, 0, 2)
			f[i][j] = (s[i] - '0') ^ j ? n - i + f[i + 1][j ^ 1] : 2 * (n - i) + f[i + 1][j];
		res += f[i][0];
	}
	cout << res << "\n";
}

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

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

详细

Test #1:

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

input:

3
101
011
11010

output:

12
15
43

result:

ok 3 lines

Test #2:

score: 0
Accepted
time: 22ms
memory: 9096kb

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