QOJ.ac
QOJ
The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#357173 | #7109. Traveling on the Axis | arnold518 | AC ✓ | 2ms | 3704kb | C++17 | 583b | 2024-03-18 19:02:21 | 2024-03-18 19:02:21 |
Judging History
answer
#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int N, TC;
string S;
int main() {
cin.tie(0); ios_base::sync_with_stdio(0);
cin>>TC;
while(TC--)
{
cin>>S; N=S.size();
S="?"+S;
ll ans=0;
for(int i=1; i<=N; i++) ans+=(ll)i*(i+1)/2;
for(int i=1; i<=N; i++)
{
if(S[i]=='0') ans+=N-i+1;
}
ll t=0;
for(int i=N-1; i>=1; i--)
{
if(S[i]==S[i+1])
{
t+=N-i;
}
ans+=t;
}
cout<<ans<<"\n";
}
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3540kb
input:
3 101 011 11010
output:
12 15 43
result:
ok 3 lines
Test #2:
score: 0
Accepted
time: 2ms
memory: 3704kb
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