結果
問題 | No.466 ジオラマ |
ユーザー | 14番 |
提出日時 | 2016-12-16 01:49:59 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,708 bytes |
コンパイル時間 | 903 ms |
コンパイル使用メモリ | 115,124 KB |
実行使用メモリ | 34,864 KB |
最終ジャッジ日時 | 2024-05-07 15:48:19 |
合計ジャッジ時間 | 9,069 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 27 ms
19,328 KB |
testcase_02 | AC | 28 ms
19,328 KB |
testcase_03 | AC | 28 ms
19,328 KB |
testcase_04 | WA | - |
testcase_05 | AC | 28 ms
19,200 KB |
testcase_06 | AC | 35 ms
24,704 KB |
testcase_07 | AC | 30 ms
22,016 KB |
testcase_08 | AC | 37 ms
25,344 KB |
testcase_09 | AC | 33 ms
23,296 KB |
testcase_10 | AC | 36 ms
24,576 KB |
testcase_11 | AC | 33 ms
22,912 KB |
testcase_12 | AC | 35 ms
24,704 KB |
testcase_13 | AC | 31 ms
22,144 KB |
testcase_14 | AC | 32 ms
21,584 KB |
testcase_15 | AC | 33 ms
22,528 KB |
testcase_16 | AC | 28 ms
19,200 KB |
testcase_17 | AC | 31 ms
21,960 KB |
testcase_18 | AC | 33 ms
22,060 KB |
testcase_19 | AC | 32 ms
22,400 KB |
testcase_20 | AC | 33 ms
22,400 KB |
testcase_21 | AC | 33 ms
22,144 KB |
testcase_22 | AC | 34 ms
24,704 KB |
testcase_23 | AC | 30 ms
22,528 KB |
testcase_24 | AC | 35 ms
24,832 KB |
testcase_25 | AC | 36 ms
24,960 KB |
testcase_26 | AC | 32 ms
22,272 KB |
testcase_27 | AC | 40 ms
25,216 KB |
testcase_28 | AC | 35 ms
24,448 KB |
testcase_29 | AC | 37 ms
25,216 KB |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | AC | 35 ms
23,168 KB |
testcase_33 | AC | 35 ms
22,400 KB |
testcase_34 | AC | 35 ms
24,448 KB |
testcase_35 | AC | 34 ms
22,784 KB |
testcase_36 | AC | 32 ms
20,992 KB |
testcase_37 | AC | 27 ms
19,200 KB |
testcase_38 | AC | 33 ms
21,900 KB |
testcase_39 | AC | 28 ms
19,328 KB |
testcase_40 | AC | 31 ms
22,912 KB |
testcase_41 | AC | 26 ms
19,328 KB |
testcase_42 | AC | 31 ms
22,656 KB |
testcase_43 | AC | 27 ms
19,200 KB |
testcase_44 | AC | 32 ms
22,144 KB |
testcase_45 | AC | 27 ms
19,456 KB |
testcase_46 | AC | 28 ms
20,480 KB |
testcase_47 | AC | 25 ms
19,200 KB |
testcase_48 | AC | 34 ms
24,576 KB |
testcase_49 | AC | 26 ms
18,944 KB |
testcase_50 | AC | 31 ms
23,168 KB |
testcase_51 | AC | 27 ms
19,072 KB |
testcase_52 | AC | 32 ms
22,912 KB |
testcase_53 | AC | 26 ms
19,328 KB |
testcase_54 | AC | 31 ms
22,656 KB |
testcase_55 | AC | 25 ms
19,200 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 | WA | - |
testcase_67 | AC | 29 ms
19,328 KB |
testcase_68 | WA | - |
testcase_69 | AC | 27 ms
19,072 KB |
testcase_70 | WA | - |
testcase_71 | AC | 28 ms
19,328 KB |
testcase_72 | WA | - |
testcase_73 | AC | 26 ms
19,328 KB |
testcase_74 | WA | - |
testcase_75 | AC | 27 ms
19,072 KB |
testcase_76 | AC | 27 ms
19,200 KB |
testcase_77 | AC | 25 ms
19,072 KB |
testcase_78 | AC | 27 ms
19,328 KB |
testcase_79 | AC | 26 ms
19,328 KB |
testcase_80 | AC | 28 ms
19,200 KB |
testcase_81 | WA | - |
testcase_82 | WA | - |
testcase_83 | AC | 29 ms
18,944 KB |
testcase_84 | WA | - |
testcase_85 | WA | - |
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; } 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 { 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; Console.WriteLine(mura + " " + (mura-1)); 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 = @" 1 4 0 3 "; 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(); } }