# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
826921 | Hanksburger | Festivals in JOI Kingdom 2 (JOI23_festival2) | C++17 | 9091 ms | 212 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;
vector<pair<int, int> > vec, vec2;
int a[40005];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, p, ans=0;
cin >> n >> p;
for (int i=1; i<=n*2; i++)
a[i]=i;
do
{
int ok=1;
for (int i=1; i<n; i++)
{
if (a[i]>a[i+1])
{
ok=0;
break;
}
}
for (int i=1; i<=n; i++)
{
if (a[i]>a[i+n])
{
ok=0;
break;
}
}
if (ok)
{
vec.clear();
vec2.clear();
for (int i=1; i<=n; i++)
{
vec.push_back({a[i], a[i+n]});
vec2.push_back({a[i+n], a[i]});
}
sort(vec.begin(), vec.end());
sort(vec2.begin(), vec2.end());
int res=0, res2=0, pre=0, pre2=0;
for (int i=0; i<vec.size(); i++)
{
if (pre<vec[i].first)
{
pre=vec[i].second;
res++;
}
}
for (int i=0; i<vec2.size(); i++)
{
if (pre2<vec2[i].second)
{
pre2=vec2[i].first;
res2++;
}
}
if (res<res2)
ans++;
}
}
while (next_permutation(a+1, a+n*2+1));
cout << ans%p;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |