結果

問題 No.325 マンハッタン距離2
ユーザー りあんりあん
提出日時 2015-12-18 00:44:46
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 29 ms / 1,000 ms
コード長 6,002 bytes
コンパイル時間 1,764 ms
コンパイル使用メモリ 114,652 KB
実行使用メモリ 27,256 KB
最終ジャッジ日時 2024-09-16 08:15:10
合計ジャッジ時間 3,370 ms
ジャッジサーバーID
（参考情報） 		judge6 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 29 ms
24,856 KB
testcase_01 AC 29 ms
27,256 KB
testcase_02 AC 27 ms
24,824 KB
testcase_03 AC 29 ms
25,004 KB
testcase_04 AC 28 ms
24,956 KB
testcase_05 AC 29 ms
26,772 KB
testcase_06 AC 28 ms
27,024 KB
testcase_07 AC 28 ms
25,392 KB
testcase_08 AC 28 ms
27,008 KB
testcase_09 AC 28 ms
22,712 KB
testcase_10 AC 28 ms
27,036 KB
testcase_11 AC 28 ms
26,900 KB
testcase_12 AC 28 ms
22,716 KB
testcase_13 AC 28 ms
24,952 KB
testcase_14 AC 28 ms
24,944 KB
testcase_15 AC 28 ms
26,760 KB
testcase_16 AC 27 ms
25,204 KB
testcase_17 AC 27 ms
25,076 KB
testcase_18 AC 28 ms
25,084 KB
testcase_19 AC 28 ms
24,976 KB
testcase_20 AC 27 ms
22,840 KB
testcase_21 AC 28 ms
24,820 KB
testcase_22 AC 29 ms
24,824 KB
testcase_23 AC 28 ms
24,820 KB
testcase_24 AC 28 ms
24,984 KB
testcase_25 AC 27 ms
22,836 KB
testcase_26 AC 29 ms
27,144 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Collections.Generic;
using System.Linq;
using System.IO;
using System.IO.Compression;
using System.Text;
//using System.Numerics;

namespace Solver
{
    class Program
    {
        const int M = 1000000007;
        const double eps = 1e-9;
        static int[] dd = { 0, 1, 0, -1, 0 };
        static void Main()
        {
            var sw = new System.IO.StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
            var sc = new Scan();
            var inp = sc.IntArr;
            long x1 = inp[0], y1 = inp[1], x2 = inp[2], y2 = inp[3], d = inp[4];
            if (x1 <= 0 && x2 <= 0)
            {
                var t = x1;
                x1 = -x2;
                x2 = -t;
            }
            if (y1 <= 0 && y2 <= 0)
            {
                var t = y1;
                y1 = -y2;
                y2 = -t;
            }
            if (x1 >= 0 && y1 >= 0)
                sw.WriteLine(count(x1, y1, x2, y2, d));
            else if (x1 >= 0)
                sw.WriteLine(count(x1, 0, x2, y2, d) + count(x1, 1, x2, -y1, d));
            else if (y1 >= 0)
                sw.WriteLine(count(0, y1, x2, y2, d) + count(1, y1, -x1, y2, d));
            else
                sw.WriteLine(count(0, 0, x2, y2, d) + count(1, 0, -x1, y2, d) + count(0, 1, x2, -y1, d) + count(1, 1, -x1, -y1, d));

            sw.Flush();
        }
        static long count(long x1, long y1, long x2, long y2, long d)
        {
            return count(x2, y2, d) - count(x2, y1 - 1, d) - count(x1 - 1, y2, d) + count(x1 - 1, y1 - 1, d);
        }
        static long count(long x, long y, long d)
        {
            if (x < 0 || y < 0) return 0;
            if (x + y <= d) return (x + 1) * (y + 1);
            if (x < d && y < d)
            {
                long c = x + y - d;
                return (x + 1) * (y + 1) - c * (c + 1) / 2;
            }
            if (x < d)
                return (d * 2 + 2 - x) * (x + 1) / 2;
            if (y < d)
                return (d * 2 + 2 - y) * (y + 1) / 2;

            return (d + 1) * (d + 2) / 2;
        }

        static bool isprime(long n)
        {
            if (n == 1) return false;

            for (long i = 2; i * i <= n; i++)
                if (n % i == 0)
                    return false;

            return true;
        }

        static string strsort(string s)
        {
            var c = s.ToCharArray();
            Array.Sort(c);
            return string.Join("", c);
        }
        static string strswap(string s, int i, int j)
        {
            var c = s.ToCharArray();
            c[i] = s[j];
            c[j] = s[i];
            return string.Join("", c);
        }

        static T[] copy<T>(T[] a)
        {
            var ret = new T[a.Length];
            for (int i = 0; i < a.Length; i++) ret[i] = a[i];
            return ret;
        }
    }
    class Scan
    {
        public int Int { get { return int.Parse(Console.ReadLine().Trim()); } }
        public long Long { get { return long.Parse(Console.ReadLine().Trim()); } }
        public string Str { get { return Console.ReadLine().Trim(); } }
        public int[] IntArr { get { return Console.ReadLine().Trim().Split().Select(int.Parse).ToArray(); } }
        public int[] IntArrWithSep(char sep) { return Console.ReadLine().Trim().Split(sep).Select(int.Parse).ToArray(); }
        public long[] LongArr { get { return Console.ReadLine().Trim().Split().Select(long.Parse).ToArray(); } }
        public double[] DoubleArr { get { return Console.ReadLine().Split().Select(double.Parse).ToArray(); } }
        public string[] StrArr { get { return Console.ReadLine().Trim().Split(); } }
        public List<int> IntList { get { return Console.ReadLine().Trim().Split().Select(int.Parse).ToList(); } }
        public List<long> LongList { get { return Console.ReadLine().Trim().Split().Select(long.Parse).ToList(); } }
        public void Multi(out int a, out int b) { var arr = IntArr; a = arr[0]; b = arr[1]; }
        public void Multi(out int a, out int b, out int c) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; }
        public void Multi(out int a, out int b, out int c, out int d) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; d = arr[3]; }
        public void Multi(out int a, out string b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1]; }
        public void Multi(out int a, out int b, out string c) { var arr = StrArr; a = int.Parse(arr[0]); b = int.Parse(arr[1]); c = arr[2]; }
        public void Multi(out int a, out char b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1][0]; }
        public void Multi(out char a, out int b) { var arr = StrArr; a = arr[0][0]; b = int.Parse(arr[1]); }
        public void Multi(out long a, out long b) { var arr = LongArr; a = arr[0]; b = arr[1]; }
        public void Multi(out long a, out int b) { var arr = LongArr; a = arr[0]; b = (int)arr[1]; }
        public void Multi(out int a, out long b) { var arr = LongArr; a = (int)arr[0]; b = arr[1]; }
        public void Multi(out string a, out string b) { var arr = StrArr; a = arr[0]; b = arr[1]; }
    }
    class mymath
    {
        public bool isprime(long a)
        {
            if (a < 2) return false;
            for (long i = 2; i * i <= a; i++)
                if (a % i == 0)
                    return false;

            return true;
        }
        public long powmod(long a, long b, long M)
        {
            if (a == 0) return 0;
            if (b == 0) return 1;
            if (b == 1) return a % M;

            var t = powmod(a, b / 2, M);

            if ((b & 1) == 0) return t * t % M;
            else return t * t % M * a % M;
        }
        public long gcd(long a, long b)
        {
            while (b != 0)
            {
                var t = a % b;
                a = b;
                b = t;
            }
            return a;
        }
        public long lcm(int a, int b) { return a * (long)b / gcd(a, b); }
    }
}
0