QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#162524#7109. Traveling on the Axisnotpasscet_6#AC ✓8ms5596kbC++141.0kb2023-09-03 13:59:242023-09-03 13:59:25

Judging History

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

  • [2023-09-03 13:59:25]
  • 评测
  • 测评结果:AC
  • 用时:8ms
  • 内存:5596kb
  • [2023-09-03 13:59:24]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define x first
#define y second

typedef unsigned long long ull;
typedef pair<int,int> PII;

const int N=1e6+10;

int n,m;
int f[N][2];

signed main(){
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);

    int T_T=1;
    cin>>T_T;
    while(T_T--){
        string s;
        cin>>s;
        n=s.size();
        s=" "+s;
        int res=0,ans=0;
        f[0][0]=1;
        f[0][1]=0;
        for(int i=1;i<=n;i++){
            if(s[i]=='0'){
                res+=f[i-1][0];
                f[i][0]=f[i-1][0]+f[i-1][1];
                f[i][1]=0;
            }else{
                res+=f[i-1][1];
                f[i][1]=f[i-1][0]+f[i-1][1];
                f[i][0]=0;
            }
            f[i][0]++;
            ans+=res;
        }
        int sum=0,sum2=0;
        for(int i=1;i<=n;i++){
            sum2+=i;
            sum+=sum2;
        }
        cout<<ans+sum<<"\n";
    }
    return 0;
}


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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3
101
011
11010

output:

12
15
43

result:

ok 3 lines

Test #2:

score: 0
Accepted
time: 8ms
memory: 5596kb

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