-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathB.cpp
81 lines (69 loc) · 2.07 KB
/
B.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
#include <algorithm>
#include <bits/stdc++.h>
#include <regex>
using namespace std;
#define nl '\n'
//----------------------------------- DEBUG -----------------------------------
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
// debug & operator << (debug & dd, P p) { dd << "(" << p.x << ", " << p.y << ")"; return dd; }
//----------------------------------- END DEBUG --------------------------------
void run_cases() {
int N, K;
cin >> N >> K;
vector<int> A(N);
for(auto &u: A)
cin >> u;
vector<int> S = A;
sort(S.begin(), S.end());
S.erase(unique(S.begin(), S.end()), S.end());
debug() << imie(S);
int partitions = 1;
for(int i = 0; i < N - 1; i++) {
if(A[i] > A[i + 1]) {
partitions++;
} else {
int small_index = lower_bound(S.begin(), S.end(), A[i]) - S.begin();
int large_index = lower_bound(S.begin(), S.end(), A[i + 1]) - S.begin();
debug() << imie(small_index) imie(large_index);
if(large_index - small_index > 1) {
partitions++;
}
}
}
cout << (partitions <= K ? "YES" : "NO") << '\n';
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(nullptr);
int tests = 1;
cin >> tests;
for(int test = 1;test <= tests;test++) {
run_cases();
}
}