#928292 (C++17) No.1572 XI

提出ソース

結果

問題	No.1572 XI
ユーザー	ゆにぽけ
提出日時	2023-11-11 16:00:14
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	304 ms / 2,000 ms
コード長	6,183 bytes
コンパイル時間	1,442 ms
コンパイル使用メモリ	134,952 KB
実行使用メモリ	28,096 KB
最終ジャッジ日時	2023-11-11 16:00:26
合計ジャッジ時間	12,000 ms
ジャッジサーバーID （参考情報）	judge14 / judge12

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,676 KB
testcase_01	AC	2 ms 6,676 KB
testcase_02	AC	1 ms 6,676 KB
testcase_03	AC	1 ms 6,676 KB
testcase_04	AC	62 ms 12,512 KB
testcase_05	AC	141 ms 16,964 KB
testcase_06	AC	173 ms 25,192 KB
testcase_07	AC	5 ms 6,676 KB
testcase_08	AC	148 ms 20,972 KB
testcase_09	AC	74 ms 26,604 KB
testcase_10	AC	118 ms 26,880 KB
testcase_11	AC	11 ms 6,676 KB
testcase_12	AC	54 ms 24,480 KB
testcase_13	AC	14 ms 12,008 KB
testcase_14	AC	54 ms 18,396 KB
testcase_15	AC	13 ms 6,676 KB
testcase_16	AC	43 ms 20,348 KB
testcase_17	AC	7 ms 13,968 KB
testcase_18	AC	65 ms 24,552 KB
testcase_19	AC	157 ms 25,124 KB
testcase_20	AC	101 ms 24,736 KB
testcase_21	AC	183 ms 23,216 KB
testcase_22	AC	143 ms 23,016 KB
testcase_23	AC	6 ms 9,876 KB
testcase_24	AC	2 ms 6,676 KB
testcase_25	AC	2 ms 6,676 KB
testcase_26	AC	2 ms 6,676 KB
testcase_27	AC	2 ms 6,676 KB
testcase_28	AC	2 ms 6,676 KB
testcase_29	AC	2 ms 6,676 KB
testcase_30	AC	2 ms 6,676 KB
testcase_31	AC	2 ms 6,676 KB
testcase_32	AC	2 ms 6,676 KB
testcase_33	AC	2 ms 6,676 KB
testcase_34	AC	268 ms 27,644 KB
testcase_35	AC	268 ms 27,744 KB
testcase_36	AC	270 ms 27,648 KB
testcase_37	AC	280 ms 28,044 KB
testcase_38	AC	292 ms 27,680 KB
testcase_39	AC	275 ms 27,792 KB
testcase_40	AC	255 ms 27,660 KB
testcase_41	AC	268 ms 27,776 KB
testcase_42	AC	304 ms 27,888 KB
testcase_43	AC	270 ms 27,860 KB
testcase_44	AC	293 ms 28,096 KB
testcase_45	AC	298 ms 28,096 KB
testcase_46	AC	300 ms 28,096 KB
testcase_47	AC	10 ms 27,968 KB
testcase_48	AC	293 ms 28,096 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cassert>
#include<cmath>
#include<ctime>
#include<iomanip>
#include<numeric>
#include<stack>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<bitset>
#include<random>
#include<functional>
#include<utility>
using namespace std;
struct modint
{
	private:
	unsigned int value;
	static int &mod()
	{
		static int m = 0;
		return m;
	}

	public:
	static void setmod(const int m)
	{
		mod() = m;
	}
	modint(const long long x = 0) noexcept
	{
		long long y = x;
		if(y < 0 || y >= mod())
		{
			y %= mod();
			if(y < 0) y += mod();
		}
		value = (unsigned int)y;
	}
	unsigned int val() noexcept {return value;}
	modint &operator+=(const modint &other) noexcept
	{
		value += other.value;
		if(value >= mod()) value -= mod();
		return *this;
	}
	modint &operator-=(const modint &other) noexcept
	{
		unsigned int x = value;
		if(x < other.value) x += mod();
		x -= other.value;
		value = x;
		return *this;
	}
	modint &operator*=(const modint &other) noexcept
	{
		unsigned long long x = value;
		x *= other.value;
		value = (unsigned int) (x % mod());
		return *this;
	}
	modint &operator/=(const modint &other) noexcept
	{
		return *this *= other.inverse();
	}
	modint inverse() const noexcept
	{
		assert(value);
		long long a = value,b = mod(),x = 1,y = 0;
		while(b)
		{
			long long q = a/b;
			a -= q*b; swap(a,b);
			x -= q*y; swap(x,y);
		}
		return modint(x);
	}
	modint power(long long N) const noexcept
	{
		assert(N >= 0);
		modint p = *this,ret = 1;
		while(N)
		{
			if(N & 1) ret *= p;
			p *= p;
			N >>= 1;
		}
		return ret;
	}
	modint operator+() {return *this;}
	modint operator-() {return modint() - *this;}
	modint &operator++(int) noexcept {return *this += 1;}
	modint &operator--(int) noexcept {return *this -= 1;}
	friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;}
	friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;}
	friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;}
	friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;}
	friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;}
};
using mint = modint;


template<class T> struct mat
{
    private:
    vector<vector<T>> m;
    int h,w;

    public:
    constexpr mat(int _h,int _w,T x = 0) noexcept {m.assign(_h,vector<T>(_w,x));h = _h,w = _w;}

    constexpr vector<T> operator[](const int i) const {assert(0 <= i && i < h); return m[i];}

    constexpr vector<T> &operator[](const int i) noexcept {assert(0 <= i && i < h); return m[i];}

    constexpr mat operator+(mat &other) noexcept
    {
        mat tmp = *this;
        return tmp += other;
    }

    constexpr mat operator-(mat &other) noexcept
    {
        mat tmp = *this;
        return tmp -= other;
    }

    constexpr mat operator*(mat &other) noexcept
    {
        mat tmp = *this;
        return tmp *= other;
    }

    constexpr mat &operator+=(mat &other) noexcept
    {
        assert(h == other.h && w == other.w);

        for(int i = 0;i < h;i++)for(int j = 0;j < w;j++) m[i][j] += other[i][j];

        return *this;
    }

    constexpr mat &operator-=(mat &other) noexcept
    {
        assert(h == other.h && w == other.w);

        for(int i = 0;i < h;i++)for(int j = 0;j < w;j++) m[i][j] -= other[i][j];

        return *this;
    }

    constexpr mat &operator*=(mat &other) noexcept
    {
        assert(w == other.h);
        mat tmp(h,other.w);
        for(int i = 0;i < h;i++)for(int j = 0;j < other.w;j++)for(int k = 0;k < w;k++) tmp[i][j] += m[i][k]*other[k][j];

        for(int i = 0;i < h;i++)
        {
            m[i].resize(other.w);
            for(int j = 0;j < other.w;j++) m[i][j] = tmp[i][j];
        }

        return *this;
    }

    constexpr mat power(long n) noexcept
    {
        assert(h == w);
        assert(n >= 0);
        mat res(h,w);
        for(int i = 0;i < h;i++) res[i][i] = 1;

        mat p = *this;
        long ex = n;

        while(ex)
        {
            if(ex & 1) res *= p;
            p *= p;
            ex >>= 1;
        }

        return res;
    }

    constexpr bool operator==(mat &other) noexcept
    {
        assert(h == other.h && w == other.w);
        bool res = true;
        for(int i = 0;i < h;i++)for(int j = 0;j < w;j++) if(m[i][j] != other[i][j]) res = false;

        return res;
    }

    constexpr bool operator!=(mat &other) noexcept
    {
        assert(h == other.h && w == other.w);
        bool res = false;
        for(int i = 0;i < h;i++)for(int j = 0;j < w;j++) if(m[i][j] != other[i][j]) res = true;

        return res;
    }

    template<class S> friend ostream &operator<<(ostream &os,const mat<S> &x);
};

template<class S> ostream &operator<<(ostream &os,const mat<S> &x)
{
    for(int i = 0;i < x.h;i++)for(int j = 0;j < x.w;j++)
    {
        os << x[i][j] << (j+1 == x.w && i+1 < x.h ? "\n":" ");
        return os;
    }
}
int H,W,si,sj,gi,gj,dp[1000][1000][6];
string S[1000];
const int d[5] = {0,1,0,-1};
//RDLU
void solve()
{
	cin >> H >> W >> si >> sj >> gi >> gj;
	si--; sj--; gi--; gj--;
	for(int i = 0;i < H;i++)
	{
		cin >> S[i];
		for(int j = 0;j < W;j++)for(int k = 0;k < 6;k++) dp[i][j][k] = -1;
	}
	dp[si][sj][4] = 0;
	queue<pair<pair<int,int>,int>> Q;
	Q.push(make_pair(make_pair(si,sj),4));
	while(!Q.empty())
	{
		const auto [i,j] = Q.front().first;
		int dir = Q.front().second;
		Q.pop();

		for(int k = 0;k < 4;k++)
		{
			int ni = i + d[k];
			int nj = j + d[k+1];
			if(ni < 0 || nj < 0 || ni >= H || nj >= W || S[ni][nj] == '#') continue;
			int ndir;
			if(dir == 4) ndir = k;
			else if(dir == 5) ndir = (k+2)%4;
			else
			{
				if((dir^k) & 1) ndir = dir;
				else if(dir == k) ndir = 5;
				else ndir = 4;
			}

			if(dp[ni][nj][ndir] < 0)
			{
				dp[ni][nj][ndir] = dp[i][j][dir]+1;
				Q.push(make_pair(make_pair(ni,nj),ndir));
			}
		}
	}
	cout << dp[gi][gj][4] << "\n";
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	/* cin >> tt; */
	while(tt--) solve();
}

yukicoder

結果

テストケース

ソースコード