# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
871922 | tvladm2009 | Event Hopping 2 (JOI21_event2) | C++17 | 41 ms | 3036 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 i64 = long long;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int n, k;
std::cin >> n >> k;
std::vector<int> l(n), r(n);
for (int i = 0; i < n; i++) {
std::cin >> l[i] >> r[i];
}
if (n <= 20) {
std::vector<std::vector<int>> good;
for (int mask = 1; mask < (1 << n); mask++) {
if (__builtin_popcount(mask) != k) {
continue;
}
std::vector<std::pair<int, int>> v;
for (int b = 0; b < n; b++) {
if (mask & (1 << b)) {
v.push_back({l[b], r[b]});
}
}
sort(v.begin(), v.end());
bool ok = true;
for (int i = 1; i < v.size(); i++) {
if (v[i].first < v[i - 1].second) {
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... |