#138844 (C++11（廃止可能性あり）) No.464 PPAP

• 問題: No.464 PPAP
• ユーザー: FF256grhy
• 提出日時: 2016-12-15 22:50:21
• 言語: C++11（廃止可能性あり） (gcc 13.3.0)
• 結果: AC
• 実行時間: 222 ms / 2,000 ms
• コード長: 2,586 bytes
• コンパイル時間: 1,147 ms
• コンパイル使用メモリ: 158,704 KB
• 実行使用メモリ: 27,520 KB
• 最終ジャッジ日時: 2024-11-30 08:50:54
• 合計ジャッジ時間: 3,483 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

ファイルパターン	結果
sample	AC * 4
other	AC * 22

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
#include <bits/stdc++.h>
using namespace std;
typedef long long   signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define inc( i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec( i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define UB upper_bound
#define LB lower_bound
#define PQ priority_queue
#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(i, v) for(auto i =  v.begin(); i !=  v.end(); ++i)
#define RFOR(i, v) for(auto i = v.rbegin(); i != v.rend(); ++i)
template<typename T> bool setmin(T & a, T b) { if(a <= b) { return false; } else { a = b; return true; } }
template<typename T> bool setmax(T & a, T b) { if(b <= a) { return false; } else { a = b; return true; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<typename T> ostream & operator<<(ostream & os, const vector<T> & v) {
    os << "[";
    FOR(it, v) {
        if(it != v.begin()) { os << ", "; }
        os << *it;
    }
    os << "]";
    return os;
}
template<typename F, typename S> ostream & operator<<(ostream & os, const pair<F, S> & p) {
    os << "<" << p.FI << ", " << p.SE << ">";
    return os;
}
// ---- ----
string s;
LL ans;
bool pd[5000][5000];
LL pp[5000];
/*
bool pd(int l, int r) {
    for(; l < r; l++, r--) {
        if(s[l] != s[r]) { return false; }
    }
    return true;
}
*/
int main() {
    cin >> s;
    
    int len = s.size();
    
    inc(i, len) {
        int l = i, r = i, flag = true;
        while(0 <= l && r < len) {
            if(s[l] != s[r]) { flag = false; }
            pd[l][r] = flag;
            l--; r++;
        }
    }
    inc(i, len) {
        int l = i, r = i + 1, flag = true;
        while(0 <= l && r < len) {
            if(s[l] != s[r]) { flag = false; }
            pd[l][r] = flag;
            l--; r++;
        }
    }
    
    inc(i, len) {
    inc(j, i) {
        if(pd[0][j] && pd[j + 1][i]) { pp[i]++; }
    }
    }
    
    inc(i, len) {
    incID(j, i + 2, len) {
        if(pd[j][len - 1]) { ans += pp[i]; }
    }
    }
    
    /*
    incII(i,     0, len - 4) {
    incII(j, i + 3, len - 1) {
        if(pd[0][i] && pd[j][len - 1]) {
            incII(k, i + 1, j - 2) {
                if(pd[i + 1][k]) { ans++; }
            }
        }
    }
    }
    */
    
    cout << ans << endl;
    
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX