QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#162482#7109. Traveling on the AxisGenshinImpactsFault#AC ✓7ms3572kbC++171018b2023-09-03 13:20:182023-09-03 13:20:18

Judging History

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

  • [2023-09-03 13:20:18]
  • 评测
  • 测评结果:AC
  • 用时:7ms
  • 内存:3572kb
  • [2023-09-03 13:20:18]
  • 提交

answer

#include<bits/stdc++.h>
#define inf 1e9
#define eps 1e-6
#define FOR(i, a, b) for(int i = a; i <= b; i ++)
#define REP(i, a, b) for(int i = a; i >= b; i --)
#define pb push_back
#define fr first
#define sd second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
inline ll read()
{
	char ch = getchar();
	ll s = 0, w = 1;
	while(ch < '0' || ch > '9'){if(ch == '-')w = -1; ch = getchar();}
	while(ch >= '0' && ch <= '9'){s = s * 10 + ch - '0'; ch = getchar();}
	return s * w;
}
#define N 1000010
char s[N];
int n;
void sol()
{
	scanf("%s", s + 1); n = strlen(s + 1);
	ll ans = 0;
	FOR(i, 1, n)ans += 1LL * i * (n - i + 1);
//	cout << "GG:" << ans << endl;
	FOR(i, 1, n)
	{
		if(s[i] == '0')
		{
			if(i == 1 || s[i - 1] != s[i])ans += (n - i + 1);
			else ans += 1LL * i * (n - i + 1);
		}
		else if(i > 1 && s[i - 1] == s[i])ans += 1LL * (i - 1) * (n - i + 1);
	}
	cout << ans << '\n';
}
int main()
{
	int T = read();
	while(T --)sol();
	return 0;
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3
101
011
11010

output:

12
15
43

result:

ok 3 lines

Test #2:

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

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