QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#156489#7109. Traveling on the Axisucup-team1134#AC ✓5ms5000kbC++171.0kb2023-09-02 13:38:252023-09-02 14:33:48

Judging History

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

  • [2023-09-02 14:33:48]
  • 评测
  • 测评结果:AC
  • 用时:5ms
  • 内存:5000kb
  • [2023-09-02 13:38:25]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=1<<30;

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int Q;cin>>Q;
    while(Q--){
        string S;cin>>S;
        ll N=si(S);
        ll ans=0;
        vector<ll> ad(N);
        for(int i=N-2;i>=0;i--){
            if(S[i]==S[i+1]){
                ad[i]=N-1-i;
            }
        }
        for(int i=N-2;i>=0;i--) ad[i]+=ad[i+1];
        
        for(ll s=0;s<N;s++){
            ans+=(N-s)*(N-s+1)/2;
            if(S[s]=='0') ans+=N-s;
            ans+=ad[s];
        }
        cout<<ans<<"\n";
    }
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3
101
011
11010

output:

12
15
43

result:

ok 3 lines

Test #2:

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

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