QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#240582 | #7109. Traveling on the Axis | ucup-team2307# | AC ✓ | 5ms | 3664kb | C++14 | 747b | 2023-11-05 16:32:33 | 2023-11-05 16:32:33 |
Judging History
answer
#include<bits/stdc++.h>
using ll = long long;
#define all(x) begin(x), end(x)
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(0);
int T;
cin >> T;
while(T--) {
string s;
cin >> s;
int n = s.size();
ll dp[2] = {0, 0};
ll cnt[2] = {1, 0};
ll ans = 0;
for(int i = 0; i < n; i++) {
int v = s[i] - '0';
dp[v] = dp[0^v] + dp[1^v] + 2*cnt[0^v] + cnt[1^v];
dp[1^v] = 0;
cnt[v] = cnt[1^v] + cnt[0^v];
cnt[1^v] = 0;
cnt[0]++;
ans += dp[0] + dp[1];
// cout << i << " " << dp[0] << " " << dp[1] << endl;
}
cout << ans << '\n';
}
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3480kb
input:
3 101 011 11010
output:
12 15 43
result:
ok 3 lines
Test #2:
score: 0
Accepted
time: 5ms
memory: 3664kb
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