QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#214484#7109. Traveling on the AxisYangmf#AC ✓4ms8256kbC++171.1kb2023-10-14 20:05:522023-10-14 20:05:52

Judging History

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

  • [2023-10-14 20:05:52]
  • 评测
  • 测评结果:AC
  • 用时:4ms
  • 内存:8256kb
  • [2023-10-14 20:05:52]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pii;
#define error           \
    {                   \
        cout << "No\n"; \
        return;         \
    }
#define all(x) (x.begin(), x.end())
const int N = 1e6 + 10;
int a[N];
int n, m;
char s[N];
int su[N];
void solve()
{
    cin>>(s+1);
    int n=strlen(s+1);
    su[1]=1;
    for(int i=2;i<=n;i++){

        if(s[i]==s[i-1]) su[i]=su[i-1];
        else su[i]=su[i-1]+1;
    }
    int now=0;
    for(int i=1;i<=n;i++){

        now=now+2*i-su[i];
        // cout<<2*i-su[i]<<" ";
    }
    // cout<<"\n";
    int ans=0;
    for(int i=1;i<=n;i++){

            int p=0;
            if(s[i]=='0') p++;
            if(s[i]==s[i-1]) p--;
            ans = ans + now - (n - i + 1) * (2 * i - 2 - su[i - 1]-p);

            now -= 2 * i - su[i];
    }
    cout<<ans<<"\n";
}
signed main()
{

    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    while (t--)
    {

        solve();
    }
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3
101
011
11010

output:

12
15
43

result:

ok 3 lines

Test #2:

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

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