結果

問題 No.232 めぐるはめぐる (2)
ユーザー threepipes_sthreepipes_s
提出日時 2015-06-26 23:08:30
言語 Java21
(openjdk 21)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 3,951 bytes
コンパイル時間 2,702 ms
コンパイル使用メモリ 88,848 KB
実行使用メモリ 51,128 KB
最終ジャッジ日時 2024-07-07 18:23:39
合計ジャッジ時間 7,491 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 468 ms
50,236 KB
testcase_01 AC 505 ms
51,128 KB
testcase_02 AC 453 ms
50,356 KB
testcase_03 AC 459 ms
50,456 KB
testcase_04 AC 42 ms
36,984 KB
testcase_05 AC 42 ms
36,788 KB
testcase_06 AC 46 ms
37,192 KB
testcase_07 AC 41 ms
36,608 KB
testcase_08 AC 404 ms
50,736 KB
testcase_09 AC 42 ms
37,012 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 53 ms
37,576 KB
testcase_13 AC 47 ms
37,228 KB
testcase_14 WA -
testcase_15 AC 48 ms
37,384 KB
testcase_16 AC 46 ms
37,132 KB
testcase_17 AC 46 ms
36,952 KB
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 AC 50 ms
37,472 KB
testcase_22 AC 48 ms
37,180 KB
testcase_23 AC 40 ms
36,916 KB
testcase_24 AC 47 ms
37,176 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.TreeMap;

public class Main {
	public static void main(String[] args) throws NumberFormatException,
	IOException {
		ContestScanner in = new ContestScanner();
		int t = in.nextInt();
		int a = in.nextInt();
		int b = in.nextInt();
		int dist = Math.max(a, b);
		if(t < dist){
			System.out.println("NO");
			return;
		}
		int x = 0;
		int y = 0;
		if(a == 0 && b == 0){
			t--;
			y--;
			x--;
			dist = 1;
			if(t==0){
				System.out.println("NO");
				return;
			}else{
				System.out.println("YES");
				System.out.println("v<");
			}
		}else
			System.out.println("YES");
		String[] sp1 = {">", "<"};
		String[] sp2 = {"^", "v"};
		for(int i=0; i<dist-1; i++){
			int dy = a-y;
			int dx = b-x;
			String cmd = "";
			if(dy > 0){
				cmd += "^";
				y++;
			}
			if(dx > 0){
				cmd += ">";
				x++;
			}
			System.out.println(cmd);
		}
		boolean isUD = false;
		if(a-y == 0) isUD = true;
		for(int i=0; i<t-(dist); i++){
			if(isUD){
				System.out.println(sp2[i%2]);
				if(i%2 == 0){
					y++;
				}else y--;
				continue;
			}
			System.out.println(sp1[i%2]);
			if(i%2 == 0){
				x++;
			}else x--;
		}
		int dy = a-y;
		int dx = b-x;
		String cmd = "";
		if(dy > 0){
			cmd += "^";
		}
		if(dx > 0){
			cmd += ">";
		}
		System.out.println(cmd);
	}
}

class A implements Comparable<A>{
	int id;
	int a;
	A(int id, int a){
		this.id = id;
		this.a = a;
	}
	@Override
	public int compareTo(A o) {
		return o.a - a;
	}
}

class Timer{
	long time;
	public void set(){
		time = System.currentTimeMillis();
	}
	
	public long stop(){
		return System.currentTimeMillis()-time;
	}
}

class Node{
	int id;
	ArrayList<Node> edge = new ArrayList<Node>();
	public Node(int id) {
		this.id = id;
	}
	public void createEdge(Node node) {
		edge.add(node);
	}
}

class MyComp implements Comparator<int[]> {
	final int idx;
	public MyComp(int idx){
		this.idx = idx;
	}
	public int compare(int[] a, int[] b) {
		return a[idx] - b[idx];
	}
}

class Reverse implements Comparator<Integer> {
	public int compare(Integer arg0, Integer arg1) {
		return arg1 - arg0;
	}
}


class ContestWriter {
	private PrintWriter out;

	public ContestWriter(String filename) throws IOException {
		out = new PrintWriter(new BufferedWriter(new FileWriter(filename)));
	}

	public ContestWriter() throws IOException {
		out = new PrintWriter(System.out);
	}

	public void println(String str) {
		out.println(str);
	}
	
	public void println(Object obj) {
		out.println(obj);
	}

	public void print(String str) {
		out.print(str);
	}
	
	public void print(Object obj) {
		out.print(obj);
	}

	public void close() {
		out.close();
	}
}

class ContestScanner {
	private BufferedReader reader;
	private String[] line;
	private int idx;

	public ContestScanner() throws FileNotFoundException {
		reader = new BufferedReader(new InputStreamReader(System.in));
	}

	public ContestScanner(String filename) throws FileNotFoundException {
		reader = new BufferedReader(new InputStreamReader(new FileInputStream(
				filename)));
	}

	public String nextToken() throws IOException {
		if (line == null || line.length <= idx) {
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}
	
	public String readLine() throws IOException{
		return reader.readLine();
	}

	public long nextLong() throws IOException, NumberFormatException {
		return Long.parseLong(nextToken());
	}

	public int nextInt() throws NumberFormatException, IOException {
		return (int) nextLong();
	}

	public double nextDouble() throws NumberFormatException, IOException {
		return Double.parseDouble(nextToken());
	}
}
0