QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#156520#7109. Traveling on the Axisucup-team1479#AC ✓6ms3836kbC++141.9kb2023-09-02 13:40:422023-09-02 15:01:41

Judging History

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

  • [2023-09-02 15:01:41]
  • 管理员手动重测该提交记录
  • 测评结果:AC
  • 用时:6ms
  • 内存:3836kb
  • [2023-09-02 14:33:58]
  • 评测
  • [2023-09-02 13:40:42]
  • 提交

answer

#include <bits/stdc++.h>
#define file_in(x) (freopen(#x".in", "r", stdin))
#define file_out(x) (freopen(#x".out", "w", stdout))
#define int long long
#define vi vector
#define pr pair <int, int>
#define mk make_pair
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define db double

using namespace std;

char _c; bool _f; template <class T> void IN(T &x) {
  _f = x = 0; while (_c = getchar(), !isdigit(_c)) {if (_c == '-') _f = 1;}
  while (isdigit(_c)) {x = x * 10 + _c - '0', _c = getchar();} if (_f) x = -x;
}

template <class T> void _write(T x) {
  if (x < 0) return putchar('-'), _write(-x);
  if (x > 9) _write(x / 10);
  putchar('0' + x % 10);
}
template <class T> void write(T x) {_write(x), putchar('\n');}
template <class T> void write_s(T x) {_write(x), putchar(' ');}
template <class first, class... rest> void write(first fir, rest... res) {
  write_s(fir), write(res...);
}
#define debug(...) (_debug(#__VA_ARGS__, __VA_ARGS__))
template <class T> void _debug(const char *format, T x) {
  cerr << format << " = " << x << endl;
}
template <class first, class... rest>
void _debug(const char *format, first fir, rest... res) {
  while (*format != ',') cerr << *format++;
  cerr << " = " << fir << ",", _debug(format + 1, res...);
}

bool START;

const int N = 1e5 + 5;

int t_c, n;
char s[N];

bool END;

int cl(int x) {return (1 + x) * x / 2;}

signed main() {
  IN(t_c);
  while (t_c--) {
    scanf(" %s", s + 1), n = strlen(s + 1);
    int ans = 0; for (int i = 1; i <= n; ++i) ans += cl(i);
    int c0 = 0, c1 = 1; ans += ((s[1] == '0') * n);
    for (int i = 2; i <= n; ++i) {
      if (s[i - 1] == '1') c0 += c1, c1 = 0;
      else c1 += c0, c0 = 0;
      c1++;
      if (s[i] == '1') ans += (c0 * (n - i + 1));
      else ans += (c1 * (n - i + 1));
    }
    write(ans);
  }
  return 0;
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3
101
011
11010

output:

12
15
43

result:

ok 3 lines

Test #2:

score: 0
Accepted
time: 6ms
memory: 3836kb

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