QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#156273#7109. Traveling on the Axisucup-team896#AC ✓9ms4376kbC++141.2kb2023-09-02 13:23:072023-09-02 14:33:21

Judging History

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

  • [2023-09-02 14:33:21]
  • 评测
  • 测评结果:AC
  • 用时:9ms
  • 内存:4376kb
  • [2023-09-02 13:23:07]
  • 提交

answer

#include <bits/stdc++.h>
#ifdef dbg
#define D(...) fprintf(stderr, __VA_ARGS__)
#define DD(...) D(#__VA_ARGS__ " = "), debug_helper::debug(__VA_ARGS__), D("\n")
#include "C:\Users\wsyear\Desktop\OI\templates\debug.hpp"
#else
#define D(...) ((void)0)
#define DD(...) ((void)0)
#endif
#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

using namespace std;

const int N = 100010;

int n, a[N];
char s[N];

void print(__int128 x) {
  if (!x) return;
  print(x / 10), cout << int(x % 10);
}

void work() {
  cin >> (s + 1), n = strlen(s + 1);
  rep (i, 1, n) a[i] = s[i] - '0';
  __int128 ans = 0;
  rep (len, 1, n) ans += 1ll * len * (n - len + 1);
  rep (i, 1, n) if (!a[i]) ans += (n - i + 1);
  rep (i, 1, n - 1) if (a[i] == a[i + 1]) ans += 1ll * i * (n - i);
  if (ans == 0) cout << "0\n";
  else print(ans), cout << '\n';
}

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  int t; cin >> t;
  while (t--) work();
}

/*
3
101
011
11010
*/

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3
101
011
11010

output:

12
15
43

result:

ok 3 lines

Test #2:

score: 0
Accepted
time: 9ms
memory: 4376kb

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