QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#807870#9871. Just another Sorting ProblemHalloWorldWA 0ms3664kbC++201.2kb2024-12-10 13:42:482024-12-10 13:42:48

Judging History

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

  • [2024-12-10 13:42:48]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3664kb
  • [2024-12-10 13:42:48]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define SZ(x) ((int)(x).size())
#define debug(a) cout<<#a<<":"<<a<<endl
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,b,a) for(int i=b;i>=a;i--)
constexpr int N=100010;
constexpr int INF=2e9;
constexpr ll LLF=2e18;
constexpr ll mod=998244353;
constexpr int dir[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
ll powmod(ll a,ll b,ll mod=mod) {ll res=1;a%=mod;for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll inv(ll a){return powmod(a,mod-2);}
int n,a[N];
string s;
void solve() {
	cin>>n>>s;
	int cnt=0; 	
	rep(i,1,n){
		cin>>a[i];
		if(a[i]!=i){
			cnt++;
		}
	}
	int mx=0;
	rep(i,2,n){
		int tcnt=cnt;
		if(a[i]==i) tcnt--;
		if(a[i-1]==i-1) tcnt--;
		if(a[i]==i-1) tcnt++;
		if(a[i-1]==i) tcnt++;
		mx=max(mx,tcnt);
	}
	if(n==2){
		cout<<"Alice\n";
		return;
	}
	if(s=="Alice"){
		if(cnt<=2){
			cout<<"Alice\n";
		}else{
			cout<<"Bob\n";
		}
	}else{
		if(mx<=2){
			cout<<"Alice\n";
		}else{
			cout<<"Bob\n";
		}
	}
}
int main() {
	ios::sync_with_stdio(false);cin.tie(nullptr);
	//cout<<fixed<<setprecision(10);
	int testcase;cin>>testcase;rep(_,1,testcase){
		solve();
	}
	return 0;	
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3
2 Alice
2 1
3 Bob
1 3 2
10 Bob
1 2 3 4 5 6 7 8 10 9

output:

Alice
Bob
Bob

result:

ok 3 lines

Test #2:

score: 0
Accepted
time: 0ms
memory: 3612kb

input:

2
2 Alice
2 1
2 Bob
2 1

output:

Alice
Alice

result:

ok 2 lines

Test #3:

score: -100
Wrong Answer
time: 0ms
memory: 3664kb

input:

10
3 Bob
2 3 1
3 Alice
3 1 2
3 Bob
3 1 2
3 Alice
1 3 2
3 Alice
3 2 1
3 Bob
2 1 3
3 Bob
1 3 2
3 Alice
2 1 3
3 Alice
2 3 1
3 Bob
3 2 1

output:

Bob
Bob
Bob
Alice
Alice
Bob
Bob
Alice
Bob
Alice

result:

wrong answer 1st lines differ - expected: 'Alice', found: 'Bob'