結果

問題 No.466 ジオラマ
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2016-12-16 00:58:08
言語 C#(csc)
(csc 3.9.0)
結果
RE  
実行時間 -
コード長 8,120 bytes
コンパイル時間 1,046 ms
コンパイル使用メモリ 111,744 KB
実行使用メモリ 22,272 KB
最終ジャッジ日時 2024-05-07 15:39:06
合計ジャッジ時間 7,935 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 29 ms
19,072 KB
testcase_01 AC 24 ms
18,944 KB
testcase_02 AC 29 ms
19,072 KB
testcase_03 AC 29 ms
19,072 KB
testcase_04 AC 29 ms
19,072 KB
testcase_05 AC 23 ms
18,560 KB
testcase_06 AC 40 ms
20,352 KB
testcase_07 AC 36 ms
19,708 KB
testcase_08 AC 46 ms
20,736 KB
testcase_09 AC 39 ms
20,224 KB
testcase_10 AC 40 ms
20,224 KB
testcase_11 AC 37 ms
19,616 KB
testcase_12 AC 42 ms
20,352 KB
testcase_13 AC 34 ms
19,476 KB
testcase_14 AC 34 ms
19,760 KB
testcase_15 AC 35 ms
19,824 KB
testcase_16 AC 28 ms
18,944 KB
testcase_17 AC 35 ms
19,292 KB
testcase_18 AC 36 ms
19,508 KB
testcase_19 AC 36 ms
19,684 KB
testcase_20 AC 37 ms
19,560 KB
testcase_21 AC 36 ms
19,492 KB
testcase_22 AC 40 ms
20,096 KB
testcase_23 AC 38 ms
19,644 KB
testcase_24 AC 42 ms
20,224 KB
testcase_25 AC 44 ms
20,224 KB
testcase_26 AC 35 ms
19,508 KB
testcase_27 AC 43 ms
20,352 KB
testcase_28 AC 39 ms
20,224 KB
testcase_29 AC 43 ms
20,480 KB
testcase_30 AC 39 ms
20,096 KB
testcase_31 AC 39 ms
20,096 KB
testcase_32 AC 38 ms
19,968 KB
testcase_33 AC 36 ms
19,544 KB
testcase_34 AC 39 ms
20,224 KB
testcase_35 AC 36 ms
19,744 KB
testcase_36 AC 32 ms
19,412 KB
testcase_37 AC 23 ms
18,688 KB
testcase_38 AC 35 ms
19,564 KB
testcase_39 AC 23 ms
18,560 KB
testcase_40 AC 37 ms
19,756 KB
testcase_41 AC 23 ms
18,560 KB
testcase_42 AC 37 ms
19,812 KB
testcase_43 AC 23 ms
18,688 KB
testcase_44 AC 36 ms
19,632 KB
testcase_45 AC 22 ms
18,944 KB
testcase_46 AC 30 ms
18,928 KB
testcase_47 AC 22 ms
18,560 KB
testcase_48 AC 40 ms
20,224 KB
testcase_49 AC 23 ms
18,504 KB
testcase_50 AC 38 ms
19,840 KB
testcase_51 AC 24 ms
18,764 KB
testcase_52 AC 37 ms
19,720 KB
testcase_53 AC 24 ms
18,560 KB
testcase_54 AC 36 ms
19,680 KB
testcase_55 AC 24 ms
18,816 KB
testcase_56 RE -
testcase_57 RE -
testcase_58 RE -
testcase_59 RE -
testcase_60 RE -
testcase_61 RE -
testcase_62 RE -
testcase_63 RE -
testcase_64 RE -
testcase_65 RE -
testcase_66 AC 40 ms
20,224 KB
testcase_67 AC 24 ms
19,016 KB
testcase_68 AC 37 ms
19,552 KB
testcase_69 AC 24 ms
18,560 KB
testcase_70 AC 34 ms
19,540 KB
testcase_71 AC 24 ms
18,688 KB
testcase_72 AC 33 ms
19,412 KB
testcase_73 AC 25 ms
18,816 KB
testcase_74 AC 40 ms
19,876 KB
testcase_75 AC 23 ms
18,560 KB
testcase_76 AC 23 ms
18,632 KB
testcase_77 AC 23 ms
18,944 KB
testcase_78 AC 22 ms
18,880 KB
testcase_79 AC 23 ms
18,636 KB
testcase_80 AC 24 ms
18,560 KB
testcase_81 AC 26 ms
18,944 KB
testcase_82 AC 23 ms
18,688 KB
testcase_83 AC 28 ms
19,072 KB
testcase_84 RE -
testcase_85 AC 51 ms
22,272 KB
testcase_86 RE -
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
using Point = System.Numerics.Complex;
using Number = System.Int64;
namespace Program
{
    public class Solver
    {
        public void Solve()
        {
            var a = sc.Integer();
            var b = sc.Integer();
            var min = sc.Integer();
            var k = sc.Integer();
            if (a == 1 && b == 1 && min == 1)
            {
                IO.Printer.Out.WriteLine(-1);
                
                return;
            }
            if (a == b && b == min)
            {
                if (k < a) IO.Printer.Out.WriteLine(-1);
                else
                {
                    IO.Printer.Out.WriteLine("{0} {1}", a, a);
                    for (int i = 0; i < a; i++)
                        IO.Printer.Out.WriteLine("{0} {1}", i, (i + 1) % a);
                }
                throw new Exception();
                return;
            }
            a -= min;
            b -= min;
            var E = new List<Pair<int, int>>();
            var p = 100000;
            for (int i = 0; i < min - 1; i++)
                E.Add(new Pair<int, int>(p + i, p + i + 1));
            if (a == 0 && min > 0)
            {
                if (min >= 2)
                    E[0] = new Pair<int, int>(0, p + 1);
                p = 0;
            }
            else if (b == 0 && min > 0)
            {
                if (min >= 2)
                    E[0] = new Pair<int, int>(1, p + 1);
                p = 1;
            }
            var q = 200000;
            for (int i = 0; i < a; i++)
            {
                var to = q + i;
                if (i == a - 1) { to = p; if (min == 0) continue; }
                if (i == 0) E.Add(new Pair<int, int>(0, to));
                else E.Add(new Pair<int, int>(q + i - 1, to));
            }
            var r = 300000;
            if (b > 0)
            {
                for (int i = 0; i < b; i++)
                {
                    var to = r + i;
                    if (i == b - 1) { to = p; if (min == 0) continue; }
                    if (i == 0) E.Add(new Pair<int, int>(1, to));
                    else E.Add(new Pair<int, int>(r + i - 1, to));
                }
            }
            if (E.Count > k)
            {
                IO.Printer.Out.WriteLine(-1);
                return;
            }
            var xs = new List<int>() { 0, 1 };
            for (int i = 0; i < E.Count; i++)
            {
                xs.Add(E[i].x);
                xs.Add(E[i].y);
            }
            xs = xs.Distinct().ToList(); xs.Sort();
            IO.Printer.Out.WriteLine("{0} {1}", Math.Max(2, xs.Count), E.Count);
            for (int i = 0; i < E.Count; i++)
            {
                IO.Printer.Out.WriteLine("{0} {1}", xs.BinarySearch(E[i].x), xs.BinarySearch(E[i].y));
                //IO.Printer.Out.WriteLine("{0} {1}", E[i].x, E[i].y);
            }
        }
        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
        static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
    }
}

#region main
static class Ex
{
    static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
    static public void Main()
    {
        var solver = new Program.Solver();
        solver.Solve();
        Program.IO.Printer.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO
{
    using System.IO;
    using System.Text;
    using System.Globalization;
    public class Printer: StreamWriter
    {
        static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
        public static Printer Out { get; set; }
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
        public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
        public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
    }
    public class StreamScanner
    {
        public StreamScanner(Stream stream) { str = stream; }
        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream { get { return isEof; } }
        private byte read()
        {
            if (isEof) return 0;
            if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
            return buf[ptr++];
        }
        public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }

        public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        public string ScanLine()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n'; b = (char)read())
                if (b == 0) break;
                else if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long()
        {
            if (isEof) return long.MinValue;
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != 0 && b != '-' && (b < '0' || '9' < b));
            if (b == 0) return long.MinValue;
            if (b == '-') { ng = true; b = read(); }
            for (; true; b = read())
            {
                if (b < '0' || '9' < b)
                    return ng ? -ret : ret;
                else ret = ret * 10 + b - '0';
            }
        }
        public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
        public double Double() { var s = Scan(); return s != "" ? double.Parse(s, CultureInfo.InvariantCulture) : double.NaN; }
        private T[] enumerate<T>(int n, Func<T> f)
        {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f();
            return a;
        }

        public char[] Char(int n) { return enumerate(n, Char); }
        public string[] Scan(int n) { return enumerate(n, Scan); }
        public double[] Double(int n) { return enumerate(n, Double); }
        public int[] Integer(int n) { return enumerate(n, Integer); }
        public long[] Long(int n) { return enumerate(n, Long); }
    }
}
#endregion
#region Compair
static public class Pair
{
    static public Pair<FT, ST> Create<FT, ST>(FT f, ST s)
        where FT : IComparable<FT>
        where ST : IComparable<ST>
    { return new Pair<FT, ST>(f, s); }
    static public Pair<FT, ST> Min<FT, ST>(Pair<FT, ST> p, Pair<FT, ST> q)
        where FT : IComparable<FT>
        where ST : IComparable<ST>
    { return (p.CompareTo(q) <= 0) ? p : q; }
    static public Pair<FT, ST> Max<FT, ST>(Pair<FT, ST> p, Pair<FT, ST> q)
        where FT : IComparable<FT>
        where ST : IComparable<ST>
    { return (p.CompareTo(q) >= 0) ? p : q; }
}
public struct Pair<FT, ST>: IComparable<Pair<FT, ST>>
    where FT : IComparable<FT>
    where ST : IComparable<ST>
{
    public FT x;
    public ST y;
    public Pair(FT f, ST s) : this() { x = f; y = s; }

    public int CompareTo(Pair<FT, ST> other)
    {
        var cmp = x.CompareTo(other.x);
        return cmp != 0 ? cmp : y.CompareTo(other.y);
    }
    public override string ToString() { return string.Format("{0} {1}", x, y); }
}
#endregion
0