QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#782776#8058. Binary vs TernarySize_OIerWA 2ms3576kbC++141010b2024-11-25 21:25:332024-11-25 21:25:33

Judging History

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

  • [2024-11-25 21:25:33]
  • 评测
  • 测评结果:WA
  • 用时:2ms
  • 内存:3576kb
  • [2024-11-25 21:25:33]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
const int maxn = 100 + 5;
int T;
char a[maxn], b[maxn];
vector < pair <int, int> > ans;
int main () {
	cin >> T;
	while (T--) {
		ans.clear ();
		cin >> a + 1;
		cin >> b + 1;
		int s, t;
		s = strlen (a + 1), t = strlen (b + 1);
		if (s == 1 || t == 1) {
			puts ("-1");
			continue;
		}
		for (int i = 1; i < s; i++) if (a[i + 1] == '0') ans.push_back (make_pair (i, i + 1));
		if (s > t) 
		while (s > t) {
			ans.push_back (make_pair (s - 2, s - 1));
			ans.push_back (make_pair (s - 1, s + 1));
			s--;
		}
		else 
		while (s < t) {
			ans.push_back (make_pair (s - 1, s));
			ans.push_back (make_pair (s - 1, s));
			ans.push_back (make_pair (s, s + 1));
			s++;
		}
		for (int i = 1; i <= t; i++) 
		if (b[i] == '0') {
			ans.push_back (make_pair (i - 1, i));
			ans.push_back (make_pair (i, i + 1));
		}
		cout << ans.size () << '\n';
		for (auto v : ans) cout << v.first << ' ' << v.second << '\n';
	}
	return 0;
}

详细

Test #1:

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

input:

3
1
111
110110
1101010
1111
111111

output:

-1
11
2 3
5 6
5 6
5 6
6 7
2 3
3 4
4 5
5 6
6 7
7 8
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: 2ms
memory: 3576kb

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
3 4
4 6
2 3
3 5
-1
11
1 2
2 3
3 4
3 4
4 6
2 3
3 5
1 2
2 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
2 3
3 5
1 2
2 4
8
2 3
4 5
3 4
4 6
2 3
3 5
1 2
2 4
3
2 3
1 2
2 4
-1
10
1 2
4 5
3 4
4 6
2 3
3 5
1 2
2 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 (l,r) is invalid (test case 12)