Naxocist

Colliding Encoding

Apr 29th, 2023
743
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.58 KB | Source Code | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. void solve() {
  5.     vector<int> v(30);
  6.     for(int i=0; i<26; ++i) {
  7.         cin >> v[i];
  8.     }
  9.  
  10.     bool ok = 1;
  11.     int k; cin >> k;
  12.     set<string> w;
  13.     while(k--) {
  14.         string s; cin >> s;
  15.         string t;
  16.         for(int i=0; i<s.size(); ++i) {
  17.             t += v[s[i] - 'A'] + '0';
  18.         }
  19.         // cout << s << ' ' << t << endl;
  20.         if(w.find(t) != w.end()) {
  21.             ok = 0;
  22.         }
  23.         w.insert(t);
  24.     }
  25.     if(!ok) cout << "YES\n";
  26.     else
  27.     cout << "NO\n";
  28. }
  29.  
  30. int main() {
  31.     int q; cin >> q;
  32.     for(int i=1; i<=q; ++i) {
  33.         cout << "Case #" << i << ": ";
  34.         solve();
  35.     }
  36.     return 0;
  37. }
Advertisement
Add Comment
Please, Sign In to add comment