結果

問題 No.612 Move on grid
ユーザー ゆにぽけゆにぽけ
提出日時 2024-01-10 04:13:26
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,203 ms / 2,500 ms
コード長 3,308 bytes
コンパイル時間 1,492 ms
コンパイル使用メモリ 139,532 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-27 20:10:57
合計ジャッジ時間 11,485 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 37 ms
6,940 KB
testcase_04 AC 42 ms
6,944 KB
testcase_05 AC 1,202 ms
6,944 KB
testcase_06 AC 1,203 ms
6,940 KB
testcase_07 AC 19 ms
6,944 KB
testcase_08 AC 1,198 ms
6,940 KB
testcase_09 AC 474 ms
6,940 KB
testcase_10 AC 388 ms
6,940 KB
testcase_11 AC 95 ms
6,940 KB
testcase_12 AC 669 ms
6,940 KB
testcase_13 AC 214 ms
6,944 KB
testcase_14 AC 889 ms
6,944 KB
testcase_15 AC 118 ms
6,940 KB
testcase_16 AC 1,089 ms
6,944 KB
testcase_17 AC 96 ms
6,940 KB
testcase_18 AC 870 ms
6,940 KB
testcase_19 AC 212 ms
6,940 KB
testcase_20 AC 293 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <iterator>
#include <string>
#include <cctype>
#include <cstring>
#include <cstdlib>
#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 <utility>
#include <functional>
using namespace std;
template<int m> struct modint
{
	private:
	unsigned int value;
	static constexpr int mod() {return m;}

	public:
	constexpr 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;
	}
	constexpr unsigned int val() noexcept {return value;}
	constexpr modint &operator+=(const modint &other) noexcept
	{
		value += other.value;
		if(value >= mod()) value -= mod();
		return *this;
	}
	constexpr modint &operator-=(const modint &other) noexcept
	{
		unsigned int x = value;
		if(x < other.value) x += mod();
		x -= other.value;
		value = x;
		return *this;
	}
	constexpr modint &operator*=(const modint &other) noexcept
	{
		unsigned long long x = value;
		x *= other.value;
		value = (unsigned int) (x % mod());
		return *this;
	}
	constexpr modint &operator/=(const modint &other) noexcept
	{
		return *this *= other.inverse();
	}
	constexpr 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);
	}
	constexpr 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;
	}
	constexpr modint operator+() {return *this;}
	constexpr modint operator-() {return modint() - *this;}
	constexpr modint &operator++(int) noexcept {return *this += 1;}
	constexpr 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<998244353>; */
using mint = modint<1000000007>;
void solve()
{
	int T;
	cin >> T;
	vector<int> A(6);
	for(int i = 0;i < 6;i += 2)
	{
		cin >> A[i];
		A[i + 1] = -A[i];
	}
	int d,e;
	cin >> d >> e;
	map<int,mint> dp;
	dp[0] = 1;
	for(int i = 0;i < T;i++)
	{
		map<int,mint> n_dp;
		for(auto it = dp.begin();it != dp.end();it++)
		{
			int val = it -> first;
			mint count = it -> second;
			for(int j = 0;j < 6;j++)
			{
				int n_val = val + A[j];
				n_dp[n_val] += count;
			}
		}
		dp.swap(n_dp);
	}
	mint ans = 0;
	for(auto it = dp.begin();it != dp.end();it++)
	{
		if(d <= it -> first && it -> first <= e)
		{
			ans += it -> second;
		}
	}
	cout << ans << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	/* cin >> tt; */
	while(tt--) solve();
}
0