QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#283595 | #7109. Traveling on the Axis | yixiuge777 | AC ✓ | 2ms | 3784kb | C++14 | 961b | 2023-12-14 21:22:34 | 2023-12-14 21:22:34 |
Judging History
answer
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#define ll long long
#define N 500010
using namespace std;
ll read(){
char cc;
while(1){cc=getchar();if((cc>='0'&&cc<='9')||cc=='-')break;}
ll sum=0,flag=1;
cc=='-'?flag=-1:sum=(cc^48);
while(1){cc=getchar();if(!(cc>='0'&&cc<='9'))break;sum=(sum<<1)+(sum<<3)+(cc^48);}
return sum*flag;
}
void write(ll x){
if(!x)putchar('0');
if(x<0){x=-x;putchar('-');}
ll cc[25],cntt=0;
while(x){cc[++cntt]=x%10;x/=10;}
for(ll i=cntt;i>=1;i--)putchar(cc[i]+'0');
putchar('\n');
}
ll T,n,ans,s0,s1;
char c[N];
int main(){
T=read();while(T--){
scanf("%s",c+1);n=strlen(c+1);
ans=s0=s1=0;
for(ll i=n;i>=1;i--){
ll _s0=s0,_s1=s1;
if(c[i]=='0'){// red
s0=_s0+(2)*(n-i+1);
s1=_s0+(1)*(n-i+1);
}
else {// green
s0=_s1+(1)*(n-i+1);
s1=_s1+(2)*(n-i+1);
}
ans+=s0;
}
write(ans);
}
}
这程序好像有点Bug,我给组数据试试?
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3428kb
input:
3 101 011 11010
output:
12 15 43
result:
ok 3 lines
Test #2:
score: 0
Accepted
time: 2ms
memory: 3784kb
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