QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#178882#7109. Traveling on the Axisnotyour_young#AC ✓180ms10240kbC++17755b2023-09-14 14:53:192023-09-14 14:53:20

Judging History

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

  • [2023-09-14 14:53:20]
  • 评测
  • 测评结果:AC
  • 用时:180ms
  • 内存:10240kb
  • [2023-09-14 14:53:19]
  • 提交

answer

#include<bits/stdc++.h>
#define endl '\n'
#define int long long
using namespace std;
const int N = 1e5+10;

struct inst {
	string ty;
	int v, k;
};

void solve()
{
	string s;
	cin>>s;
	int n = s.size();
	int od  = 0;
	int ev = 0;
	map<pair<int,int>,int> mp;
	for(int i=0;i<s.size();i++){
		mp[{i,i+1}] = s[i] - '0';
	}
	int ans = 0;
	int res = 0;
	for(int i=1;i<=n;i++){
		ev++;
		// cout<<od<<" "<<ev<<" k"<<endl;
		if(mp[{i-1,i}] == 1){
			res+=ev;
			res+=od*2;
			od+=ev;
			ev = 0;
		}
		else{
			res+=od;
			res+=ev*2;
			ev+=od;
			od = 0;
		}
		ans+=res;
	}
	cout<<ans<<endl;
}
signed main()
{
	ios::sync_with_stdio(false), cin.tie(0);
	int tc;
	cin >> tc;
	while(tc --)
		solve();
	return 0;
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3
101
011
11010

output:

12
15
43

result:

ok 3 lines

Test #2:

score: 0
Accepted
time: 180ms
memory: 10240kb

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