#include <iostream>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <string>
#include <numeric>
#include <cmath>
#include <cassert>
#include <array>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = 1e18;
int main()
{
cin.tie(0)->sync_with_stdio(0);
int n, m;
cin >> n >> m;
vector<pair<int, int>> we(n);
vector<pair<int, int>> closest;
closest.reserve(2*n);
for (int i = 0; i < n; ++i)
{
cin >> we[i].first >> we[i].second;
closest.push_back({we[i].first, i * 2});
closest.push_back({we[i].second, i * 2 + 1});
}
sort(closest.begin(), closest.end());
vector<int> adj(2 * n, -1);
for (int i = 0; i < n; ++i)
{
auto it = upper_bound(closest.begin(), closest.end(), pair(we[i].second, (int)1e9));
if (it != closest.end()) adj[2 * i] = it->second;
it = upper_bound(closest.begin(), closest.end(), pair(we[i].first, (int)1e9));
if (it != closest.end()) adj[2 * i + 1] = it->second;
}
int start = closest.front().second;
vector<bool> used(2 * n);
auto dfs = [&adj, &used](auto self, int v) -> int
{
int res=0;
while(v!=-1 and !used[v]) {
used[v]=true;
v = adj[v];
res+=1;
}
return res;
};
int res = dfs(dfs, start);
vector<int> comps;
comps.reserve(n*2);
for (int i = 0; i < 2 * n; ++i) if (!used[i]) comps.push_back(dfs(dfs, i));
sort(comps.rbegin(), comps.rend());
for (int i = 0; i < min(m, (int)comps.size()); ++i) res += comps[i] + 2;
m -= (int)comps.size();
m = max(m, 0);
res += 2 * (m - m % 2);
res += m % 2;
cout << res;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
340 KB |
Output is correct |
2 |
Correct |
6 ms |
648 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
340 KB |
Output is correct |
2 |
Correct |
7 ms |
708 KB |
Output is correct |
3 |
Correct |
22 ms |
1296 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
724 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
11 ms |
852 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
91 ms |
4508 KB |
Output is correct |
2 |
Correct |
248 ms |
10208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
153 ms |
7316 KB |
Output is correct |
2 |
Correct |
418 ms |
14872 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
575 ms |
21624 KB |
Output is correct |
2 |
Correct |
767 ms |
25892 KB |
Output is correct |
3 |
Correct |
830 ms |
29360 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
994 ms |
29396 KB |
Output is correct |
2 |
Execution timed out |
1004 ms |
32272 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1038 ms |
31800 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |