結果

問題 No.20 砂漠のオアシス
ユーザー femtofemto
提出日時 2015-04-25 19:41:40
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 292 ms / 5,000 ms
コード長 7,238 bytes
コンパイル時間 2,518 ms
コンパイル使用メモリ 111,616 KB
実行使用メモリ 25,856 KB
最終ジャッジ日時 2024-04-21 06:26:43
合計ジャッジ時間 3,338 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 27 ms
18,944 KB
testcase_01 AC 28 ms
19,200 KB
testcase_02 AC 27 ms
18,944 KB
testcase_03 AC 34 ms
19,328 KB
testcase_04 AC 42 ms
19,712 KB
testcase_05 AC 202 ms
25,856 KB
testcase_06 AC 62 ms
21,872 KB
testcase_07 AC 292 ms
23,808 KB
testcase_08 AC 96 ms
23,148 KB
testcase_09 AC 263 ms
23,808 KB
testcase_10 AC 27 ms
19,200 KB
testcase_11 AC 27 ms
19,072 KB
testcase_12 AC 38 ms
19,456 KB
testcase_13 AC 37 ms
19,456 KB
testcase_14 AC 48 ms
19,968 KB
testcase_15 AC 44 ms
19,712 KB
testcase_16 AC 81 ms
21,236 KB
testcase_17 AC 67 ms
20,736 KB
testcase_18 AC 71 ms
20,992 KB
testcase_19 AC 84 ms
20,992 KB
testcase_20 AC 31 ms
19,072 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.Diagnostics;
using System.Collections.Generic;
using System.Linq;
using Enu = System.Linq.Enumerable;

class Solution {
    int N, V, Ox, Oy;
    int[,] L;
    int[, ,] visited;
    int[] dx = { 1, 0, -1, 0 }, dy = { 0, 1, 0, -1 };
    void calc() {
        rio(out N, out V, out Ox, out Oy);
        Ox--; Oy--;
        L = new int[N, N];
        for(int i = 0; i < N; i++) {
            var r = ria(N);
            for(int j = 0; j < N; j++) {
                L[i, j] = r[j];
            }
        }

        visited = new int[N, N, 2];
        for(int i = 0; i < N; i++)
            for(int j = 0; j < N; j++)
                for(int k = 0; k < 2; k++)
                    visited[i, j, k] = -1;



        Console.WriteLine(check() ? "YES" : "NO");
    }

    bool check() {
        var q = new PriorityQueue<state>((s1, s2) => s1.v.CompareTo(s2.v));

        q.Push(new state(0, 0, V, true));

        while(q.Count() != 0) {
            var s = q.Pop();
            if(s.v <= 0) continue;
            if(s.x == N - 1 && s.y == N - 1) {
                return true;
            }
            if(s.x == Ox && s.y == Oy && s.o) {
                s.v *= 2; s.o = false;
            }

            if(s.o) {
                if(s.v <= visited[s.y, s.x, 1]) continue;
                visited[s.y, s.x, 1] = s.v;
            }
            else {
                if(s.v <= visited[s.y, s.x, 0]) continue;
                visited[s.y, s.x, 0] = s.v;
            }
            for(int i = 0; i < 4; i++) {
                int nx = s.x + dx[i], ny = s.y + dy[i];
                if(!L.InRange(ny, nx)) continue;
                q.Push(new state(nx, ny, s.v - L[ny, nx], s.o));
            }
        }

        return false;
    }

    public class PriorityQueue<T> {
        private List<T> buffer;
        private Comparison<T> comp;
        // 昇順
        // (e1, e2) => e2.CompareTo(e1)  
        // 降順
        // (e1, e2) => e1.CompareTo(e2)
        public PriorityQueue(Comparison<T> comp) {
            buffer = new List<T>();
            this.comp = comp;
        }
        public PriorityQueue(Comparison<T> comp, IEnumerable<T> data)
            : this(comp) {
            foreach(T e in data) Push(e);
        }

        public void Push(T elem) { PushHeap(this.buffer, elem); }
        public T Pop() { return PopHeap(this.buffer); }
        public int Count() { return buffer.Count; }

        public T Top() { return buffer[0]; }
        private void PushHeap(List<T> array, T elem) {
            int n = array.Count;
            array.Add(elem);

            while(n != 0) {
                int i = (n - 1) / 2;
                // 親と値を入れ替え
                if(comp(array[n], array[i]) > 0) {
                    T tmp = array[n]; array[n] = array[i]; array[i] = tmp;
                }
                n = i;
            }
        }

        private T PopHeap(List<T> array) {
            int n = array.Count - 1;
            T returnelem = array[0];
            array[0] = array[n];
            array.RemoveAt(n);

            for(int i = 0, j; (j = 2 * i + 1) < n; ) {
                // 値の大きい方の子を選ぶ
                if((j != n - 1) && (comp(array[j], array[j + 1]) < 0))
                    j++;
                // 子と値を入れ替え
                if(comp(array[i], array[j]) < 0) {
                    T tmp = array[j]; array[j] = array[i]; array[i] = tmp;
                }
                i = j;
            }
            return returnelem;
        }
    }

    class state {
        public int x, y, v;
        public bool o;
        public state(int x, int y, int v, bool o) {
            this.x = x; this.y = y; this.v = v; this.o = o;
        }
    }

    static void Main(string[] args) {
        new Solution().calc();
    }

    #region
    static int ri() { return int.Parse(Console.ReadLine()); }
    static int[] ria(int n) {
        if(n <= 0) { Console.ReadLine(); return new int[0]; }
        else return Console.ReadLine().Trim().Split(' ').Select(int.Parse).ToArray();
    }
    static void rio(out int p1) { p1 = ri(); }
    static void rio(out int p1, out int p2) { var r = ria(2); p1 = r[0]; p2 = r[1]; }
    static void rio(out int p1, out int p2, out int p3) { var r = ria(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; }
    static void rio(out int p1, out int p2, out int p3, out int p4) { var r = ria(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; }
    static void rio(out int p1, out int p2, out int p3, out int p4, out int p5) { var r = ria(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 = r[4]; }
    static long rl() { return long.Parse(Console.ReadLine()); }
    static long[] rla(int n) {
        if(n <= 0) { Console.ReadLine(); return new long[0]; }
        else return Console.ReadLine().Trim().Split(' ').Select(long.Parse).ToArray();
    }
    static void rlo(out long p1) { p1 = rl(); }
    static void rlo(out long p1, out long p2) { var r = rla(2); p1 = r[0]; p2 = r[1]; }
    static void rlo(out long p1, out long p2, out long p3) { var r = rla(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; }
    static void rlo(out long p1, out long p2, out long p3, out long p4) { var r = rla(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; }
    static void rlo(out long p1, out long p2, out long p3, out long p4, out long p5) { var r = rla(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 = r[4]; }
    static double rd() { return double.Parse(Console.ReadLine()); }
    static double[] rda(int n) {
        if(n <= 0) { Console.ReadLine(); return new double[0]; }
        else return Console.ReadLine().Trim().Split(' ').Select(double.Parse).ToArray();
    }
    static void rdo(out double p1) { p1 = rd(); }
    static void rdo(out double p1, out double p2) { var r = rda(2); p1 = r[0]; p2 = r[1]; }
    static void rdo(out double p1, out double p2, out double p3) { var r = rda(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; }
    static void rdo(out double p1, out double p2, out double p3, out double p4) { var r = rda(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; }
    static void rdo(out double p1, out double p2, out double p3, out double p4, out double p5) { var r = rda(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 = r[4]; }
    static void swap<T>(ref T x, ref T y) { T temp = x; x = y; y = temp; }
    static void wa1<T>(T[] a) { Debug.WriteLine(string.Join(" ", a)); }
    static void wa2<T>(T[][] a) {
        foreach(var row in a) {
            Debug.WriteLine(String.Join(" ", row));
        }
    }
    [DebuggerDisplay("{x} , {y}")]
    class point {
        public int x, y;
        public point(int x, int y) {
            this.x = x; this.y = y;
        }
    }
    #endregion
}

static class Extention {
    public static T[][] ToJagArray<T>(this T[,] a) {
        int n = a.GetLength(0), m = a.GetLength(1);
        var ret = new T[n][];
        for(int i = 0; i < n; i++) {
            ret[i] = new T[m];
            for(int j = 0; j < m; j++) {
                ret[i][j] = a[i, j];
            }
        }
        return ret;
    }

    public static bool InRange<T>(this T[,] a, int i, int j) {
        int n = a.GetLength(0), m = a.GetLength(1);
        return 0 <= i && i < n && 0 <= j && j < m;
    }
}
0