QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#211403	#6838. Assumption is All You Need	PHarr^#	WA	1ms	3636kb	C++20	987b	2023-10-12 15:54:41	2023-10-12 15:54:41

Judging History

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

[2023-10-12 15:54:41]
评测

测评结果：WA
用时：1ms
内存：3636kb

查看

[2023-10-12 15:54:41]
提交

answer

#include <bits/stdc++.h>

using namespace std;

#define int long long
using pii = pair<int, int>;
using vi = vector<int>;

void solve() {
    int n;
    cin >> n;
    vi a(n), b(n);
    for (auto &i: a) cin >> i;
    for (auto &i: b) cin >> i;
    vector<pii> res;
    auto search = [n](int x, vi a) {
        for (int i = 0; i < n; i++)
            if (a[i] == x) return i;
    };
    for (int i = n - 1, j; i >= 0; i--) {
        j = search(b[i], a);
        if (i == j) continue;
        if ((i > j) == (a[j] > a[i])) {
            swap(a[i], a[j]);
            res.emplace_back(min(i, j) + 1, max(i, j) + 1);
        }else{
            cout << "-1\n";
            return;
        }
    }
    cout << res.size() << "\n";
    for (auto [x, y]: res)
        cout << x << " " << y << "\n";
    return;
}

int32_t main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);
    int T;
    for (cin >> T; T; T--)
        solve();

    return 0;
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3632kb

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: 1ms

memory: 3636kb

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