結果

問題 No.996 Phnom Penh
ユーザー uwiuwi
提出日時 2020-02-21 22:01:34
言語 Java
(openjdk 23)
結果
AC  
実行時間 215 ms / 2,000 ms
コード長 5,512 bytes
コンパイル時間 5,441 ms
コンパイル使用メモリ 90,312 KB
実行使用メモリ 45,020 KB
最終ジャッジ日時 2024-10-08 21:43:22
合計ジャッジ時間 9,330 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 25
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200221;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.List;

public class D {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		String S = ns();
		long ans = 0;
		{
			int n = S.length();
			StringBuilder sb = new StringBuilder();
			for(int i = 0;i < n;i++) {
				if(S.charAt(i) == 'h')continue;
				if(S.charAt(i) == 'e') {
					sb.append("h");
					continue;
				}
				if(i+5 <= n && S.substring(i, i+5).equals("phnom")) {
					sb.append("phn");
					ans++;
					i += 4;
				}else {
					sb.append(S.charAt(i));
				}
			}
			String S1 = sb.toString();
			if(S.equals(S1)) {
				out.println(ans);
				return;
			}
			ans++;
			S = S1;
		}
		{
			int n = S.length();
			StringBuilder sb = new StringBuilder();
			for(int i = 0;i < n;i++) {
				if(S.charAt(i) == 'h')continue;
				if(S.charAt(i) == 'e') {
					sb.append("h");
					continue;
				}
				if(i+5 <= n && S.substring(i, i+5).equals("phnom")) {
					sb.append("phn");
					ans++;
					i += 4;
				}else {
					sb.append(S.charAt(i));
				}
			}
			String S1 = sb.toString();
			if(S.equals(S1)) {
				out.println(ans);
				return;
			}
			ans++;
			S = S1;
		}
		
		char[] s = S.toCharArray();
		int st = 0;
		int n = s.length;
		List<Integer> oms = new ArrayList<>();
		int om = -1;
		for(int i = 0;i < n;i++) {
			if(s[i] == 'p') {
				if(om >= 0) {
					oms.add(om);
					om = -1;
				}
				st = 1;
			}else if(st == 1 && s[i] == 'h') {
				st = 2;
			}else if(st == 2 && s[i] == 'n') {
				if(om == -1)om = 0;
				st = 3;
			}else if(st == 3 && s[i] == 'o') {
				st = 4;
			}else if(st == 4 && s[i] == 'm') {
				om++;
				st = 3;
			}else {
				if(om >= 0) {
					oms.add(om);
					om = -1;
				}
				st = 0;
			}
		}
		if(om >= 0) {
			oms.add(om);
			om = -1;
		}
		List<Integer> oms2 = new ArrayList<>();
		st = 0;
		om = -1;
		for(int i = 0;i < n;i++) {
			if(s[i] == 'p') {
				if(om >= 0) {
					oms2.add(om);
					om = -1;
				}
				st = 1;
			}else if(st == 1 && s[i] == 'e') {
				st = 2;
			}else if(st == 2 && s[i] == 'n') {
				st = 3;
			}else if(st == 3 && s[i] == 'h') {
				if(om == -1)om = 0;
				st = 4;
			}else if(st == 4 && s[i] == 'o') {
				st = 5;
			}else if(st == 5 && s[i] == 'm') {
				om++;
				st = 4;
			}else {
				if(om >= 0) {
					oms2.add(om);
					om = -1;
				}
				st = 0;
			}
		}
		if(om >= 0) {
			oms2.add(om);
			om = -1;
		}
//		tr(oms, oms2);
		for(int v : oms)ans += v;
		for(int v : oms2)ans += v;
		int max = 0;
		for(int v : oms) {
			max = Math.max(max, v+1);
		}
		for(int v : oms2) {
			max = Math.max(max, v+2);
		}
		ans += max;
		out.println(ans);
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new D().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0