Submission #70070647

---

Source Code Expand

  //#include "atcoder/modint"
  #pragma GCC optimize("Ofast")
  #include "atcoder/all"
  #include <bits/stdc++.h>
  #include  <string>
  using namespace std;
  using namespace atcoder;
  #define int long long
    template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
  template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
  //const int MOD =1e9+7;
  //constexpr int MOD =10;
  constexpr int MOD =998244353;
  const long long M1=167772161,M2=469762049,M3=1224736769;
  //const int MOD =31607;
  using mint = static_modint<MOD>;
  //using mint = double;
  //using mint = modint;
  ostream& operator << (ostream& ost, const mint& m){ost << m.val();return ost;}
  istream& operator >> (istream& ost,  mint& m){int a;ost >> a;m=a;return ost;}
  double time_limit = 100.0,start_temp=0.01,end_temp=0.0;
  std::mt19937 rng(std::random_device{}()); 
  unordered_map<int,int>mp;
  int solve(){
    int n,m,k;
    cin>>n>>m>>k;
    string s;
    cin>>s;
    vector<int>hen[n];
    for(int i=0;i<m;i++){
      int u,v;
      cin>>u>>v;u--,v--;
      hen[u].push_back(v);
    }
    for(int i=0;i<2*k;i++){
      string t;
      for(int j=0;j<n;j++){
        char c='B';
        for(auto p:hen[j])if(s[p]=='B')c='A';
        t.push_back(c);
      }
      s=t;
    }

      if(s[0]=='A')cout<<"Alice"<<endl;
      else cout<<"Bob"<<endl;
  
    return 0;

  }
  signed main(){
    //ios_base::sync_with_stdio(false);
    //cin.tie(NULL);
    int t;
    cin>>t;
    for(int i=0;i<t;i++)solve();
  }
    

    


  
 
   

Submission Info

Judge Result