# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
967900 | duckindog | Boat (APIO16_boat) | C++17 | 298 ms | 440 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;
const int N = 500 + 10;
int n;
int a[N], b[N];
int32_t main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n;
for (int i = 1; i <= n; ++i) cin >> a[i] >> b[i];
int answer = 0;
for (int bit = 1; bit < (1 << n - 1); ++bit) {
int ma = 0;
bool pass = true;
for (int i = 1; i <= n; ++i) {
if (bit >> i - 1 & 1) {
pass &= (a[i] > ma);
ma = max(ma, a[i]);
}
}
answer += pass;
}
cout << answer << "\n";
}
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... |