QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#665621	#6838. Assumption is All You Need	hhdhh	WA	1ms	3668kb	C++23	1.6kb	2024-10-22 14:28:07	2024-10-22 14:28:13

Judging History

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

[2024-10-22 14:28:13]
评测

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

查看

[2024-10-22 14:28:07]
提交

answer

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define rep(i, a, b) for(int i = (a); i <= (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
#define rept(i, a, ne) for(int i = (a); ~i ; i=ne[i])
#define debug(x) cout<<#x<<": "<<x<<endl
#define fi first
#define sec second
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
typedef long long LL;
typedef long double  LD;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef pair<int,int>PII;
const int N=3e3+10;
int a[N];
int b[N];
PII res[N*N];
int c[N];
void slove()
{
    int n;
    cin>>n;
    rep(i,1,n)
    {
       cin>>a[i];
       c[a[i]]=i; 
    }
    rep(i,1,n)
    cin>>b[i];
    int num=0;
    per(i,n,1)
    {
        int x=c[i];
        if(a[x]==b[x])
        continue;
        int y=x+1;
        int f=0;
        while(y<=n)
        {
            if(a[y]!=b[y]&&a[y]<a[x])
            {
                res[++num]={x,y};
                swap(c[a[x]],c[a[y]]);
                swap(a[x],a[y]);
                x=y;
            }
            if(a[x]==b[x])
            {
                f=1;
                break;
            }
            y++;
        }
        
        if(f==0)
        {
            cout<<-1<<endl;
            return;
        }
    }
    cout<<num<<endl;
    rep(i,1,num)
    cout<<res[i].fi<<' '<<res[i].sec<<endl;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
//	cout << fixed << setprecision(9);
    int t=1;
	cin>>t;
    while(t--)
    {
        slove();
    }


    return 0;
}
//#pragma GCC optimize(2)

源文件, 语言: C++23

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3528kb

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

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