# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
827143 | Hanksburger | Festivals in JOI Kingdom 2 (JOI23_festival2) | C++17 | 9072 ms | 320 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[2][35], n, p, ans;
void recur(int ind)
{
if (ind>n*2)
{
vec.clear();
vec2.clear();
for (int i=1; i<=n; i++)
{
vec.push_back({a[0][i], a[1][i]});
vec2.push_back({a[1][i], a[0][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++;
return;
}
for (int i=1; i<=n; i++)
{
if ((i==1 || a[0][i-1]) && !a[0][i])
{
a[0][i]=ind;
recur(ind+1);
a[0][i]=0;
}
}
for (int i=1; i<=n; i++)
{
if (a[0][i] && !a[1][i])
{
a[1][i]=ind;
recur(ind+1);
a[1][i]=0;
}
}
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
recur(1);
cout << ans; // remember to put p back here later
}
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... |