Submission #3263545

---

Source Code Expand

#include<bits/stdc++.h>
#include<iostream>
#include<vector>
#include<utility>
#include<functional>
#include<algorithm>
#include<queue>
#include<map>
#include<string>
#include<numeric>


#define FOR(i, a, b) for(int i=a; i<b; i++)
#define COUT(a) cout << a << endl;

using namespace std;
using Int = long long;
using P = pair<Int, Int>;


int main(){
    Int N, K;

    cin >> N >> K;
    vector<Int> A(N);

    Int ind_i = 0;

    FOR(i, 0, N) {
        cin >> A[i];
        if (A[i] == 1){
            ind_i = i + 1;
        }
    }

    if (N == K){
        COUT(1);
    }else{
        Int add = 0;
        if((ind_i % K) > 0) add++;
        if((N - ind_i + 1) % (K-1) > 0) add++;
        if(N/2 +1 < ind_i ) add--;
        COUT((ind_i/K)  + ((N-ind_i + 1) / (K-1) ) + add);
    }



}

Submission Info

Judge Result