QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#246285#7109. Traveling on the Axisucup-team2190#AC ✓7ms5080kbC++20772b2023-11-10 18:33:592023-11-10 18:33:59

Judging History

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

  • [2023-11-10 18:33:59]
  • 评测
  • 测评结果:AC
  • 用时:7ms
  • 内存:5080kb
  • [2023-11-10 18:33:59]
  • 提交

answer

#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
using namespace std;
#define MMM 1000000007
#define ll long long
#define END "\n"
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll t=1;
    cin>>t;
    while(t--){
        string s;
        cin>>s;
        ll n=s.size();
        ll ans=0;
        vector<ll>dp1(n+1,0),dp2(n+1,0);
        for(ll i=n-1;i>=0;i--){
            if(s[i]=='1'){
                dp1[i]=n-i+dp2[i+1];
                dp2[i]=2*(n-i)+dp2[i+1];
                
            }
            else{
                dp1[i]=2*(n-i)+dp1[i+1];
                dp2[i]=n-i+dp1[i+1];
            }
           ans+=dp1[i];
        }
        cout<<ans<<END;
        
    }
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3
101
011
11010

output:

12
15
43

result:

ok 3 lines

Test #2:

score: 0
Accepted
time: 7ms
memory: 5080kb

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