QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#158131 | #7109. Traveling on the Axis | ucup-team1453# | AC ✓ | 5ms | 3776kb | C++14 | 727b | 2023-09-02 16:14:58 | 2023-09-02 16:15:52 |
Judging History
answer
#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); i++)
#define R(i, j, k) for(int i = (j); i >= (k); i--)
#define sz(a) ((int) a.size())
#define vi vector<int>
#define ll long long
#define me(f, x) memset(f, x, sizeof(f))
#define ull unsigned long long
using namespace std;
const int N = 1e6 + 7;
int n;
char s[N];
void Main() {
cin >> (s + 1);
n = strlen(s + 1);
ll ans = 0;
L(p, 1, n) ans += (ll)p * (n - p + 1);
L(p, 1, n) if(s[p] == '0') ans += n - p + 1;
L(p, 1, n - 1) if(s[p] == s[p + 1]) ans += (ll)p * (n - p);
cout << ans << '\n';
}
int main() {
ios :: sync_with_stdio (false);
cin.tie (0); cout.tie (0);
int t; cin >> t;
while(t--) Main();
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3680kb
input:
3 101 011 11010
output:
12 15 43
result:
ok 3 lines
Test #2:
score: 0
Accepted
time: 5ms
memory: 3776kb
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