QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#198818#7109. Traveling on the AxisckisekiAC ✓8ms3684kbC++201.3kb2023-10-03 17:27:472023-10-03 17:27:47

Judging History

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

  • [2023-10-03 17:27:47]
  • 评测
  • 测评结果:AC
  • 用时:8ms
  • 内存:3684kb
  • [2023-10-03 17:27:47]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
template <typename ...T>
void debug_(const char *s, T ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int cnt = sizeof...(T);
  (..., (cerr << a << (--cnt ? ", " : ")\e[0m\n")));
}
template <typename I>
void orange_(const char *s, I L, I R) {
  cerr << "\e[1;32m[ " << s << " ] = [ ";
  for (int f = 0; L != R; ++L)
    cerr << (f++ ? ", " : "") << *L;
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

void solve() {
  string s;
  cin >> s;
  array<int64_t, 2> cnt = {}, sum = {};

  cnt[0] = 1;
  sum[0] = 0;

  int64_t ans = 0;

  for (char c: s) {
    const int d = c - '0';
    // d = !d;
    array<int64_t, 2> ncnt = {}, nsum = {};
    ncnt[d] = cnt[0] + cnt[1];
    nsum[d] = sum[0] + sum[1] + cnt[d] + cnt[0] + cnt[1];

    sum = nsum;
    cnt = ncnt;

    debug(sum[0], sum[1], cnt[0], cnt[1]);
    ans += sum[0] + sum[1];

    sum[0] += 0;
    cnt[0] += 1;
  }
  cout << ans << '\n';
}

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int T;
  cin >> T;
  while (T--)
    solve();
}

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

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3632kb

input:

3
101
011
11010

output:

12
15
43

result:

ok 3 lines

Test #2:

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

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