結果
問題 | No.232 めぐるはめぐる (2) |
ユーザー |
👑 |
提出日時 | 2019-01-14 15:41:30 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 28 ms / 1,000 ms |
コード長 | 3,281 bytes |
コンパイル時間 | 2,371 ms |
コンパイル使用メモリ | 165,480 KB |
実行使用メモリ | 5,888 KB |
最終ジャッジ日時 | 2024-06-13 02:43:55 |
合計ジャッジ時間 | 3,793 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 22 |
ソースコード
import std.conv, std.stdio, std.string;import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex, std.typecons;import core.bitop;class EOFException : Throwable { this() { super("EOF"); } }string[] tokens;string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }int readInt() { return readToken().to!int; }long readLong() { return readToken().to!long; }real readReal() { return readToken().to!real; }void chmin(T)(ref T t, in T f) { if (t > f) t = f; }void chmax(T)(ref T t, in T f) { if (t < f) t = f; }int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp)>> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }string[] solve(int T, int A, int B) {if (T < max(A, B)) {return null;} else if (A == 0 && B == 0) {if (T == 1) {return null;} else if (T % 2 != 0) {string[] ans;ans ~= "v";ans ~= "<";ans ~= "^>";foreach (_; 0 .. (T - 3) / 2) {ans ~= "v";ans ~= "^";}return ans;} else {string[] ans;foreach (_; 0 .. T / 2) {ans ~= "v";ans ~= "^";}return ans;}return null;} else {string[] seq;foreach (_; 0 .. min(A, B)) {seq ~= "^>";}foreach (_; min(A, B) .. A) {seq ~= "^";}foreach (_; min(A, B) .. B) {seq ~= ">";}string[] ans;foreach (_; 0 .. (T - max(A, B)) / 2) {ans ~= "v";ans ~= "^";}foreach (i, s; seq) {if (i == 0 && (T - max(A, B)) % 2 != 0) {switch (s) {case "^>": ans ~= "^"; ans ~= ">"; break;case "^": ans ~= "<"; ans ~= "^>"; break;case ">": ans ~= "v"; ans ~= "^>"; break;default: assert(false);}} else {ans ~= s;}}return ans;}}void main() {foreach (T; 0 .. 10) foreach (A; 1 .. 10) foreach (B; 1 .. 10) {const res = solve(T, A, B);if (res) {if (res.length != T) {writefln("T = %s, A = %s, B = %s: %s", T, A, B, res);assert(false);}int a, b;foreach (s; res) {foreach (c; s) {switch (c) {case '^': ++a; break;case 'v': --a; break;case '>': ++b; break;case '<': --b; break;default: assert(false);}}}if (!(a == A && b == B)) {writefln("T = %s, A = %s, B = %s: %s", T, A, B, res);writefln(" a = %s, b = %s", a, b);assert(false);}}}try {for (; ; ) {const T = readInt();const A = readInt();const B = readInt();const ans = solve(T, A, B);if (ans) {writeln("YES");foreach (s; ans) {writeln(s);}} else {writeln("NO");}}} catch (EOFException e) {}}