QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#163417#7109. Traveling on the AxisNicolas125841AC ✓5ms7572kbC++171.3kb2023-09-04 03:44:212023-09-04 03:44:22

Judging History

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

  • [2023-09-04 03:44:22]
  • 评测
  • 测评结果:AC
  • 用时:5ms
  • 内存:7572kb
  • [2023-09-04 03:44:21]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int main(){
    cin.tie(NULL)->sync_with_stdio(false);

    int t;
    cin >> t;

    while(t--){
        string s;
        cin >> s;

        vector<int> line;
        
        for(const char &c : s)
            line.push_back(c - '0');

        vector<array<ll, 2>> dp(line.size(), {0, 0}), sub(line.size(), {0, 0});

        for(int i = 0; i < line.size(); i++){
            dp[i][line[i]] = line.size() - i;
            sub[i][line[i]] = 1;

            if(i){
                if(line[i] == line[i-1]){
                    dp[i][0] += dp[i-1][1] - sub[i-1][1];
                    sub[i][0] += sub[i-1][1];

                    dp[i][0] += dp[i-1][0] - sub[i-1][0];
                    sub[i][0] += sub[i-1][0];
                }else{
                    dp[i][1] += dp[i-1][1] - sub[i-1][1];
                    sub[i][1] += sub[i-1][1];

                    dp[i][1] += dp[i-1][0] - sub[i-1][0];
                    sub[i][1] += sub[i-1][0];
                }
            }

            // cout << i << " " << dp[i][0] << " | " << dp[i][1] << "\n";
        }

        ll ans = 0;
        for(const auto &l : dp){
            ans += 2ll * l[0] + l[1];
        }

        cout << ans << "\n";
    }
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3
101
011
11010

output:

12
15
43

result:

ok 3 lines

Test #2:

score: 0
Accepted
time: 5ms
memory: 7572kb

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