QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #65023 | #4592. Theramore | zzxzzx123# | AC ✓ | 15ms | 3584kb | C++ | 414b | 2022-11-26 15:54:40 | 2022-11-26 15:54:42 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
int sum[2][2];
int main(){
int t;
cin>>t;
while(t--){
memset(sum,0,sizeof sum);
string s;
cin>>s;
string a;
a=s;
for(int i=0;s[i];i++){
a[i]='0';
sum[(s[i]-'0')][i&1]++;
}
for(int i=a.size()-1;i>=0;i--){
if(sum[1][i&1]){
a[i]='1';
sum[1][i&1]--;
}
}
cout<<a<<endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 15ms
memory: 3584kb
input:
10 101001 01101100000000101010 11100100010110110011101010011111111010110100011100000001101011111001101000001010101001101101010011100101001000001011111011010001111110100101100010111110011000000101110110110001010100110001000110001101110011001101101101011000011010011010101111010010111010001001010111111...
output:
001011 00000000001010101111 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...
result:
ok 10 lines