結果

問題 No.154 市バス
ユーザー uwiuwi
提出日時 2015-02-18 00:03:12
言語 Java21
(openjdk 21)
結果
AC  
実行時間 463 ms / 2,000 ms
コード長 4,415 bytes
コンパイル時間 3,451 ms
コンパイル使用メモリ 81,732 KB
実行使用メモリ 47,224 KB
最終ジャッジ日時 2024-04-21 07:46:52
合計ジャッジ時間 6,514 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 372 ms
46,292 KB
testcase_01 AC 282 ms
46,296 KB
testcase_02 AC 271 ms
45,744 KB
testcase_03 AC 264 ms
46,304 KB
testcase_04 AC 384 ms
47,224 KB
testcase_05 AC 67 ms
37,772 KB
testcase_06 AC 72 ms
37,672 KB
testcase_07 AC 463 ms
44,924 KB
testcase_08 AC 60 ms
37,704 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package q1xx;
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 Q372 {
	static InputStream is;
	static PrintWriter out;
	static String INPUT = "";
	
	static void solve()
	{
		String imp = "impossible";
		String p = "possible";
		outer:
		for(int T = ni();T >= 1;T--){
			char[] s = ns().toCharArray();
			int w = 0, g = 0, r = 0;
			for(char c : s){
				if(c == 'W'){
					w++;
				}else if(c == 'G'){
					g++;
				}else if(c == 'R'){
					r++;
				}else{
					out.println(imp);
					continue outer;
				}
			}
			if(w >= g && g == r){
			}else{
				out.println(imp); continue outer;
			}
			
			boolean[] used = new boolean[s.length];
			inner:
			for(int i = s.length-1;i >= 0;i--){
				if(!used[i] && s[i] == 'R'){
					used[i] = true;
					for(int j = i-1;j >= 0;j--){
						if(!used[j] && s[j] == 'G'){
							used[j] = true;
							for(int k = j-1;k >= 0;k--){
								if(!used[k] && s[k] == 'W'){
									used[k] = true;
									continue inner;
								}
							}
							out.println(imp); continue outer;
						}
					}
					out.println(imp); continue outer;
				}
			}
			
			boolean hasg = false;
			for(int i = s.length-1;i >= 0;i--){
				if(s[i] == 'G')hasg = true;
				if(!used[i] && s[i] == 'W'){
					if(hasg){
						break;
					}else{
						out.println(imp); continue outer;
					}
				}
			}
			out.println(p);
		}
	}
	
	public static void main(String[] args) throws Exception
	{
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G-S+"ms");
	}
	
	private static 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;
		}
	}
	
	private static byte[] inbuf = new byte[1024];
	static int lenbuf = 0, ptrbuf = 0;
	
	private static 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 static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private static double nd() { return Double.parseDouble(ns()); }
	private static char nc() { return (char)skip(); }
	
	private static 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 static 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 static 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 static int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private static 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 static 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) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
0