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;
#define int int64_t
#define ld long double
#define ar array
const int INF = 1e12;
const int MOD = 1e9+7;
void solve() {
int N; cin >> N;
vector<ar<int,3>> A;
for (int i = 0; i < N; i++) {
int s, e; cin >> s >> e;
A.push_back({s, i, 1});
A.push_back({e, i, 0});
}
sort(A.begin(), A.end());
int ans = 0;
for (int i = 0; i < (1 << N); i++) {
stack<int> remdi[2];
bool omk = true;
for (auto [t, j, x] : A) {
if (x) remdi[(i >> j) & 1].push(j);
else {
if (!remdi[0].empty() && remdi[0].top() == j) remdi[0].pop();
else if (!remdi[1].empty() && remdi[1].top() == j) remdi[1].pop();
else omk = false;
}
}
ans += omk;
}
cout << ans << '\n';
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int t = 1; //cin >> t;
while (t--) solve();
}
# | 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... |