QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#159981#7109. Traveling on the Axisucup-team1732#AC ✓6ms1748kbC++14817b2023-09-02 19:11:542023-09-02 19:11:55

Judging History

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

  • [2023-09-02 19:11:55]
  • 评测
  • 测评结果:AC
  • 用时:6ms
  • 内存:1748kb
  • [2023-09-02 19:11:54]
  • 提交

answer

// created:  Sep/02/2023 19:09:29
#include<cstdio>
#define F(i,l,r) for(int i=l,i##_end=r;i<i##_end;++i)
using namespace std;
template<typename T>void readmain(T &x)
{
	bool neg=false;
	unsigned int c=getchar();
	for(;(c^48)>9;c=getchar())if(c=='-')neg=true;
	for(x=0;(c^48)<10;c=getchar())x=(x<<3)+(x<<1)+(c^48);
	if(neg)x=-x;
}
template<typename T>T& read(T &x){readmain(x);return x;}
template<typename T,typename ...Tr>void read(T &x,Tr&... r){readmain(x);read(r...);}
constexpr int N=1e5+5;
int tt,n;
long long ans;
char s[N];
int main()
{
	read(tt);
	while(tt--)
	{
		n=0;
		scanf("%s",s);
		while(s[n])++n;
		ans=0;
		F(i,0,n)
		{
			ans+=(i+1ll)*(n-i);
			if(s[i]=='0')ans+=n-i;
		}
		F(i,0,n-1)if(s[i]==s[i+1])ans+=(i+1ll)*(n-i-1);
		printf("%lld\n",ans);
	}
	return 0;
}

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

詳細信息

Test #1:

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

input:

3
101
011
11010

output:

12
15
43

result:

ok 3 lines

Test #2:

score: 0
Accepted
time: 6ms
memory: 1640kb

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