# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
171081 | SamAnd | Energetic turtle (IZhO11_turtle) | C++17 | 335 ms | 28572 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int K = 22, N = 2003;
int M;
struct ban
{
int x, y;
ban()
{
x = y = 0;
}
ban(int x, int y)
{
this->x = x;
this->y = y;
}
};
bool operator<(const ban& a, const ban& b)
{
if (a.x < b.x)
return true;
if (a.x > b.x)
return false;
return a.y < b.y;
}
int c[N][N];
void pre()
{
for (int i = 0; i < N; ++i)
{
c[i][0] = 1;
for (int j = 1; j <= i; ++j)
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % M;
}
}
int n, m, k, t;
ban a[K];
int u[K];
int main()
{
scanf("%d%d%d%d%d", &n, &m, &k, &t, &M);
for (int i = 0; i < k; ++i)
scanf("%d%d", &a[i].x, &a[i].y);
sort(a, a + k);
pre();
for (int x = 0; x < (1 << k); ++x)
{
vector<ban> v;
for (int i = 0; i < k; ++i)
{
if ((x & (1 << i)))
v.push_back(a[i]);
}
bool z = false;
for (int i = 0; i < (int)v.size() - 1; ++i)
{
if (v[i].x > v[i + 1].x || v[i].y > v[i + 1].y)
{
z = true;
break;
}
}
if (z)
continue;
if (v.empty())
{
u[0] = c[n + m][n];
continue;
}
int yans = c[v[0].x + v[0].y][v[0].y];
for (int i = 0; i < (int)v.size() - 1; ++i)
{
yans = (yans * 1LL * c[v[i + 1].x - v[i].x + v[i + 1].y - v[i].y][v[i + 1].y - v[i].y]) % M;
}
u[v.size()] = (u[v.size()] + yans) % M;
}
int ans = 0;
for (int i = 0; i <= t; ++i)
{
for (int j = i; j <= k; ++j)
{
if ((j - i) % 2 == 0)
ans = (ans + u[j]) % M;
else
ans = (ans - u[j] + M) % M;
}
}
printf("%d\n", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |