結果

問題 No.232 めぐるはめぐる (2)
ユーザー ぴろずぴろず
提出日時 2015-06-26 22:45:11
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,742 bytes
コンパイル時間 2,906 ms
コンパイル使用メモリ 74,712 KB
実行使用メモリ 54,236 KB
最終ジャッジ日時 2023-09-22 00:54:07
合計ジャッジ時間 6,869 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 121 ms
52,712 KB
testcase_01 AC 143 ms
53,608 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 AC 40 ms
49,292 KB
testcase_05 AC 39 ms
49,304 KB
testcase_06 AC 39 ms
49,320 KB
testcase_07 AC 38 ms
49,180 KB
testcase_08 WA -
testcase_09 AC 39 ms
49,328 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 39 ms
49,404 KB
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 39 ms
49,332 KB
testcase_17 AC 39 ms
49,724 KB
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 AC 40 ms
49,292 KB
testcase_22 AC 40 ms
49,360 KB
testcase_23 AC 39 ms
49,260 KB
testcase_24 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no232;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {
	static IO sc = new IO();
	public static void main(String[] args) {
		int t = sc.nextInt();
		int a = sc.nextInt();
		int b = sc.nextInt();
		int dist = Math.max(a, b);
		if (t == 1 && dist != 1 || t > 1 && dist > t) {
			sc.println("NO");
			sc.flush();
			return;
		}
		sc.println("YES");
		int x = 0;
		int y = 0;
		int aa,bb;
		if (a == 0 && b == 0) {
			aa = 1;
			bb = 0;
		}else{
			aa = Math.max(a-1, 0);
			bb = Math.max(b-1, 0);
		}
		while(x != aa || y != bb) {
			if (x < aa) {
				x++;
				sc.print(">");
			}
			if (y < bb) {
				y++;
				sc.print("^");
			}
			sc.println();
			t--;
		}
		while(t >= 3) {
			sc.println(">");
			sc.println("<");
			t-=2;
		}
		if (t == 2) {
			if (x < a && y < b) {
				sc.println(">");
				x++;
			}else if(x < a) {
				sc.println("v");
				y--;
			}else{
				sc.println("<");
				x--;
			}
			t--;
		}
		if (t == 1) {
			if (x > a) {
				sc.print("<");
				x--;
			}
			if (x < a) {
				sc.print(">");
				x++;
			}
			if (y < b) {
				sc.print("^");
				y++;
			}
			sc.println();
		}
		sc.flush();
	}

}
class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	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;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(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 char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(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 char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(next());}
	public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
	public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
	public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}
0