fork download
copy 
  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. // 3
  28. // 3
  29. // abc ade abc
  30. // 3
  31. // abc ade bbc
  32. // 5
  33. // aabc aade aabca abc acd
  34.  
  35.  
  36.  
  37. vector<string> a;
  38.  
  39. vector<int> consistency(int n){
  40.  
  41. 	unordered_map<int, unordered_map<char,int> > mp;
  42. 	vector<int> ans(n);
  43.  
  44. 	for(int i=n-1; i>=0; i--){
  45. 		string word = a[i];
  46.  
  47. 		for(int j=0; j<word.size(); j++){
  48. 			char ch = word[j];
  49.  
  50. 			ans[i] += mp[j][ch];
  51. 			mp[j][ch]++;
  52. 		}
  53.  
  54. 	}
  55.  
  56. 	return ans;
  57. }
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73. vector<int> practice(int n){
  74.  
  75.  
  76.  
  77. }
  78.  
  79.  
  80.  
  81.  
  82.  
  83. void solve() {
  84.  
  85.     int n;
  86.     cin>> n;
  87.  
  88.     a.resize(n);
  89.     for(int i=0; i<n; i++) cin >> a[i];
  90.  
  91.     auto ans = consistency(n);
  92.  
  93.     for(auto& t : ans) cout << t << " "; cout << endl;
  94.  
  95.  
  96. }
  97.  
  98.  
  99.  
  100.  
  101.  
  102. int32_t main() {
  103.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  104.  
  105.     int t = 1;
  106.     cin >> t;
  107.     while (t--) {
  108.         solve();
  109.     }
  110.  
  111.     return 0;
  112. }
Success #stdin #stdout 0s 5320KB
comments (?)
stdin
copy 
3
3
abc ade abc
3
abc ade bbc
5
aabc aade aabca abc acd
stdout
copy 
4 1 0 
3 0 0 
8 5 2 1 0
https://ideone.com/AIHavU
language:
C++14 (gcc 8.3)
created:
6 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!