답안 #96512 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
96512	2019-02-10T03:24:28 Z	qkxwsm	힘 센 거북 (IZhO11_turtle)	C++14	10 / 100	103 ms	51708 KB

turtle

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();

struct custom_hash
{
	template<class T>
	unsigned long long operator()(T v) const
	{
		unsigned long long x = v;
		x += FIXED_RANDOM;
		// x += 11400714819323198485ull;
		// x = (x ^ (x >> 30)) * 13787848793156543929ull;
		x = (x ^ (x >> 27)) * 10723151780598845931ull;
		return x ^ (x >> 31);
	}
};

template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T, class U> using hash_table = gp_hash_table<T, U, custom_hash>;

template<class T>
T randomize(T mod)
{
	return (uniform_int_distribution<T>(0, mod - 1))(rng);
}
template<class T>
void readi(T &x)
{
	x = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		x = x * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		x = -x;
	}
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int buf[20], n = 0;
	while(output)
	{
		buf[n] = ((output % 10));
		output /= 10;
		n++;
	}
	for (n--; n >= 0; n--)
	{
		putchar(buf[n] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
long long expo(long long a, long long e, long long mod)
{
	return ((e == 0) ? 1 : ((expo(a * a % mod, e >> 1, mod)) * ((e & 1) ? a : 1) % mod));
}
template<class T, class U>
void nmod(T &x, U mod)
{
	if (x >= mod) x -= mod;
}
template<class T>
T gcd(T a, T b)
{
	return (b ? gcd(b, a % b) : a);
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define DBG(x) cerr << #x << " = " << (x) << endl
#define SZ(x) ((int) ((x).size()))
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-9;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 300013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef vector<pdd> vpd;

int N, M, K, T;
ll MOD;
pii coor[MAXN];
ll dp[2013][2013];
ll ans = 0;

ll choose(ll a, ll b)
{
	return dp[a][b];
	// cerr << a << ' ' << b << endl;
}

int32_t main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	// cout << fixed << setprecision(10);
	// cerr << fixed << setprecision(10);
	// if (fopen("file.in", "r"))
	// {
	// 	freopen ("file.in", "r", stdin);
	// 	freopen ("file.out", "w", stdout);
	// }
	cin >> N >> M >> K >> T >> MOD;
	FOR(i, 0, K)
	{
		cin >> coor[i].fi >> coor[i].se;
	}
	dp[0][0] = 1;
	FOR(i, 1, N + M + 10)
	{
		dp[i][0] = dp[i][i] = 1;
		FOR(j, 1, i) dp[i][j] = (dp[i - 1][j] + dp[i - 1][j - 1]) % MOD;
	}
	sort(coor, coor + K);
	ans = choose(N + M, M);
	FOR(mask, 1, (1 << K))
	{
		if (__builtin_popcount(mask) <= T) continue;
		ll cur = ((__builtin_popcount(mask) ^ T & 1) ? -1 : 1);
		pii block = MP(0, 0);
		FOR(i, 0, K)
		{
			if (!(mask & (1 << i))) continue;
			if (coor[i].se < block.se)
			{
				cur = 0;
				break;
			}
			cur *= choose(coor[i].fi - block.fi + coor[i].se - block.se, coor[i].se - block.se);
		}
		ans += cur;
	}
	cout << ans << '\n';
	// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}
/* READ READ READ
* int overflow, maxn too small, special cases (n=1?, two distinct?), cin.tie() interactive
* reread the problem, try small cases
* note down possible sources of error as you go
* do smth instead of nothing
*/

Compilation message

turtle.cpp: In function 'int32_t main()':
turtle.cpp:191:43: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   ll cur = ((__builtin_popcount(mask) ^ T & 1) ? -1 : 1);
                                         ~~^~~

Subtask #1
10.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Incorrect	2 ms	376 KB	Output isn't correct
3	Incorrect	2 ms	760 KB	Output isn't correct
4	Incorrect	1 ms	1016 KB	Output isn't correct
5	Correct	5 ms	2172 KB	Output is correct
6	Incorrect	17 ms	8440 KB	Output isn't correct
7	Incorrect	21 ms	12280 KB	Output isn't correct
8	Incorrect	44 ms	23160 KB	Output isn't correct
9	Runtime error	95 ms	51708 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
10	Runtime error	99 ms	51664 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
11	Runtime error	95 ms	51600 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
12	Runtime error	93 ms	51636 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
13	Runtime error	94 ms	51704 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
14	Runtime error	93 ms	51692 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
15	Runtime error	96 ms	51684 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
16	Runtime error	95 ms	51704 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
17	Runtime error	93 ms	51700 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
18	Runtime error	96 ms	51660 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
19	Runtime error	103 ms	51676 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
20	Runtime error	95 ms	51708 KB	Execution killed with signal 11 (could be triggered by violating memory limits)

답안 #96512

Compilation message

Subtask #1 10.0 / 100.0

Subtask #1
10.0 / 100.0