#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> l;
struct node{
int left, right;
int idx;
};
vector<int> pos;
vector<node> a;
int test(int l, int r){
int cnt = 0;
int ptr = 0;
for (int i=0; i<a.size(); i++){
if (a[i].idx == -1) continue;
if (l <= a[i].left && a[i].left < r) continue;
if (l < a[i].right && a[i].right <= r) continue;
if (a[i].left < ptr) continue;
cnt++;
ptr = a[i].right;
}
return cnt;
}
void erase_inter(int l, int r){
for (int i=0; i<a.size(); i++){
if (l <= a[i].left && a[i].left < r) a[i].idx = -1;
if (l < a[i].right && a[i].right <= r) a[i].idx = -1;
}
}
signed main(){
cin.tie(0)->sync_with_stdio(0);
int n, k; cin >> n >> k;
l.resize(n), a.resize(n);
for (int i=0; i<n; i++){
cin >> a[i].left >> a[i].right;
a[i].idx = i;
l[i] = a[i].left;
}
sort(l.begin(), l.end());
l.resize(unique(l.begin(), l.end()) - l.begin());
for (int i=0; i<a.size(); i++){
a[i].left = lower_bound(l.begin(), l.end(), a[i].left) - l.begin();
a[i].right = lower_bound(l.begin(), l.end(), a[i].right) - l.begin();
}
sort(a.begin(), a.end(), [](const node &x, const node &y){
return x.right < y.right;
});
if (test(-1, -1) < k){
cout << "-1\n";
return 0;
}
while (k){
pos.assign(n, -1);
for (int i=0; i<a.size(); i++){
if (a[i].idx == -1) continue;
pos[a[i].idx] = i;
}
for (int i=0; i<pos.size(); i++){
if (pos[i] == -1) continue;
if (test(a[pos[i]].left, a[pos[i]].right) + 1 < k){
a[pos[i]].idx = -1;
continue;
}
a[pos[i]].idx = -1;
erase_inter(a[pos[i]].left, a[pos[i]].right);
cout << i+1 << "\n";
break;
}
k--;
}
}
Compilation message
event2.cpp: In function 'int test(int, int)':
event2.cpp:14:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<node>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
14 | for (int i=0; i<a.size(); i++){
| ~^~~~~~~~~
event2.cpp: In function 'void erase_inter(int, int)':
event2.cpp:25:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<node>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
25 | for (int i=0; i<a.size(); i++){
| ~^~~~~~~~~
event2.cpp: In function 'int main()':
event2.cpp:41:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<node>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
41 | for (int i=0; i<a.size(); i++){
| ~^~~~~~~~~
event2.cpp:54:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<node>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
54 | for (int i=0; i<a.size(); i++){
| ~^~~~~~~~~
event2.cpp:58:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
58 | for (int i=0; i<pos.size(); i++){
| ~^~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Execution timed out |
3093 ms |
2276 KB |
Time limit exceeded |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Execution timed out |
3093 ms |
2276 KB |
Time limit exceeded |
| 5 |
Halted |
0 ms |
0 KB |
- |
