#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define endl '\n'
void GordenGhost();
signed main(){
ios::sync_with_stdio(false);
cin.tie(nullptr),cout.tie(nullptr);
int t;
cin>>t;
while(t--)
GordenGhost();
return 0;
}
void GordenGhost(){
int n;
cin>>n;
vector<ll>w(n+1);
for(int i=1;i<=n;i++) cin>>w[i];
ll k;
cin>>k;
ll res=w[k],j=min(n*1ll,k+1),i=max(k-1,1ll);
int f=1;
while(1){
if(j<=n&&w[j]<res){
res+=w[j];
j++;
continue;
}
if (i>=1&&w[i]<res){
res+=w[i];
i--;
continue;
}
if (j>=n&&i<=1)break;
f=0;
break;
}
if (f) cout<<"A perfect meal\n";
else cout<<"An inevitable process\n";
}
永恒的盛宴(2023年安徽大学第十五届程序设计竞赛)
最新推荐文章于 2024-07-15 22:10:26 发布