QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#462232#8058. Binary vs TernarymasterhuangWA 1ms3740kbC++17944b2024-07-03 15:54:272024-07-03 15:54:31

Judging History

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

  • [2024-07-03 15:54:31]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3740kb
  • [2024-07-03 15:54:27]
  • 提交

answer

#include<bits/stdc++.h>
#define LL long long
#define P pair<int,int>
#define fi first
#define se second
#define fr(x) freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);
using namespace std;
const int N=105;
int T,n,m,a[N],b[N];
string A,B;vector<P>ans;
inline void add(int l,int r){ans.push_back({l,r});}
int main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);cin>>T;
	while(T--)
	{
		cin>>A>>B;
		if(A==B){cout<<"0\n";continue;}
		if(A=="1"||B=="1"){cout<<"-1\n";continue;}
		n=A.size(),m=B.size();ans.clear();
		for(int i=1;i<=n;i++) a[i]=A[i-1]-'0';
		for(int i=1;i<=m;i++) b[i]=B[i-1]-'0';
		for(int i=1;i<=n;i++) if(!a[i]) add(i-1,i);
		if(n<m) for(int i=n+1;i<=m;i++) add(i-2,i-1),add(i-2,i-1),add(i-1,i);
		if(n>m) for(int i=n;i>m;i--) add(i-1,i),add(i,i+1);
		for(int i=m;i;i--) if(!b[i]) add(i-1,i),add(i,i+1);
		cout<<ans.size()<<"\n";for(auto [l,r]:ans) cout<<l<<" "<<r<<"\n";
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3740kb

input:

3
1
111
110110
1101010
1111
111111

output:

-1
11
2 3
5 6
5 6
5 6
6 7
6 7
7 8
4 5
5 6
2 3
3 4
6
3 4
3 4
4 5
4 5
4 5
5 6

result:

ok Haitang Suki (3 test cases)

Test #2:

score: -100
Wrong Answer
time: 1ms
memory: 3680kb

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:

6
3 4
4 5
4 5
5 6
3 4
4 5
-1
11
1 2
2 3
3 4
4 5
5 6
3 4
4 5
2 3
3 4
1 2
2 3
1
1 2
9
1 2
1 2
1 2
2 3
2 3
2 3
3 4
3 4
4 5
6
2 3
3 4
3 4
4 5
2 3
3 4
8
2 3
4 5
4 5
5 6
3 4
4 5
2 3
3 4
3
2 3
2 3
3 4
-1
10
1 2
4 5
4 5
5 6
3 4
4 5
2 3
3 4
1 2
2 3
10
1 2
1 2
1 2
2 3
2 3
2 3
3 4
3 4
3 4
4 5
10
1 2
2 3
3 4
4 ...

result:

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