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;
#ifdef LOCAL
#include <debug.h>
#else
#define debug(...)
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define FRN(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
END OF TEMPLATE
----------------------------------------------------------------
Tran The Bao - ghostwriter
Training for VOI23 gold medal
----------------------------------------------------------------
GOAT
----------------------------------------------------------------
*/
const int N = 1e6 + 1;
int n, a[N], b[N], rs = 0;
vi f, s;
void brute(int i) {
if (i > n) {
bool ok = 1;
EACH(i, f)
EACH(j, f)
if (a[i] < a[j] && a[j] <= b[i] && b[i] <= b[j])
ok = 0;
EACH(i, s)
EACH(j, s)
if (a[i] < a[j] && a[j] <= b[i] && b[i] <= b[j])
ok = 0;
rs += ok;
return;
}
f.pb(i);
brute(i + 1);
f._pb();
s.pb(i);
brute(i + 1);
s._pb();
}
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
// freopen(file".inp", "r", stdin);
// freopen(file".out", "w", stdout);
cin >> n;
FOR(i, 1, n) cin >> a[i] >> b[i];
brute(1);
cout << rs;
return 0;
}
/*
----------------------------------------------------------------
From Benq:
stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/
Compilation message (stderr)
port_facility.cpp: In function 'void brute(int)':
port_facility.cpp:36:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
36 | #define EACH(i, x) for (auto &(i) : (x))
| ^
port_facility.cpp:57:3: note: in expansion of macro 'EACH'
57 | EACH(i, f)
| ^~~~
port_facility.cpp:36:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
36 | #define EACH(i, x) for (auto &(i) : (x))
| ^
port_facility.cpp:58:3: note: in expansion of macro 'EACH'
58 | EACH(j, f)
| ^~~~
port_facility.cpp:36:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
36 | #define EACH(i, x) for (auto &(i) : (x))
| ^
port_facility.cpp:61:3: note: in expansion of macro 'EACH'
61 | EACH(i, s)
| ^~~~
port_facility.cpp:36:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
36 | #define EACH(i, x) for (auto &(i) : (x))
| ^
port_facility.cpp:62:3: note: in expansion of macro 'EACH'
62 | EACH(j, s)
| ^~~~
port_facility.cpp: In function 'int main()':
port_facility.cpp:32:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
| ^
port_facility.cpp:80:5: note: in expansion of macro 'FOR'
80 | FOR(i, 1, n) cin >> a[i] >> b[i];
| ^~~
# | 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... |