Submission #188457


Source Code Expand

////////////////////
///   template   ///
////////////////////

#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <functional>
#include <vector>
#include <queue>
#include <string>
#include <complex>
#include <stack>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
using namespace std;

//// MACRO ////
#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i,n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i,s,n) for (int i = (s); i < (n); i++)
#define allof(c) c.begin(), c.end()
#define partof(c,i,n) c.begin() + (i), c.begin() + (i) + (n)
#define EPS 1e-10
#define INF 1000000000

#define countof(a) (sizeof(a)/sizeof(a[0]))
#define PREDIACTE(t,a) [](const t & a) -> bool
#define COMPARISON_T(t) bool(*)(const t &, const t &)
#define COMPARISON(t,a,b) [](const t & a, const t & b) -> bool

// start up //
void solve();
int main() { solve(); return 0; }

//// prime ////
vector<unsigned char> isPrime;
vector<int> primes;
void initPrimes(int n)
{
	isPrime = vector<unsigned char>(n + 1, true);
	isPrime[0] = isPrime[1] = false;
	FOR(i, 2, n + 1)
	{
		if (!isPrime[i]) continue;
		primes.push_back(i);
		for (int j = i * 2; j <= n; j += i)
			isPrime[j] = false;
	}
}

//// iota iterator ////
struct iotait
{
	int n;
	iotait(int n = 0) : n(n) { }
	iotait &operator ++() { ++n; return *this; }
	int operator *() { return n; }
};

//// geo ////
struct P3
{
	double x, y, z;
	P3(double x=0, double y=0, double z=0) : x(x), y(y), z(z) { }
	P3 operator +() const { return *this; }
	P3 operator +(const P3 &_) const { return P3(x+_.x, y+_.y, z+_.z); }
	P3 operator -() const { return P3(-x, -y, -z); }
	P3 operator -(const P3 &_) const { return *this + -_; }
	P3 operator *(double _) const { return P3(x*_,y*_,z*_); }
	P3 operator /(double _) const { return P3(x/_,y/_,z/_); }
	double dot(const P3 &_) const { return x*_.x + y*_.y + z*_.z; }
	P3 cross(const P3 &_) const { return P3(y*_.z-z*_.y, z*_.x-x*_.z, x*_.y-y*_.x); }
	double sqlength() const { return x*x+y*y+z*z; }
	double length() const { return sqrt(sqlength()); }
	P3 direction() const { return *this / length(); }
};

struct Sphere
{
	P3 c;
	double r;
	Sphere(double x, double y, double z, double r) : c(x,y,z), r(r) { }
};

//// graph ////
struct Path
{
	int from;
	int to;
	double cost;
	Path(int from = 0, int to = 0, double cost = 0) : from(from), to(to), cost(cost) { }
	bool operator < (const Path &rhs) const { return cost < rhs.cost; }
	bool operator > (const Path &rhs) const { return cost > rhs.cost; }
};

// prim //
pair<double, vector<int>> prim(const vector<vector<double>> &costTable)
{
	int N = costTable.size();
	priority_queue<Path, vector<Path>, greater<Path>> q;
	q.push(Path(0, 0, 0));
	
	vector<int> parent(N, -1);
	double totalCost = 0;
	while (!q.empty())
	{
		Path cur = q.top(); q.pop();
		int i = cur.to;
		if (parent[i] != -1) continue;
		parent[i] = cur.from;
		totalCost += cur.cost;
		REP(j,N) if (parent[j] == -1) q.push(Path(i,j,costTable[i][j]));
	}
	return make_pair(totalCost, parent);
}

// dijkstra //
pair<vector<double>, vector<int>> dijkstra(const vector<vector<Path>> &routes, int start = 0, int goal = -1)
{
	int N = routes.size();
	priority_queue<Path, vector<Path>, greater<Path>> q;
	q.push(Path(start, start, 0));
	
	vector<int> prev(N, -1);
	vector<double> cost(N, INF);
	while (!q.empty())
	{
		Path cur = q.top(); q.pop();
		int i = cur.to;
		if (prev[i] != -1) continue;
		prev[i] = cur.from;
		cost[i] = cur.cost;
		if (i == goal) { break; }
		REP(j, routes[i].size())
		{
			Path next = Path(i, routes[i][j].to, cur.cost + routes[i][j].cost);
			if (prev[next.to] == -1)
				q.push(next);
		}
	}
	return make_pair(cost, prev);
}

//// i/o ////
template <class T>
class vevector : public vector<vector<T>>
{
public:
	vevector(int n = 0, int m = 0) : vector<vector<T>>(n, vector<T>(m)) { };
	vevector(int n, int m, const T &initial) : vector<vector<T>>(n, vector<T>(m, initial)) { };
};

template <class T> T read() { T t; cin >> t; return t; }
template <class T> vector<T> read(int n) { vector<T> v; REP(i,n) { v.push_back(read<T>()); } return v; }
template <class T> vevector<T> read(int n, int m) { vevector<T> v; REP(i,n) v.push_back(read<T>(m)); return v; }
template <class T> vevector<T> readjag(int n) { vevector<T> v; REP(i,n) v.push_back(read<T>(read<int>())); return v; }
template <class T> void write(const T &t) { cout << t << endl; }
template <class T> void write(const T &t, const T &t2) { cout << t << ' ' << t2 << endl; }
template <class T> void write(const vector<T> &v)
{
	ostringstream ss; 
	for (auto x : v) ss << x << ' ';
	auto s = ss.str();
	cout << s.substr(0, s.length() - 1) << endl;
}

struct _Reader { template <class T> _Reader operator ,(T &rhs) { cin >> rhs; return *this; } };
#define READ(t,...) t __VA_ARGS__; _Reader(), __VA_ARGS__

////////////////////
/// template end ///
////////////////////

void solve()
{
	READ(int, N, D, X, Y);
	typedef complex<int> P;
	//typedef map<P, double, COMPARISON_T(P)> MAP;
	typedef unordered_map<P, double, size_t(*)(const P& key)> MAP;
	size_t(*f)(const P& key) = [](const P&key) ->size_t {return key.real() * 19 ^ key.imag(); };
	MAP current(1000, f);
	MAP next = current;

	current[P(0, 0)] = 1.0;
	
	REP(i, N)
	{
		next.clear();
		const P dirs[] = { P(D, 0), P(-D, 0), P(0, D), P(0, -D) };
		for (auto p : current)
		{
			if (p.second > EPS)
			{
				for (auto d : dirs)
				{
					next[p.first + d] += p.second / 4;
				}
			}
		}
		current = next;

		//for (auto p : current)
		//{
		//	cerr << p.first.real() << "," << p.first.imag() << " = " << p.second << endl;
		//}
		//cerr << endl;

	}
	printf("%.16f\n", current[P(X, Y)]);

}

Submission Info

Submission Time
Task D - 大ジャンプ
User ttsuki
Language C++11 (GCC 4.8.1)
Score 100
Code Size 5959 Byte
Status TLE
Exec Time 2032 ms
Memory 3300 KB

Judge Result

Set Name part1 part2 All
Score / Max Score 90 / 90 10 / 10 0 / 1
Status
AC × 23
AC × 36
AC × 47
TLE × 21
Set Name Test Cases
part1 test_1_151403858_0_0AB.txt, test_1_1_0_1AB.txt, test_1_1_2_0AB.txt, test_1_200416616_-430405070_-79858930AB.txt, test_1_320861287_0_0AB.txt, test_1_445441131_0_0AB.txt, test_2_91743015_0_183486030AB.txt, test_3_165357536_496072608_0AB.txt, test_3_357154050_-106436394_768502001AB.txt, test_3_721501125_-568833455_353553641AB.txt, test_3_893846474_0_0AB.txt, test_4_291388018_-291388018_0AB.txt, test_5_318547875_955643625_-637095750AB.txt, test_5_704387671_-704387671_0AB.txt, test_5_82323965_639854915_-688317394AB.txt, test_6_187422602_374845204_-374845204AB.txt, test_6_346164451_0_0AB.txt, test_6_99058019_194123640_-837769837AB.txt, test_7_166330212_166330212_-332660424AB.txt, test_7_89698746_448493730_-179397492AB.txt, test_8_10000000_-40000000_-40000000AB.txt, test_8_10000000_0_80000000AB.txt, test_8_10000000_80000000_0AB.txt
part2 test_10_227248639_454497278_0B.txt, test_11_692637325_-181424149_-938839075B.txt, test_13_260236679_-780710037_-520473358B.txt, test_13_269280357_807841071_269280357B.txt, test_13_96859935_0_-581159610B.txt, test_16_40374395_-40374395_-565241530B.txt, test_1_151403858_0_0AB.txt, test_1_1_0_1AB.txt, test_1_1_2_0AB.txt, test_1_200416616_-430405070_-79858930AB.txt, test_1_320861287_0_0AB.txt, test_1_445441131_0_0AB.txt, test_21_304856339_609712678_914569017B.txt, test_26_214390232_-857560928_428780464B.txt, test_2_91743015_0_183486030AB.txt, test_30_10000000_-300000000_0B.txt, test_30_10000000_0_300000000B.txt, test_30_10000000_150000000_-150000000B.txt, test_30_54228128_0_813421920B.txt, test_3_165357536_496072608_0AB.txt, test_3_357154050_-106436394_768502001AB.txt, test_3_721501125_-568833455_353553641AB.txt, test_3_893846474_0_0AB.txt, test_4_291388018_-291388018_0AB.txt, test_5_318547875_955643625_-637095750AB.txt, test_5_704387671_-704387671_0AB.txt, test_5_82323965_639854915_-688317394AB.txt, test_6_187422602_374845204_-374845204AB.txt, test_6_346164451_0_0AB.txt, test_6_99058019_194123640_-837769837AB.txt, test_7_166330212_166330212_-332660424AB.txt, test_7_89698746_448493730_-179397492AB.txt, test_8_10000000_-40000000_-40000000AB.txt, test_8_10000000_0_80000000AB.txt, test_8_10000000_80000000_0AB.txt, test_9_283198156_849594468_849594468B.txt
All test_1000_1000000_-500000000_500000000.txt, test_1000_1000000_0_-1000000000.txt, test_1000_1000000_1000000000_0.txt, test_1000_150305_97998860_-32315575.txt, test_1000_1_0_0.txt, test_1000_1_2_0.txt, test_1000_1_2_2.txt, test_1000_3308678_-800700076_-350719868.txt, test_1000_3608549_811923525_689232859.txt, test_1000_3728577_-145414503_-969430020.txt, test_1000_537976_11297496_224335992.txt, test_10_227248639_454497278_0B.txt, test_11_692637325_-181424149_-938839075B.txt, test_130_95365311_-667557177_-286095933.txt, test_131_18204705_-145637640_0.txt, test_13_260236679_-780710037_-520473358B.txt, test_13_269280357_807841071_269280357B.txt, test_13_96859935_0_-581159610B.txt, test_16_40374395_-40374395_-565241530B.txt, test_1_151403858_0_0AB.txt, test_1_1_0_1AB.txt, test_1_1_2_0AB.txt, test_1_200416616_-430405070_-79858930AB.txt, test_1_320861287_0_0AB.txt, test_1_445441131_0_0AB.txt, test_210_28974130_0_260767170.txt, test_217_321156_24407856_22480920.txt, test_21_304856339_609712678_914569017B.txt, test_26_214390232_-857560928_428780464B.txt, test_289_421462830_-487186374_-417635361.txt, test_2_91743015_0_183486030AB.txt, test_30_10000000_-300000000_0B.txt, test_30_10000000_0_300000000B.txt, test_30_10000000_150000000_-150000000B.txt, test_30_54228128_0_813421920B.txt, test_339_4475128_957677392_281933064.txt, test_3_165357536_496072608_0AB.txt, test_3_357154050_-106436394_768502001AB.txt, test_3_721501125_-568833455_353553641AB.txt, test_3_893846474_0_0AB.txt, test_480_402960_-131767920_-34654560.txt, test_4_291388018_-291388018_0AB.txt, test_507_3516183_-879045750_-253165176.txt, test_515_8606048_-25818144_8606048.txt, test_522_2286376_-230923976_-18291008.txt, test_5_318547875_955643625_-637095750AB.txt, test_5_704387671_-704387671_0AB.txt, test_5_82323965_639854915_-688317394AB.txt, test_676_198114948_0_792459792.txt, test_688_151937211_-286341114_10198771.txt, test_6_187422602_374845204_-374845204AB.txt, test_6_346164451_0_0AB.txt, test_6_99058019_194123640_-837769837AB.txt, test_71_367604060_367604060_0.txt, test_752_120973200_0_-725839200.txt, test_772_881340073_0_0.txt, test_777_125719576_-499451637_822057459.txt, test_7_166330212_166330212_-332660424AB.txt, test_7_89698746_448493730_-179397492AB.txt, test_839_166155061_0_-332310122.txt, test_839_923157_923157_564972084.txt, test_849_415705_290993500_0.txt, test_873_418406_2928842_322172620.txt, test_8_10000000_-40000000_-40000000AB.txt, test_8_10000000_0_80000000AB.txt, test_8_10000000_80000000_0AB.txt, test_981_159373724_-637494896_-159373724.txt, test_9_283198156_849594468_849594468B.txt
Case Name Status Exec Time Memory
sample_01.txt AC 22 ms 812 KB
sample_02.txt AC 77 ms 1180 KB
sample_03.txt AC 21 ms 932 KB
test_1000_1000000_-500000000_500000000.txt TLE 2030 ms 3300 KB
test_1000_1000000_0_-1000000000.txt TLE 2030 ms 3212 KB
test_1000_1000000_1000000000_0.txt TLE 2030 ms 3284 KB
test_1000_150305_97998860_-32315575.txt TLE 2031 ms 3260 KB
test_1000_1_0_0.txt TLE 2030 ms 3048 KB
test_1000_1_2_0.txt TLE 2030 ms 2992 KB
test_1000_1_2_2.txt TLE 2030 ms 2972 KB
test_1000_3308678_-800700076_-350719868.txt TLE 2030 ms 3244 KB
test_1000_3608549_811923525_689232859.txt TLE 2029 ms 3296 KB
test_1000_3728577_-145414503_-969430020.txt TLE 2030 ms 3284 KB
test_1000_537976_11297496_224335992.txt TLE 2032 ms 3176 KB
test_10_227248639_454497278_0B.txt AC 24 ms 804 KB
test_11_692637325_-181424149_-938839075B.txt AC 24 ms 776 KB
test_130_95365311_-667557177_-286095933.txt AC 110 ms 1316 KB
test_131_18204705_-145637640_0.txt AC 106 ms 1316 KB
test_13_260236679_-780710037_-520473358B.txt AC 22 ms 736 KB
test_13_269280357_807841071_269280357B.txt AC 22 ms 928 KB
test_13_96859935_0_-581159610B.txt AC 23 ms 812 KB
test_16_40374395_-40374395_-565241530B.txt AC 23 ms 932 KB
test_1_151403858_0_0AB.txt AC 23 ms 740 KB
test_1_1_0_1AB.txt AC 22 ms 736 KB
test_1_1_2_0AB.txt AC 21 ms 800 KB
test_1_200416616_-430405070_-79858930AB.txt AC 22 ms 924 KB
test_1_320861287_0_0AB.txt AC 23 ms 928 KB
test_1_445441131_0_0AB.txt AC 22 ms 920 KB
test_210_28974130_0_260767170.txt AC 254 ms 1708 KB
test_217_321156_24407856_22480920.txt AC 265 ms 1712 KB
test_21_304856339_609712678_914569017B.txt AC 23 ms 800 KB
test_26_214390232_-857560928_428780464B.txt AC 24 ms 808 KB
test_289_421462830_-487186374_-417635361.txt AC 473 ms 1924 KB
test_2_91743015_0_183486030AB.txt AC 23 ms 812 KB
test_30_10000000_-300000000_0B.txt AC 26 ms 932 KB
test_30_10000000_0_300000000B.txt AC 26 ms 1052 KB
test_30_10000000_150000000_-150000000B.txt AC 26 ms 920 KB
test_30_54228128_0_813421920B.txt AC 24 ms 852 KB
test_339_4475128_957677392_281933064.txt AC 625 ms 2124 KB
test_3_165357536_496072608_0AB.txt AC 21 ms 924 KB
test_3_357154050_-106436394_768502001AB.txt AC 21 ms 800 KB
test_3_721501125_-568833455_353553641AB.txt AC 21 ms 800 KB
test_3_893846474_0_0AB.txt AC 21 ms 796 KB
test_480_402960_-131767920_-34654560.txt AC 1244 ms 2792 KB
test_4_291388018_-291388018_0AB.txt AC 21 ms 804 KB
test_507_3516183_-879045750_-253165176.txt AC 1388 ms 2780 KB
test_515_8606048_-25818144_8606048.txt AC 1453 ms 2920 KB
test_522_2286376_-230923976_-18291008.txt AC 1470 ms 2912 KB
test_5_318547875_955643625_-637095750AB.txt AC 21 ms 928 KB
test_5_704387671_-704387671_0AB.txt AC 21 ms 924 KB
test_5_82323965_639854915_-688317394AB.txt AC 22 ms 728 KB
test_676_198114948_0_792459792.txt TLE 2031 ms 3292 KB
test_688_151937211_-286341114_10198771.txt TLE 2030 ms 3296 KB
test_6_187422602_374845204_-374845204AB.txt AC 22 ms 924 KB
test_6_346164451_0_0AB.txt AC 21 ms 928 KB
test_6_99058019_194123640_-837769837AB.txt AC 22 ms 736 KB
test_71_367604060_367604060_0.txt AC 44 ms 1056 KB
test_752_120973200_0_-725839200.txt TLE 2029 ms 3228 KB
test_772_881340073_0_0.txt TLE 2030 ms 3292 KB
test_777_125719576_-499451637_822057459.txt TLE 2029 ms 3292 KB
test_7_166330212_166330212_-332660424AB.txt AC 21 ms 924 KB
test_7_89698746_448493730_-179397492AB.txt AC 23 ms 808 KB
test_839_166155061_0_-332310122.txt TLE 2030 ms 3292 KB
test_839_923157_923157_564972084.txt TLE 2030 ms 3248 KB
test_849_415705_290993500_0.txt TLE 2030 ms 3284 KB
test_873_418406_2928842_322172620.txt TLE 2030 ms 3300 KB
test_8_10000000_-40000000_-40000000AB.txt AC 23 ms 808 KB
test_8_10000000_0_80000000AB.txt AC 23 ms 812 KB
test_8_10000000_80000000_0AB.txt AC 23 ms 800 KB
test_981_159373724_-637494896_-159373724.txt TLE 2031 ms 3300 KB
test_9_283198156_849594468_849594468B.txt AC 22 ms 796 KB