結果
問題 | No.232 めぐるはめぐる (2) |
ユーザー | uwi |
提出日時 | 2015-06-27 00:59:52 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 171 ms / 1,000 ms |
コード長 | 3,659 bytes |
コンパイル時間 | 4,367 ms |
コンパイル使用メモリ | 83,560 KB |
実行使用メモリ | 55,508 KB |
最終ジャッジ日時 | 2024-09-14 12:33:40 |
合計ジャッジ時間 | 7,146 ms |
ジャッジサーバーID (参考情報) |
judge6 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 155 ms
52,324 KB |
testcase_01 | AC | 167 ms
55,508 KB |
testcase_02 | AC | 171 ms
52,392 KB |
testcase_03 | AC | 156 ms
53,136 KB |
testcase_04 | AC | 52 ms
50,084 KB |
testcase_05 | AC | 52 ms
50,164 KB |
testcase_06 | AC | 53 ms
49,832 KB |
testcase_07 | AC | 53 ms
50,148 KB |
testcase_08 | AC | 148 ms
52,392 KB |
testcase_09 | AC | 52 ms
50,120 KB |
testcase_10 | AC | 54 ms
50,092 KB |
testcase_11 | AC | 54 ms
50,012 KB |
testcase_12 | AC | 52 ms
50,148 KB |
testcase_13 | AC | 53 ms
50,160 KB |
testcase_14 | AC | 53 ms
50,076 KB |
testcase_15 | AC | 53 ms
49,836 KB |
testcase_16 | AC | 53 ms
50,196 KB |
testcase_17 | AC | 54 ms
50,212 KB |
testcase_18 | AC | 57 ms
49,656 KB |
testcase_19 | AC | 53 ms
50,000 KB |
testcase_20 | AC | 53 ms
50,072 KB |
testcase_21 | AC | 53 ms
49,708 KB |
testcase_22 | AC | 54 ms
50,136 KB |
testcase_23 | AC | 54 ms
50,300 KB |
testcase_24 | AC | 54 ms
50,136 KB |
ソースコード
package q5xx; 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 Q498 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int T = ni(), A = ni(), B = ni(); if(T == 1 && A == 0 && B == 0){ out.println("NO"); return; } if(Math.abs(A) <= T && Math.abs(B) <= T){ out.println("YES"); char[] as = new char[T]; { int x = 0; if((A^T)%2 == 0){ as[0] = '^'; x++; }else{ as[0] = '.'; } for(int i = 1;i < T;i++){ if(x < A){ as[i] = '^'; x++; }else{ as[i] = 'v'; x--; } } } char[] bs = new char[T]; { int y = 0; if((B^T)%2 == 0){ bs[T-1] = '>'; B--; }else{ bs[T-1] = '.'; } for(int i = 0;i < T-1;i++){ if(y < B){ bs[i] = '>'; y++; }else{ bs[i] = '<'; y--; } } } for(int i = 0;i < T;i++){ if(as[i] != '.')out.print(as[i]); if(bs[i] != '.')out.print(bs[i]); out.println(); } }else{ out.println("NO"); } } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); } public static void main(String[] args) throws Exception { new Q498().run(); } private byte[] inbuf = new byte[1024]; private int lenbuf = 0, ptrbuf = 0; private 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 boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private 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 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 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 int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private 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 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) { System.out.println(Arrays.deepToString(o)); } }