QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#160089#7109. Traveling on the Axisucup-team1447#AC ✓16ms3800kbC++14560b2023-09-02 19:25:492023-09-02 19:25:49

Judging History

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

  • [2023-09-02 19:25:49]
  • 评测
  • 测评结果:AC
  • 用时:16ms
  • 内存:3800kb
  • [2023-09-02 19:25:49]
  • 提交

answer

#include <bits/stdc++.h>
int T, n, t[2];
std::string s;
long long ans, tot;
signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin >> T;
    while (T--)
    {
        std::cin >> s;
        n = s.size();
        ans = 0;
        t[0] = t[1] = 0;
        for (int i = 0; i != n; ++i)
        {
            ++t[0];
            ans += 1ll * (t[s[i] ^ '0'] + t[0] + t[1]) * (n - i);
            t[s[i] ^ '0'] += t[s[i] ^ '1'];
            t[s[i] ^ '1'] = 0;
        }
        std::cout << ans << std::endl;
    }
    return 0;
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3
101
011
11010

output:

12
15
43

result:

ok 3 lines

Test #2:

score: 0
Accepted
time: 16ms
memory: 3800kb

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