結果
問題 | No.232 めぐるはめぐる (2) |
ユーザー | mban |
提出日時 | 2017-01-14 04:40:56 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,844 bytes |
コンパイル時間 | 889 ms |
コンパイル使用メモリ | 115,544 KB |
実行使用メモリ | 26,508 KB |
最終ジャッジ日時 | 2024-06-01 08:11:00 |
合計ジャッジ時間 | 4,435 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 224 ms
18,224 KB |
testcase_01 | AC | 230 ms
21,376 KB |
testcase_02 | AC | 222 ms
18,304 KB |
testcase_03 | AC | 220 ms
18,176 KB |
testcase_04 | AC | 26 ms
17,920 KB |
testcase_05 | AC | 25 ms
18,176 KB |
testcase_06 | AC | 24 ms
18,176 KB |
testcase_07 | AC | 25 ms
18,048 KB |
testcase_08 | AC | 165 ms
19,668 KB |
testcase_09 | AC | 25 ms
18,048 KB |
testcase_10 | WA | - |
testcase_11 | AC | 25 ms
17,920 KB |
testcase_12 | AC | 25 ms
18,176 KB |
testcase_13 | AC | 26 ms
18,176 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | AC | 25 ms
18,048 KB |
testcase_17 | AC | 25 ms
18,304 KB |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | AC | 26 ms
18,048 KB |
testcase_22 | AC | 25 ms
18,176 KB |
testcase_23 | AC | 25 ms
18,048 KB |
testcase_24 | AC | 26 ms
18,176 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.Collections; using System.Collections.Generic; using System.Collections.Specialized; using System.Text; using System.Text.RegularExpressions; using System.Linq; using System.IO; class Program { static void Main(string[]args) { Magatro m = new Magatro(); m.Scan(); m.Solve(); } } public class Scanner { private StreamReader Sr; private string[] S; private int Index; private const char Separator=' '; public Scanner() { Index = 0; S = new string[0]; Sr = new StreamReader(Console.OpenStandardInput()); } private string[] Line() { return Sr.ReadLine().Split(Separator); } public string Next() { string result; if (Index >= S.Length) { S = Line(); Index = 0; } result = S[Index]; Index++; return result; } public int NextInt() { return int.Parse(Next()); } public double NextDouble() { return double.Parse(Next()); } public long NextLong() { return long.Parse(Next()); } public bool ScanToEnd(ref string s) { if (Sr.EndOfStream) { return false; } else { s = Sr.ReadLine(); return true; } } } public class Magatro { private int T, A, B; public void Scan() { Scanner sc = new Scanner(); T = sc.NextInt(); A = sc.NextInt(); B = sc.NextInt(); } public void Solve() { if (T < Math.Max(A, B)) { Console.WriteLine("NO"); return; } if (T == 2) { if (A == 2) { if (B == 2) { Console.WriteLine("YES"); Console.WriteLine("^>\n^>"); } else if (B == 1) { Console.WriteLine("YES"); Console.WriteLine("^>\n^"); } else { Console.WriteLine("YES"); Console.WriteLine("^\n^"); } return; } if (A == 1) { if (B == 2) { Console.WriteLine("YES"); Console.WriteLine("^>\n>"); } else if (B == 1) { Console.WriteLine("YES"); Console.WriteLine("^\n>"); } else { Console.WriteLine("YES"); Console.WriteLine(">^\n<"); } return; } else { if (B == 2) { Console.WriteLine("YES"); Console.WriteLine(">\n>"); } else if (B == 1) { Console.WriteLine("YES"); Console.WriteLine(">^\nv"); } else { Console.WriteLine("YES"); Console.WriteLine("^\nv"); } return; } } if (T == 1) { if (A == 0 && B == 0) { Console.WriteLine("NO"); return; } if (A == 1) { Console.Write("^"); } if (B == 1) { Console.Write(">"); } Console.WriteLine(); return; } int[] a = new int[T]; int[] b = new int[T]; for(int i = 0; i < A; i++) { a[i]++; } for (int i = 0; i < B; i++) { b[i]++; } if (A > B) { if ((T - A) % 2 == 0) { for(int i = A; i < T; i++) { a[i] += i % 2 == 0 ? 1 : -1; } } else { for (int i = A-1; i < T; i++) { a[i] += i % 2 == 0 ? 1 : -1; } } } else if (A < B) { if ((T - B) % 2 == 0) { for (int i = B; i < T; i++) { b[i] += i % 2 == 0 ? 1 : -1; } } else { for (int i = B-1; i < T; i++) { b[i] += i % 2 == 0 ? 1 : -1; } } } else { if ((T - A) % 2 == 0) { for (int i = A; i < T; i++) { a[i] += i % 2 == 0 ? 1 : -1; } } else { if (T - A == 1) { Console.WriteLine("NO"); return; } for(int i = A; i < T - 3; i++) { a[i] += i % 2 == 0 ? 1 : -1; } a[T - 3]++; a[T - 2]--; b[T - 2]++; b[T - 1]--; } } Console.WriteLine("YES"); for (int i = 0; i < T; i++) { string aa = ""; string bb = ""; if (a[i] == 1) aa = "^"; else if (a[i] == -1) aa = "v"; if (b[i] == 1) bb = ">"; else if (b[i] == -1) bb = "<"; Console.WriteLine($"{aa}{bb}"); } } }