結果
問題 | No.466 ジオラマ |
ユーザー | 14番 |
提出日時 | 2016-12-16 02:07:27 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,937 bytes |
コンパイル時間 | 4,632 ms |
コンパイル使用メモリ | 108,348 KB |
実行使用メモリ | 31,368 KB |
最終ジャッジ日時 | 2023-08-20 08:41:43 |
合計ジャッジ時間 | 16,555 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 65 ms
19,816 KB |
testcase_01 | AC | 61 ms
21,752 KB |
testcase_02 | AC | 66 ms
21,772 KB |
testcase_03 | AC | 64 ms
21,788 KB |
testcase_04 | AC | 63 ms
21,848 KB |
testcase_05 | AC | 63 ms
21,760 KB |
testcase_06 | AC | 72 ms
27,280 KB |
testcase_07 | AC | 71 ms
25,852 KB |
testcase_08 | AC | 79 ms
30,208 KB |
testcase_09 | AC | 71 ms
21,904 KB |
testcase_10 | AC | 74 ms
27,252 KB |
testcase_11 | AC | 72 ms
26,032 KB |
testcase_12 | AC | 75 ms
27,388 KB |
testcase_13 | AC | 71 ms
23,980 KB |
testcase_14 | AC | 72 ms
25,844 KB |
testcase_15 | AC | 71 ms
23,972 KB |
testcase_16 | AC | 65 ms
21,904 KB |
testcase_17 | AC | 67 ms
23,800 KB |
testcase_18 | AC | 69 ms
27,888 KB |
testcase_19 | AC | 68 ms
23,888 KB |
testcase_20 | AC | 72 ms
21,932 KB |
testcase_21 | AC | 68 ms
23,948 KB |
testcase_22 | AC | 72 ms
29,352 KB |
testcase_23 | AC | 68 ms
25,852 KB |
testcase_24 | AC | 74 ms
25,404 KB |
testcase_25 | AC | 74 ms
29,620 KB |
testcase_26 | AC | 69 ms
23,940 KB |
testcase_27 | AC | 74 ms
29,880 KB |
testcase_28 | AC | 72 ms
27,088 KB |
testcase_29 | AC | 77 ms
25,776 KB |
testcase_30 | AC | 71 ms
25,992 KB |
testcase_31 | AC | 70 ms
23,916 KB |
testcase_32 | AC | 68 ms
24,048 KB |
testcase_33 | AC | 68 ms
25,924 KB |
testcase_34 | AC | 75 ms
27,260 KB |
testcase_35 | AC | 71 ms
25,960 KB |
testcase_36 | AC | 68 ms
23,856 KB |
testcase_37 | AC | 63 ms
23,804 KB |
testcase_38 | AC | 70 ms
23,856 KB |
testcase_39 | AC | 63 ms
21,764 KB |
testcase_40 | AC | 72 ms
26,064 KB |
testcase_41 | AC | 63 ms
21,724 KB |
testcase_42 | AC | 72 ms
23,968 KB |
testcase_43 | AC | 64 ms
21,984 KB |
testcase_44 | AC | 71 ms
25,828 KB |
testcase_45 | AC | 62 ms
19,840 KB |
testcase_46 | AC | 70 ms
23,752 KB |
testcase_47 | AC | 64 ms
23,712 KB |
testcase_48 | AC | 73 ms
25,208 KB |
testcase_49 | AC | 64 ms
23,772 KB |
testcase_50 | AC | 73 ms
24,104 KB |
testcase_51 | AC | 65 ms
21,888 KB |
testcase_52 | AC | 69 ms
24,068 KB |
testcase_53 | AC | 61 ms
23,680 KB |
testcase_54 | AC | 68 ms
24,004 KB |
testcase_55 | AC | 60 ms
21,700 KB |
testcase_56 | WA | - |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | WA | - |
testcase_61 | WA | - |
testcase_62 | WA | - |
testcase_63 | WA | - |
testcase_64 | WA | - |
testcase_65 | WA | - |
testcase_66 | AC | 72 ms
27,312 KB |
testcase_67 | AC | 62 ms
21,848 KB |
testcase_68 | AC | 68 ms
23,912 KB |
testcase_69 | AC | 62 ms
21,748 KB |
testcase_70 | AC | 67 ms
23,884 KB |
testcase_71 | AC | 63 ms
21,752 KB |
testcase_72 | AC | 67 ms
21,776 KB |
testcase_73 | AC | 60 ms
21,816 KB |
testcase_74 | AC | 68 ms
23,960 KB |
testcase_75 | AC | 60 ms
21,852 KB |
testcase_76 | AC | 64 ms
21,872 KB |
testcase_77 | AC | 61 ms
19,800 KB |
testcase_78 | AC | 63 ms
21,936 KB |
testcase_79 | AC | 63 ms
23,800 KB |
testcase_80 | AC | 63 ms
19,748 KB |
testcase_81 | AC | 63 ms
21,932 KB |
testcase_82 | AC | 64 ms
19,828 KB |
testcase_83 | WA | - |
testcase_84 | WA | - |
testcase_85 | AC | 82 ms
31,276 KB |
testcase_86 | WA | - |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.Linq; using System.Collections.Generic; using System.Text; public class Program { public void Proc() { Reader.IsDebug = false; int[] inpt = Reader.ReadLine().Split(' ').Select(c=>int.Parse(c)).ToArray(); int a = inpt[0]; int b = inpt[1]; int aAndB = inpt[2]; int roadCount = inpt[3]; if(aAndB > 0 && a+b-aAndB-1>roadCount) { Console.WriteLine(-1); return; } if(aAndB == 0 && a+b-2>roadCount) { Console.WriteLine(-1); return; } if(aAndB > 0 && (a<=1 || b<=1)) { Console.WriteLine(-1); return; } TreeNode t0 = new TreeNode(0); TreeNode t1 = new TreeNode(1); if(aAndB == a) { t1.Add(t0); int idx = 2; if(a>1) { t0.AddRange(idx, idx+a-2); } idx = idx+a-1; if(b-aAndB>1) { t1.AddRange(idx, idx+(b-aAndB)-2); } } else if(aAndB == b) { t0.Add(t1); int idx = 2; if(b>1) { t1.AddRange(idx, idx+b-2); } idx = idx+b-1; if(a-aAndB>1) { t0.AddRange(idx, idx+(a-aAndB)-2); } // } else if(a == b && a == aAndB) { } else { TreeNode t2 = null; int idx = 2; if(aAndB > 0) { t2 = new TreeNode(2); idx++; if(aAndB >1) { t2.AddRange(idx, idx+aAndB-2); idx=idx+aAndB-1; } t0.Add(t2); t1.Add(t2); } if(a-aAndB>1) { t0.AddRange(idx, idx+(a-aAndB)-2); idx = idx+(a-aAndB)-1; } if(b-aAndB>1) { t1.AddRange(idx, idx+(b-aAndB)-2); } } StringBuilder ans = new StringBuilder(); ans.Append(t0.Print()); ans.Append(t1.Print()); int mura = a+b-aAndB; int road = mura-1; if(aAndB == 0) { road--; } Console.WriteLine(mura + " " + road); Console.Write(ans.ToString()); } public class TreeNode { public int Id; public List<TreeNode> Items = new List<TreeNode>(); public TreeNode(int id) { this.Id = id; } public void Add(TreeNode cld) { this.Items.Add(cld); } private bool IsPrinted = false; public string Print() { if(this.IsPrinted) { return string.Empty; } this.IsPrinted = true; StringBuilder ret = new StringBuilder(); this.Items.ForEach(a=>{ ret.AppendLine(this.Id + " " + a.Id); ret.Append(a.Print()); }); return ret.ToString(); } public List<TreeNode> AddRange(int f, int t) { List<TreeNode> tmp = new List<TreeNode>(); for(int i=f; i<=t; i++) { tmp.Add(new TreeNode(i)); } this.Items.AddRange(tmp); return tmp; } } public class Reader { public static bool IsDebug = true; private static System.IO.StringReader SReader; private static string InitText = @" 2 2 1 2 "; public static string ReadLine() { if(IsDebug) { if(SReader == null) { SReader = new System.IO.StringReader(InitText.Trim()); } return SReader.ReadLine(); } else { return Console.ReadLine(); } } } public static void Main(string[] args) { Program prg = new Program(); prg.Proc(); } }