QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#610879	#6838. Assumption is All You Need	wangcq	WA	1ms	3544kb	C++23	1.9kb	2024-10-04 17:54:28	2024-10-04 17:54:28

Judging History

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

[2024-10-04 17:54:28]
评测

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

查看

[2024-10-04 17:54:28]
提交

answer

#include<bits/stdc++.h>

using namespace std;

#define int long long
#define pii pair<int,int>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define endl '\n'
const int N = 2e5 + 10, mod = 1e9 + 7;
const int inf = 1e18;
mt19937_64 rnd(0);

void solve() {
    int n;
    cin>>n;
    vector<int>a(n+1);
    vector<int>b(n+1);
    vector<int>pos(n+1);
    for(int i=1;i<=n;i++){ cin>>a[i];pos[a[i]]=i;}
    for(int i=1;i<=n;i++) cin>>b[i];
    vector<int>tmp_a=a;
    vector<int>tmp_pos=pos;

    vector<pii>res;
    bool ok=true;
    for(int i=1;i<=n;i++){
        int p=pos[i];
        if(a[p]==b[p]) continue;
        for(int j=p-1;j>=1;j--){
            if(a[j]==b[j]) continue;
            res.push_back({j,p});
            swap(a[j],a[p]);
            pos[a[j]]=j;
            pos[a[p]]=p;
            p=j;
            if(a[p]==b[p]) break;
        }
        if(a[p]!=b[p]){
            ok=false;
        }
    }
    if(ok){
        cout<<res.size()<<"\n";
        for(auto w:res){
            cout<<w.first<<" "<<w.second<<"\n";
        }
        return;
    }
    res.clear();
    ok= true;
    a=tmp_a;
    pos=tmp_pos;
    for(int i=n;i>=1;i--){
        int p=pos[i];
        if(a[p]==b[p]) continue;
        for(int j=p+1;j<=n;j++){
            if(a[j]==b[j]) continue;
            res.push_back({j,p});
            swap(a[j],a[p]);
            pos[a[j]]=j;
            pos[a[p]]=p;
            p=j;
            if(a[p]==b[p]) break;
        }
        if(a[p]!=b[p]){
            ok=false;
        }
    }
    if(ok){
        cout<<res.size()<<"\n";
        for(auto w:res){
            cout<<w.first<<" "<<w.second<<"\n";
        }
    }else{
        cout<<-1<<"\n";
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    cin >> t;
    while (t--) solve();
    return 0;
}

源文件, 语言: C++23

详细

Test #1:

score: 100

Accepted

time: 1ms

memory: 3484kb

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: 3544kb

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
5
3 2
4 3
3 1
5 1
6 5
-1
-1
-1
-1
-1
0
-1
-1
-1
3
5 4
2 1
6 1
-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
-1
2
1 2
2 3
-1
-1
0
-1
-1
2
2 3
3 4
-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
...

result:

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