QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#230780#7109. Traveling on the AxisUFRJ#AC ✓4ms3524kbC++20830b2023-10-28 20:52:572023-10-28 20:52:58

Judging History

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

  • [2023-10-28 20:52:58]
  • 评测
  • 测评结果:AC
  • 用时:4ms
  • 内存:3524kb
  • [2023-10-28 20:52:57]
  • 提交

answer

#include<bits/stdc++.h>

using namespace std;
using lint = int64_t;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int t;
    cin>>t;
    while(t--){
        string s;
        cin>>s;
        int n = (int)s.size();
        lint ans = 0;
        for(int i=1;i<=n;i++) ans += lint(i) * (i + 1) / 2;
        int cnt = 0;
        for(int i=0;i<n;i++){
            int c = cnt&1;
            int e = (s[i] - '0');
            lint cur = lint(n - i) * (i + 1);
            if(c){
                if(e) ans += cur - (n - i);
                else ans += (n - i);
            }
            else{
                if(e) ans += 0;
                else ans += cur;
            }
            if(c^e) cnt += 1;
            else cnt += 2;
        }
        cout<<ans<<"\n";
    }
    return 0;
}

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

詳細信息

Test #1:

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

input:

3
101
011
11010

output:

12
15
43

result:

ok 3 lines

Test #2:

score: 0
Accepted
time: 4ms
memory: 3524kb

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