結果

問題 No.996 Phnom Penh
ユーザー kotamanegi
提出日時 2020-02-21 22:48:30
言語 C++17(clang)
(17.0.6 + boost 1.87.0)
結果
AC  
実行時間 3 ms / 2,000 ms
コード長 2,638 bytes
コンパイル時間 1,824 ms
コンパイル使用メモリ 163,644 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-30 16:31:32
合計ジャッジ時間 2,675 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 25
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp:3:18: warning: '#pragma comment linker' ignored [-Wignored-pragmas]
    3 | #pragma comment (linker, "/STACK:526000000")
      |                  ^
1 warning generated.

ソースコード

diff # 

#define  _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#pragma comment (linker, "/STACK:526000000")

using namespace std;
typedef string::const_iterator State;
#define eps 1e-11L
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL

#define MOD 998244353LL
#define seg_size 262144*2LL
#define pb push_back
#define mp make_pair
typedef long long ll;
#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))
#define ALL(x) (x).begin(),(x).end()

unsigned long xor128() {
	static unsigned long x = 123456789, y = 362436069, z = 521288629, w = time(NULL);
	unsigned long t = (x ^ (x << 11));
	x = y; y = z; z = w;
	return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}

void init() {
	iostream::sync_with_stdio(false);
	cout << fixed << setprecision(10);
}

#define int ll
void solve() {
	string s;
	cin >> s;
	int ans = 0;
	int cnt = 0;
	REP(i, s.length()) {
		if (s[i] == 'e') {
			cnt = 2;
		}
		else if (s[i] == 'h') {
			cnt = max(cnt, 1LL);
		}
	}
	int now_place = 0;
	while (true) {
		if (now_place + 2 >= s.length()) break;
		if (s[now_place] == 'p' && s[now_place+1] == 'h' && s[now_place+2] == 'n') {
			now_place += 3;
			int cnter = 0;
			int tele = 0;
			while (true) {
				if (now_place >= s.length()) break;
				if (tele == 0) {
					if (s[now_place] == 'o') {
						tele = 1;
						now_place++;
						continue;
					}
				}
				else {
					if (s[now_place] == 'm') {
						tele = 0;
						cnter++;
						now_place++;
						continue;
					}
				}
				if ((cnter <= 0 || s[now_place] != 'h') && (cnter <= 1 || s[now_place] != 'e'))break;
				now_place++;
			}
			cnt = max(cnt, cnter + 1LL);
			ans += cnter;
		}
		else if (s[now_place] == 'p') {
			int doit = 0;
			int now_time = 0;
			now_place++;
			while (true) {
				if (now_place >= s.length()) break;
				if (s[now_place] == 'n') {
					if (now_time == 1) {
						doit = 1;
					}
					now_place++;
					break;
				}
				else if (s[now_place] == 'e') {
					now_time++;
				}
				else if (s[now_place] != 'h') {
					break;
				}
				now_place++;
			}
			if (doit == 0) continue;
			int cnter = 1;
			int tele = 0;
			while (true) {
				if (now_place >= s.length()) break;
				if (tele == 0) {
					if (s[now_place] == 'o') {
						tele = 1;
						now_place++;
						continue;
					}
				}
				else {
					if (s[now_place] == 'm') {
						tele = 0;
						cnter++;
						now_place++;
						continue;
					}
				}
				 if (s[now_place] != 'h' && (cnter <= 1||s[now_place] != 'e'))break;
				now_place++;
			}
			cnt = max(cnt, cnter + 1LL);
			ans += cnter - 1;
		}
		else {
			now_place++;
		}
	}
	cout << ans + cnt << endl;
}
#undef int

int main() {
	init();
	solve();
}
0