QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#404437 | #8058. Binary vs Ternary | KLPP# | WA | 1ms | 3756kb | C++17 | 1.3kb | 2024-05-03 22:26:53 | 2024-05-03 22:26:53 |
Judging History
answer
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long int lld;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)
vector<pair<int,int> >op;
void solve(){
op.clear();
string A,B;
cin>>A>>B;
if(A=="1"){
if(B=="1"){
cout<<"0\n\n";
return;
}
cout<<"-1\n";
return;
}
if(B=="1"){
cout<<"1\n";
return;
}
while(A.size()>2 || A[1]=='1'){
if(A[1]=='1'){
op.push_back({0,1});
op.push_back({1,2});
A="10"+A.substr(2,A.size()-2);
}else{
op.push_back({1,2});
A="1"+A.substr(2,A.size()-2);
}
}
while(A.size()<B.size()){
op.push_back({0,1});
op.push_back({0,1});
A="10"+A.substr(1,A.size()-1);
}
rep(i,1,(int)A.size()){
op.push_back({i-1,i});
A[i]='1';
}
for(int i=A.size()-1;i>0;i--){
if(A[i]!=B[i]){
op.push_back({i-1,i});
op.push_back({i,i+1});
}
}
cout<<op.size()<<"\n";
trav(a,op)cout<<a.first+1<<" "<<a.second+1<<"\n";
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int tt=1;
cin>>tt;
while(tt--){
solve();
}
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3516kb
input:
3 1 111 110110 1101010 1111 111111
output:
-1 32 1 2 2 3 2 3 2 3 1 2 2 3 2 3 1 2 2 3 2 3 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 2 3 3 4 4 5 5 6 6 7 6 7 7 8 4 5 5 6 2 3 3 4 21 1 2 2 3 2 3 1 2 2 3 2 3 1 2 2 3 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 2 3 3 4 4 5 5 6
result:
ok Haitang Suki (3 test cases)
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3756kb
input:
1000 11100 111 1 11110 10001 10 1011 1111 10 1110 1100 11 11010 11 110 11 1 10001 10110 10 10 11111 10000 1001 10 1 11 10111 11 10 1 100 11 10100 1 10 101 11 1100 110 11 1110 1 1001 1 11111 10 10010 10 11001 110 1010 10011 1110 10100 1001 1001 101 100 1 1001 11 101 11 101 1001 1 1 1011 1 10 10 1011 ...
output:
11 1 2 2 3 2 3 1 2 2 3 2 3 2 3 1 2 1 2 1 2 2 3 -1 8 2 3 2 3 2 3 1 2 2 3 1 2 1 2 2 3 13 2 3 1 2 2 3 2 3 1 2 2 3 1 2 1 2 1 2 1 2 1 2 2 3 3 4 9 1 2 1 2 1 2 1 2 1 2 2 3 3 4 3 4 4 5 5 1 2 2 3 2 3 2 3 1 2 8 1 2 2 3 2 3 2 3 1 2 2 3 2 3 1 2 4 1 2 2 3 2 3 1 2 -1 10 2 3 1 2 2 3 2 3 1 2 2 3 2 3 1 2 1 2 2 3 10 ...
result:
wrong answer (l,r) is invalid (test case 13)