結果

問題 No.464 PPAP
ユーザー satanic
提出日時 2016-12-15 22:43:07
言語 C++14
(gcc 8.3.0)
結果
AC  
実行時間 792 ms
コード長 5,566 Byte
コンパイル時間 1,023 ms
使用メモリ 115,344 KB
最終ジャッジ日時 2019-12-04 14:04:58

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
00_sample1 AC 4 ms
1,524 KB
00_sample2 AC 4 ms
1,536 KB
00_sample3 AC 3 ms
1,540 KB
00_sample4 AC 4 ms
1,532 KB
01_small1 AC 4 ms
1,608 KB
01_small2 AC 3 ms
1,564 KB
01_small3 AC 3 ms
1,536 KB
02_medium1 AC 19 ms
6,872 KB
02_medium2 AC 11 ms
5,256 KB
02_medium3 AC 4 ms
1,596 KB
03_large1 AC 792 ms
115,344 KB
03_large2 AC 58 ms
22,684 KB
03_large3 AC 103 ms
35,884 KB
03_large4 AC 5 ms
1,824 KB
03_large5 AC 298 ms
77,596 KB
04_hand1 AC 4 ms
1,548 KB
04_hand2 AC 3 ms
1,544 KB
04_hand3 AC 4 ms
1,548 KB
04_hand4 AC 4 ms
1,544 KB
10_random_small1 AC 3 ms
1,544 KB
10_random_small2 AC 4 ms
1,544 KB
10_random_small3 AC 4 ms
1,544 KB
10_random_small4 AC 3 ms
1,544 KB
11_random_large1 AC 4 ms
1,824 KB
11_random_large2 AC 5 ms
1,828 KB
11_random_large3 AC 6 ms
1,828 KB
テストケース一括ダウンロード

ソースコード

diff #
// need
#include <iostream>
#include <algorithm>

// data structure
#include <bitset>
//#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <array>
//#include <tuple>
#include <unordered_map>
#include <unordered_set>
//#include <complex>
//#include <deque>

// stream
//#include <istream>
//#include <sstream>
//#include <ostream>

// etc
#include <cassert>
#include <functional>
#include <iomanip>
//#include <typeinfo>
#include <chrono>
#include <random>
#include <cfenv>

#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define OUT(d) std::cout<<d;
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;
#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;
#define ALL(a) (a).begin(),(a).end()
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=(n)-1;i>=0;--i)
#define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)
#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)
#define REPLL(i, n) for(ll i=0;i<ll(n);++i)
#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)
#define PAIR std::pair<int, int>
#define PAIRLL std::pair<ll, ll>
#define IN(a, x, b) (a<=x && x<b)
#define SHOW(d) {std::cerr << #d << "\t:" << d << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWPAIR(p) {std::cerr << #p << "\t:(" << p.first << ",\t" << p.second << ")\n";}
#define SHOWPAIRVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr<<'('<<yyy.first<<", "<<yyy.second<<") ";}std::cerr << "\n";}}
#define SHOWPAIRVECTOR(v) {for(const auto& xxx:v){std::cerr<<'('<<xxx.first<<", "<<xxx.second<<") ";}std::cerr<<"\n";}
#define SHOWQUEUE(a) {std::queue<decltype(a.front())> tmp(a);std::cerr << #a << "\t:";for(int i=0; i<static_cast<int>(a.size()); ++i){std::cerr << tmp.front() << "\n";tmp.pop();}std::cerr << "\n";}
template<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }
template<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}
void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns  (" << res / (1.0e9) << "s)]\n"; }

#define int ll
using ll = long long;
using ull = unsigned long long;
constexpr int INFINT = 1 << 30;                          // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1;              // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60;                          // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);  // 9.22x10^19
constexpr double EPS = 1e-7;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;

signed main() {
	INIT;
	VAR(std::string, s);
	int n = s.size();
	std::vector<std::vector<int>> par(n);
	std::vector<int> last(n, 0);
	REP(i, n) {
		REP(j, n) {
			if (!IN(0, i - j, n) || !IN(0, i + j, n)) continue;
			if (s[i - j] == s[i + j]) {
				par[i - j].emplace_back(i + j);
				if (i + j == n - 1) {
					last[i - j] = 1;
				}
			}
			else break;
		}
		REP(j, n) {
			if (!IN(0, i - j, n) || !IN(0, i + j + 1, n)) continue;
			if (s[i - j] == s[i + j + 1]) {
				par[i - j].emplace_back(i + j + 1);
				if (i + j + 1 == n - 1) {
					last[i - j] = 1;
				}
			}
			else break;
		}
	}
	RREP(i, n - 1) {
		last[i] += last[i + 1];
	}
	int ans = 0;
	REP(i, par[0].size()) {
		int p1 = par[0][i] + 1;
		if (!IN(0, p1, n)) continue;
		REP(j, par[p1].size()) {
			int p2 = par[p1][j] + 2;
			if (!IN(0, p2, n)) continue;
			ans += last[p2];
		}
	}
	//SHOWVECTOR2(par);
	//SHOWVECTOR(last);
	OUT(ans)BR;
	return 0;
}
0