QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#278287	#6838. Assumption is All You Need	rageOfThunder^#	WA	0ms	3860kb	C++14	1.5kb	2023-12-07 14:35:09	2023-12-07 14:35:09

Judging History

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

[2023-12-07 14:35:09]
评测

测评结果：WA
用时：0ms
内存：3860kb

查看

[2023-12-07 14:35:09]
提交

answer

// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "[" << __LINE__ << "] "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> inline void chkmax(T &x, T y) {x = max(x, y);}
template <typename T> inline void chkmin(T &x, T y) {x = min(x, y);}
template <typename T> inline void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	x *= f;
}
const int N = 2050;
int n, a[N], b[N];
void zhk() {
	read(n);
	F(i, 1, n) read(a[i]);
	F(i, 1, n) read(b[i]);
	vector <pair <int, int>> ans;
	DF(i, n, 1) {
		if (a[i] > b[i]) {
			puts("-1");
			return;
		}
		F(j, 1, i - 1)
			if (a[j] == b[i]) {
				// bool flag = true;
				// F(k, i + 1, j - 1)
				// 	if (a[k] < a[i] && a[k] > a[j]) {
				// 		swap(a[i], a[k]);
				// 		ans.emplace_back(i, k);
						
				// 		flag = false;
				// 		break;
				// 	}
				swap(a[i], a[j]);
				ans.emplace_back(j, i);
				break;
			}
	}
	cout << ans.size() << '\n';
	for (auto [i, j]: ans) cout << i << ' ' << j << '\n';
}
signed main() {
	int _ = 1;
	cin >> _;
	while (_--) zhk();
	return 0;
}
/* why?
*/

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3860kb

input:

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

output:

result:

ok T=3

Test #2:

score: -100

Wrong Answer

time: 0ms

memory: 3832kb

input:

315
10
8 4 6 1 2 9 7 5 10 3
6 7 8 10 5 1 3 2 9 4
10
10 8 2 9 6 5 7 4 3 1
7 1 3 5 9 8 4 10 6 2
6
4 6 5 3 1 2
1 5 4 6 2 3
12
5 9 12 8 10 6 11 4 2 3 1 7
9 2 3 1 5 12 4 7 6 10 8 11
10
4 7 3 2 8 9 6 10 5 1
1 4 8 10 3 7 9 6 2 5
7
1 2 4 5 6 7 3
4 3 5 6 7 2 1
3
1 3 2
2 1 3
7
1 5 3 7 6 4 2
6 5 2 1 3 4 7
1
1
...

output:

-1
-1
-1
-1
-1
-1
-1
-1
0
-1
-1
-1
3
2 6
4 5
1 2
-1
-1
-1
0
0
-1
-1
-1
-1
-1
-1
-1
-1
-1
3
4 5
2 4
1 2
-1
-1
-1
-1
-1
-1
0
0
-1
-1
-1
-1
-1
-1
0
0
-1
-1
0
-1
-1
-1
1
1 2
4
3 6
2 5
3 4
1 3
2
1 3
1 2
-1
-1
0
-1
-1
2
2 4
2 3
-1
-1
-1
0
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
0
-1...

result:

wrong answer Case #2: Jury has the answer but participant has not