QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#736941#8058. Binary vs TernaryoqmsacWA 0ms3564kbC++232.2kb2024-11-12 14:00:582024-11-12 14:00:58

Judging History

你现在查看的是最新测评结果

  • [2024-11-12 14:00:58]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3564kb
  • [2024-11-12 14:00:58]
  • 提交

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[2]=='0'&&b[1]=='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[2]=='0'&&b[1]=='0')
            {
                ans.push_back({1,2});
            }
            else if(b[2]=='1'&&b[1]=='0')
            {
                ans.push_back({1,2});
                ans.push_back({1,2});
            }
            else if(b[2]=='1'&&b[1]=='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: 0
Wrong Answer
time: 0ms
memory: 3564kb

input:

3
1
111
110110
1101010
1111
111111

output:

-1
29
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
2 3
1 2
3 4
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:

wrong answer S!=T after all operations (test case 2)