結果

問題 No.154 市バス
ユーザー t8m8⛄️t8m8⛄️
提出日時 2015-03-30 21:38:16
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,671 bytes
コンパイル時間 3,793 ms
コンパイル使用メモリ 78,296 KB
実行使用メモリ 54,804 KB
最終ジャッジ日時 2024-10-13 07:16:02
合計ジャッジ時間 7,077 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 433 ms
43,324 KB
testcase_01 AC 439 ms
42,896 KB
testcase_02 AC 447 ms
43,268 KB
testcase_03 AC 241 ms
43,452 KB
testcase_04 WA -
testcase_05 AC 47 ms
36,880 KB
testcase_06 AC 45 ms
36,920 KB
testcase_07 AC 576 ms
43,084 KB
testcase_08 AC 50 ms
36,676 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//No.154 市バス

import java.util.*;
import java.io.*;
import static java.util.Arrays.*;
import static java.lang.Math.*;

public class No154 {

    static final InputStream in = System.in;
    static final PrintWriter out = new PrintWriter(System.out,false);

    static void solve(){
        int t = nextInt();
        while (t-- > 0) {
            char[] cs = next().toCharArray();
            out.println((check(cs) && check2(cs)) ? "possible" : "impossible");
        }
    }

    static boolean check(char[] cs) {
        int n = cs.length;
        int[] wgr = new int[3];
        for (int i=0; i<n; i++) {
            wgr[cs[i]=='W'?0:(cs[i]=='G'?1:2)]++;
        }
        if (wgr[1] != wgr[2] || wgr[0] < wgr[1]) return false;
        return true;
    }

    static boolean check2(char[] cs) {
        int n = cs.length;
        boolean[] wgr = new boolean[3];
        int cnt = 0;
        for (int i=n-1; i>=0; i--) {
            if (cs[i] == 'X') {cnt++; continue;}
            if (cs[i] == 'R') {
                if (!wgr[2]) {
                    wgr[2] = true;
                    cs[i] = 'X';
                }
            }else {
                if (!wgr[2]) return false;
                if (cs[i] == 'G') {
                    if (!wgr[1]) {
                       wgr[1] = true;
                        cs[i] = 'X'; 
                    }
                }else {
                    if (!wgr[1] || !wgr[1]) return false;
                    wgr[0] = true;
                    cs[i] = 'X';
                }
            }
        }
        if (cnt == n) return true;
        if ((!wgr[0] || !wgr[1] || !wgr[2]) && cnt == 0) return false;
        return check2(cs);
    }

    public static void main(String[] args) throws Exception {
        long start = System.currentTimeMillis();

        solve();
        out.flush();

        long end = System.currentTimeMillis();
        //trace(end-start + "ms");
        in.close();
    }

    static void trace(Object... o) { System.out.println(deepToString(o));}

    static final byte[] buf = new byte[1024];
    static int ptr = 0;
    static int buflen = 0;

    static boolean hasNextByte() {
        if (ptr < buflen)
            return true;
        ptr = 0;
        try{
            buflen = in.read(buf);
        }catch (IOException e) {e.printStackTrace();}
        if (buflen <= 0)
            return false;
        return true;
    }

    static int readByte() { if (hasNextByte()) return buf[ptr++]; else return -1;}

    static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}

    static void skip() { while(hasNextByte() && !isPrintableChar(buf[ptr])) ptr++;}

    static boolean hasNext() {skip(); return hasNextByte();}

    static String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    static long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        boolean minus = false;
        long num = readByte();

        if(num == '-'){
            num = 0;
            minus = true;
        }else if (num < '0' || '9' < num){
            throw new NumberFormatException();
        }else{
            num -= '0';
        }
        
        while(true){
            int b = readByte();
            if('0' <= b && b <= '9')
                num = num * 10 + (b - '0');
            else if(b == -1 || !isPrintableChar(b))
                return minus ? -num : num;
            else
                throw new NoSuchElementException();
        }
    }

    static int nextInt() {
        long num = nextLong();
        if (num < Integer.MIN_VALUE || Integer.MAX_VALUE < num)
            throw new NumberFormatException();
        return (int)num;
    }

    static double nextDouble() {
        return Double.parseDouble(next());
    }

    static char nextChar() {
        if (!hasNext()) throw new NoSuchElementException();
        return (char)readByte();
    }

    static String nextLine() {
        while (hasNextByte() && (buf[ptr] == '\n' || buf[ptr] == '\r')) ptr++;
        if (!hasNextByte()) throw new NoSuchElementException();

        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (b != '\n' && b != '\r') {
            sb.appendCodePoint(b);
            b = readByte();
        }

        return sb.toString();
    }

    static int[] nextArrayInt(int n) {
        int[] a = new int[n];
        for (int i=0; i<n; i++) a[i] = nextInt();
        return a;
    }
}
0