Advertisement
SorahISA

B. BanG Dream! It's MyGO!!!!!

Sep 25th, 2024
38
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.21 KB | Source Code | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. using u64 = uint64_t;
  5. using pii = pair<int, int>;
  6.  
  7. int main() {
  8.     ios_base::sync_with_stdio(0), cin.tie(0);
  9.    
  10.     int N, M; cin >> N >> M;
  11.    
  12.     vector<pii> edges(M);
  13.     for (auto &[u, v] : edges) cin >> u >> v, --u, --v;
  14.     sort(begin(edges), end(edges));
  15.    
  16.     int Q; cin >> Q;
  17.    
  18.     vector<pii> queries(Q);
  19.     for (auto &[a, b] : queries) cin >> a >> b, --a, --b;
  20.    
  21.     string ans(Q, '?');
  22.    
  23.     vector<u64> dp(N, 0);
  24.     for (int offset = 0; offset < Q; offset += 32) {
  25.         for (int i = 0; i < 32 and i + offset < Q; ++i) {
  26.             auto [a, b] = queries[i + offset];
  27.             dp[a] |= u64(1) << i;
  28.             dp[b] |= u64(1) << (i+32);
  29.         }
  30.         for (auto [u, v] : edges) dp[v] |= dp[u];
  31.        
  32.         u64 val = 0;
  33.         for (int i = 0; i < N; ++i) {
  34.             // cerr << i << ": " << bitset<64>(dp[i]) << "\n";
  35.             val |= dp[i] & (dp[i] >> 32);
  36.             dp[i] = 0; /// reset dp[] here
  37.         }
  38.        
  39.         for (int i = 0; i < 32 and i+offset < Q; ++i) {
  40.             ans[i + offset] = "NY"s[val >> i & 1];
  41.         }
  42.     }
  43.    
  44.     cout << ans << "\n";
  45.    
  46.     return 0;
  47. }
  48.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement