QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#394962 | #7109. Traveling on the Axis | ucup-team055# | AC ✓ | 15ms | 3912kb | C++23 | 965b | 2024-04-20 23:25:16 | 2024-04-20 23:25:16 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
const ll INF = LLONG_MAX / 4;
#define rep(i, a, b) for(ll i = a; i < (b); i++)
#define sz(a) ssize(a)
bool chmin(auto& a, auto b) { if(a <= b) return 0; a = b; return 1; }
bool chmax(auto& a, auto b) { if(a >= b) return 0; a = b; return 1; }
ll solve() {
string S;
cin >> S;
ll ans = 0;
ll v0 = 0, v1 = 0;
ll c0 = 0, c1 = 0;
for(char c : S) {
c0++;
v0 += c0;
v1 += c1;
if(c == '0') {
v0 += c0;
v1 += exchange(v0, 0);
c1 += exchange(c0, 0);
}
else {
v1 += c1;
c0 += exchange(c1, 0);
v0 += exchange(v1, 0);
}
swap(c0, c1);
swap(v0, v1);
ans += v0 + v1;
}
return ans;
}
int main() {
ll T;
cin >> T;
while(T--) cout << solve() << '\n';
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3508kb
input:
3 101 011 11010
output:
12 15 43
result:
ok 3 lines
Test #2:
score: 0
Accepted
time: 15ms
memory: 3912kb
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