fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<string> a;
  31.  
  32. vector<int> consistency(int n){
  33.  
  34. unordered_map<int, unordered_map<char,int> > mp;
  35. vector<int> ans(n);
  36.  
  37. for(int i=n-1; i>=0; i--){
  38. string word = a[i];
  39.  
  40. for(int j=0; j<word.size(); j++){
  41. char ch = word[j];
  42.  
  43. ans[i] += mp[j][ch];
  44. mp[j][ch]++;
  45. }
  46.  
  47. }
  48.  
  49. return ans;
  50. }
  51.  
  52.  
  53.  
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66. vector<int> practice(int n){
  67.  
  68.  
  69.  
  70. }
  71.  
  72.  
  73.  
  74.  
  75.  
  76. void solve() {
  77.  
  78. int n;
  79. cin>> n;
  80.  
  81. a.resize(n);
  82. for(int i=0; i<n; i++) cin >> a[i];
  83.  
  84. auto ans = consistency(n);
  85.  
  86. for(auto& t : ans) cout << t << " "; cout << endl;
  87.  
  88.  
  89. }
  90.  
  91.  
  92.  
  93.  
  94.  
  95. int32_t main() {
  96. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  97.  
  98. int t = 1;
  99. cin >> t;
  100. while (t--) {
  101. solve();
  102. }
  103.  
  104. return 0;
  105. }
Success #stdin #stdout 0s 5312KB
stdin
3
3
abc ade abc
3
abc ade bbc
5
aabc aade aabca abc acd
stdout
4 1 0 
3 0 0 
8 5 2 1 0