QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#167434#7109. Traveling on the AxissupepapupuWA 4ms3716kbC++171018b2023-09-07 14:43:422023-09-07 14:43:42

Judging History

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

  • [2023-09-07 14:43:42]
  • 评测
  • 测评结果:WA
  • 用时:4ms
  • 内存:3716kb
  • [2023-09-07 14:43:42]
  • 提交

answer

#include <bits/stdc++.h>

#define x first
#define y second
#define el '\n'
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 3e5 + 10, INF = 0x3f3f3f3f, mod = 998244353;

inline int read() {
    int f = 1, k = 0;
    char c = getchar();
    while (c < '0' || c > '9') {
        if (c == '-') f = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        k = k * 10 + c - '0';
        c = getchar();
    }
    return f * k;
}

char str[N];

void solve() {
    cin >> str + 1;
    int n = strlen(str + 1);
    ll ans = 0;
    for (int i = 1; i <= n; ++i) 
        ans += i * (n - i + 1);
    // cout << ans << ' ';
    for (int i = 1; i <= n; ++i) {
        if (str[i] == '0') ans += n - i + 1;
        if (i > 1 && str[i] == str[i - 1]) ans += (i - 1) * (n - i + 1); 
    }
    cout << ans << el;
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int tcase = 1;
    cin >> tcase;
    while (tcase--) solve();
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3
101
011
11010

output:

12
15
43

result:

ok 3 lines

Test #2:

score: -100
Wrong Answer
time: 4ms
memory: 3716kb

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:

wrong answer 6102nd lines differ - expected: '151538662672591', found: '30781362178255'