#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
int ai, bi;
cin >> ai >> bi;
a[i] = ai; // aᵢ == bᵢ en la subtarea 1
}
int total = 0;
for (int mask = 1; mask < (1 << n); ++mask) {
vector<int> vals;
for (int i = 0; i < n; ++i)
if (mask & (1 << i))
vals.push_back(a[i]);
if (is_sorted(vals.begin(), vals.end()) &&
adjacent_find(vals.begin(), vals.end()) == vals.end()) {
total++;
}
}
cout << total << '\n';
}
# | 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... |