QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#156490#7109. Traveling on the Axisucup-team870#AC ✓6ms3896kbC++14742b2023-09-02 13:38:302023-09-02 14:51:28

Judging History

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

  • [2023-09-02 14:51:28]
  • 评测
  • 测评结果:AC
  • 用时:6ms
  • 内存:3896kb
  • [2023-09-02 13:38:30]
  • 提交

answer

#include <bits/stdc++.h>
#define rep(i,l,r) for(int i=l; i<=r; i++)
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
using namespace std;

typedef long long ll;
typedef pair<int,int> P;

const int N = 100010;
char s[N];

int main() {
    int T; scanf("%d", &T);
    while (T--) {
        scanf("%s", s+1);
        int n = strlen(s+1);
        ll ans = 0;
        rep (i, 1, n) {
            ans += 1ll * (1 + i) * i /2;
        }
        rep (i, 1, n) {
            if (s[i] == '0') {
                ans += n-i+1;
            }
            if (i > 1 && s[i] == s[i-1]) {
                ans += 1ll * (i-1) * (n-i+1);
            }
        }
        cout << ans<<'\n';
    }
    

    return 0;
}

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

详细

Test #1:

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

input:

3
101
011
11010

output:

12
15
43

result:

ok 3 lines

Test #2:

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

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