QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#169415#7109. Traveling on the Axisxianggui#AC ✓7ms3744kbC++201.4kb2023-09-09 13:26:142023-09-09 13:26:22

Judging History

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

  • [2023-09-09 13:26:22]
  • 评测
  • 测评结果:AC
  • 用时:7ms
  • 内存:3744kb
  • [2023-09-09 13:26:14]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int T;
int n;
char s[100010];
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout.tie(0);
    cin>>T;
    while(T--)
    {
        cin>>s;
        n=strlen(s);
        ll ans=0;
        ll la1=0,la2=0,lat1=0,lat2=0;
        for(int i=0;i<n;i++)
        {
            if(i==0)
            {
                if(s[i]=='0') lat1=2,lat2=1;
                else lat1=1,lat2=2;
                la1+=lat1;
                la2+=lat2;
            }
            else
            {
                if(s[i]==s[i-1]) lat1+=2,lat2+=2;
                else lat1+=1,lat2+=1;
                la1+=lat1;
                la2+=lat2;
            }
            // cout<<lat1<<" "<<lat2<<endl;
        }
        // cout<<la1<<" "<<la2<<endl;
        ans+=la1;
        for(int i=0;i<n-1;i++)
        {
            if(s[i]=='0')
            {
                la1-=2*(n-i);
                la2=la1;
                if(s[i+1]=='1') la2+=(n-i-1);
                else la2-=(n-i-1);
            }
            else
            {
                la2-=2*(n-i);
                la1=la2;
                if(s[i+1]=='0') la1+=(n-i-1);
                else la1-=(n-i-1);
            }
            ans+=la1;
            // cout<<la1<<" "<<la2<<endl;
        }
        cout<<ans<<'\n';
    }
    return 0;
}
/*
5
5 4
100 50
252 52
3 0
10 10
*/

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 2ms
memory: 3660kb

input:

3
101
011
11010

output:

12
15
43

result:

ok 3 lines

Test #2:

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

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