QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #736966 | #8058. Binary vs Ternary | oqmsac | WA | 4ms | 3660kb | C++23 | 2.2kb | 2024-11-12 14:05:37 | 2024-11-12 14:05:39 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define N 1000005
#define M 998244353
#define ll long long
#define inf (1ll<<60)
#define pii pair<ll,ll>
ll a[N],b[N],f[N];
int main()
{
std::ios::sync_with_stdio(false);
std::cin.tie(NULL);
std::cout.tie(NULL);
ll T;
cin>>T;
while(T--)
{
string a,b;
cin>>a>>b;
if(a==b) { cout << 0 << endl;continue; }
if((a.length()==1||b.length()==1)||b=="10")
{
cout<<-1<<endl;
continue;
}
vector<pii> ans;
for(int i=1;i<a.length();i++)
{
if(a[i]=='0')
{
ans.push_back({i,i+1});
}
}
for(int i=2;i<a.length();i++)
{
ans.push_back({1,2});
ans.push_back({3,4});
ans.push_back({2,3});
}
for(int i=b.length()-1;i>=3;i--)
{
if(b[i]=='0')
{
ans.push_back({1,2});
ans.push_back({1,2});
}
else
{
ans.push_back({1,2});
ans.push_back({1,2});
ans.push_back({2,3});
}
}
//ans.push_back()
if(b.length()>=3)
{
if(b[1]=='0'&&b[2]=='1')
{
ans.push_back({1,2});
ans.push_back({1,2});
ans.push_back({2,3});
ans.push_back({1,2});
ans.push_back({3,4});
}
else if(b[1]=='0'&&b[2]=='0')
{
ans.push_back({1,2});
}
else if(b[1]=='1'&&b[2]=='0')
{
ans.push_back({1,2});
ans.push_back({1,2});
}
else if(b[1]=='1'&&b[2]=='1')
{
ans.push_back({1,2});
ans.push_back({1,2});
ans.push_back({2,3});
}
}
cout<<ans.size()<<endl;
for(int i=0;i<ans.size();i++)
{
cout<<ans[i].first<<' '<<ans[i].second<<endl;
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3620kb
input:
3 1 111 110110 1101010 1111 111111
output:
-1 26 2 3 5 6 1 2 3 4 2 3 1 2 3 4 2 3 1 2 3 4 2 3 1 2 3 4 2 3 1 2 1 2 1 2 1 2 2 3 1 2 1 2 1 2 1 2 2 3 1 2 1 2 18 1 2 3 4 2 3 1 2 3 4 2 3 1 2 1 2 2 3 1 2 1 2 2 3 1 2 1 2 2 3 1 2 1 2 2 3
result:
ok Haitang Suki (3 test cases)
Test #2:
score: -100
Wrong Answer
time: 4ms
memory: 3660kb
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:
14 3 4 4 5 1 2 3 4 2 3 1 2 3 4 2 3 1 2 3 4 2 3 1 2 1 2 2 3 -1 -1 13 1 2 1 2 3 4 2 3 1 2 3 4 2 3 1 2 1 2 2 3 1 2 1 2 2 3 6 1 2 1 2 1 2 1 2 1 2 2 3 8 2 3 3 4 1 2 3 4 2 3 1 2 3 4 2 3 11 2 3 4 5 1 2 3 4 2 3 1 2 3 4 2 3 1 2 3 4 2 3 4 2 3 1 2 3 4 2 3 -1 -1 10 1 2 1 2 1 2 2 3 1 2 1 2 2 3 1 2 1 2 2 3 17 1 2...
result:
wrong answer Pans=-1, Jans!=-1 (test case 3)