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.  
  28.  
  29.  
  30. vector<vector<int>> q;
  31.  
  32. vector<int> consistency(string a, int n, int m){
  33.  
  34.     vector<vector<bool>> dp(n, vector<bool>(n, false));
  35.     vector<vector<int>> dpCt(n, vector<int>(n, 0));
  36.  
  37.     for(int gap=0; gap<n; gap++){
  38.     	for(int i=0, j=gap; j<n; i++,j++){
  39.     		if(gap == 0){
  40.     			dp[i][j] = true;
  41.     			dpCt[i][j] = 1;
  42.     		}
  43.     		else if(gap == 1){
  44.     			if(a[i] == a[j]){
  45.     				dp[i][j] = true;
  46.     				dpCt[i][j] = 3;
  47.     			}
  48.     			else{
  49.     				dpCt[i][j] = 2;
  50.     			}
  51.     		}
  52.     		else{
  53.     			dpCt[i][j] = dpCt[i][j-1] + dpCt[i+1][j] - dpCt[i+1][j-1];
  54.  
  55.     			if(a[i] == a[j] && dp[i+1][j-1] ){
  56.     				dp[i][j] = true;
  57.     				dpCt[i][j]++;
  58.     			}
  59.     		}
  60.     	}
  61.     }
  62.  
  63.     vector<int> ans;
  64. 	for(auto& x : q){
  65. 		int i = x[0]-1; //* 1 based indexing
  66. 		int j = x[1]-1;
  67.  
  68. 		ans.push_back(dpCt[i][j]);
  69. 	}
  70.  
  71. 	return ans;
  72. }
  73.  
  74.  
  75.  
  76.  
  77.  
  78.  
  79.  
  80.  
  81.  
  82.  
  83.  
  84.  
  85.  
  86.  
  87.  
  88. vector<int> practice(string a, int n, int m){
  89.  
  90. 	return {};
  91. }
  92.  
  93.  
  94.  
  95.  
  96.  
  97. void solve() {
  98.  
  99.  
  100.     string a;
  101.     cin >> a;
  102.     int n = a.size();
  103.  
  104.     int m;
  105.     cin >> m;
  106.     q.resize(m);
  107.     for(int i=0; i<m; i++){
  108.     	int x, y;
  109.     	cin >> x >> y;
  110.     	q[i] = {x, y};
  111.     }
  112.  
  113.     auto ans = consistency(a, n, m);
  114.  
  115.     for(auto t : ans) cout << t << " "; cout << endl;
  116.  
  117.  
  118. }
  119.  
  120.  
  121.  
  122.  
  123.  
  124. int32_t main() {
  125.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  126.  
  127.     int t = 1;
  128.     // cin >> t;
  129.     while (t--) {
  130.         solve();
  131.     }
  132.  
  133.     return 0;
  134. }
Success #stdin #stdout 0s 5320KB
comments (?)
stdin
copy 
pcbcqqcbcpsfdf
1
1 10
stdout
copy 
17
https://ideone.com/tKAH8D
language:
C++14 (gcc 8.3)
created:
1 day 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!