-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path2059B.cpp
More file actions
61 lines (53 loc) · 1.37 KB
/
2059B.cpp
File metadata and controls
61 lines (53 loc) · 1.37 KB
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
// coded by Cocane
#include<bits/stdc++.h>
#define ll long long
#define forn(i, n) for(int i = 0; i < n; i++)
#define for1(i, n) for(int i = 1; i <= n; i++)
#define foru(i, n) for(int i = n-1; i >= 0; i--)
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define allp(x) (x).begin(), (x).begin() + (x).size()/2, (x).rbegin()
#define pb push_back
#define ppb pop_back
#define read(a) for(auto &i: a) cin >> i
#define out(ans) cout<<ans<<endl
#define yn(a) cout<< (a ? "YES": "NO") <<endl
using namespace std;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef double dl;
void solve(){
int n, k;
cin >> n >> k;
k /= 2;
vi a(n);
read(a);
if(2 * k == n){
for(int i = 1; i < n; i += 2){
if(a[i] != (i + 1) / 2){
out((i + 1) / 2);
return;
}
}
out(k + 1);
} else {
for(int i = 1; i <= n - 2 * k + 1; i++){
if(a[i] != 1){
out(1);
return;
}
}
out(2);
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while(t--){
solve();
}
return 0;
}