結果

問題 No.232 めぐるはめぐる (2)
ユーザー chocorusk
提出日時 2020-10-04 02:25:07
言語 Java
(openjdk 23)
結果
AC  
実行時間 227 ms / 1,000 ms
コード長 3,395 bytes
コンパイル時間 2,751 ms
コンパイル使用メモリ 78,892 KB
実行使用メモリ 43,996 KB
最終ジャッジ日時 2024-09-14 12:49:19
合計ジャッジ時間 7,312 ms
ジャッジサーバーID
（参考情報） 		judge6 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.NoSuchElementException;
import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        //FastScanner scanner=new FastScanner();
        PrintWriter out = new PrintWriter(System.out);
        int t = scanner.nextInt();
        int b = scanner.nextInt();
        int a = scanner.nextInt();
        int d = Math.max(a, b);
        if (d == 0) {
            if (t == 1) {
                out.println("NO");
            } else {
                out.println("YES");
                if (t % 2 == 0) {
                    for (int i = 0; i < t; i++) {
                        if (i % 2 == 0)
                            out.println("^");
                        else
                            out.println("v");
                    }
                } else {
                    out.println("^");
                    out.println(">");
                    out.println("v<");
                    for (int i = 0; i < t - 3; i++) {
                        if (i % 2 == 0)
                            out.println("^");
                        else
                            out.println("v");
                    }
                }
            }
            out.close();
            scanner.close();
            return;
        }
        if (t >= d) {
            out.println("YES");
        } else {
            out.println("NO");
            out.close();
            scanner.close();
            return;
        }
        if ((t - d) % 2 == 1) {
            if (a == 0) {
                a++;
                out.println("<");
            } else if (b == 0) {
                b++;
                out.println("v");
            } else if (a < b) {
                a--;
                out.println(">");
            } else {
                b--;
                out.println("^");
            }
            t--;
        }
        int m = Math.min(a, b);
        for (int i = 0; i < m; i++) {
            out.println("^>");
        }
        for (int i = m; i < d; i++) {
            if (a < b)
                out.println("^");
            else
                out.println(">");
        }
        for (int i = d; i < t; i++) {
            if (i % 2 == 0)
                out.println("^");
            else
                out.println("v");
        }
        out.close();
        scanner.close();
    }
}
class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        } else {
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() {
        if (hasNextByte())
            return buffer[ptr++];
        else
            return -1;
    }
    private static boolean isPrintableChar(int c) {
        return 33 <= c && c <= 126;
    }
    public boolean hasNext() {
        while (hasNextByte() && !isPrintableChar(buffer[ptr]))
            ptr++;
        return hasNextByte();
    }
    public 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();
    }
    public long nextLong() {
        if (!hasNext())
            throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while (true) {
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
            throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDouble() {
        return Double.parseDouble(next());
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0