結果

問題 No.380 悪の台本
ユーザー uwiuwi
提出日時 2016-06-19 17:46:55
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,921 bytes
コンパイル時間 4,086 ms
コンパイル使用メモリ 84,172 KB
実行使用メモリ 45,376 KB
最終ジャッジ日時 2024-11-06 22:59:15
合計ジャッジ時間 6,252 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 62 ms
37,656 KB
testcase_01 WA -
testcase_02 AC 66 ms
37,476 KB
testcase_03 AC 63 ms
37,352 KB
testcase_04 AC 247 ms
44,840 KB
testcase_05 AC 317 ms
45,376 KB
testcase_06 AC 253 ms
45,260 KB
testcase_07 WA -
testcase_08 AC 115 ms
39,216 KB
testcase_09 AC 238 ms
44,440 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package q3xx;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Q380_L {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		String C = "CORRECT (maybe)";
		String W = "WRONG!";
		while(!eof()){
			String line = ns();
			if(line.indexOf(' ') == -1){
				out.println(W);
				continue;
			}
			String[] sp = line.split(" ", 2);
			String se = sp[1].toLowerCase();
			if(sp[0].equals("digi")){
				out.println(se.matches("^.*nyo([^A-Za-z0-9]{1,3})?$") ? C : W);
			}else if(sp[0].equals("petit")){
				out.println(se.matches("^.*nyu([^A-Za-z0-9]{1,3})?$") ? C : W);
			}else if(sp[0].equals("rabi")){
				out.println(se.matches("^.*[A-Za-z0-9].*$") ? C : W);
			}else if(sp[0].equals("gema")){
				out.println(se.matches("^.*gema([^A-Za-z0-9]{1,3})?$") ? C : W);
			}else if(sp[0].equals("piyo")){
				out.println(se.matches("^.*pyo([^A-Za-z0-9]{1,3})?$") ? C : W);
			}else{
				out.println(W);
			}
		}
	}
	
	private boolean eof()
	{
		if(lenbuf == -1)return true;
		int lptr = ptrbuf;
		while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
		
		try {
			is.mark(1000);
			while(true){
				int b = is.read();
				if(b == -1){
					is.reset();
					return true;
				}else if(!isSpaceChar(b)){
					is.reset();
					return false;
				}
			}
		} catch (IOException e) {
			return true;
		}
	}
	
	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");
	}
	
	public static void main(String[] args) throws Exception { new Q380_L().run(); }
	
	private byte[] inbuf = new byte[1024];
	private 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) && 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 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[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, 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 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