Submission #1287763

#	Time	Username	Problem	Language	Result	Execution time	Memory
1287763		hssaan_arif	Binaria (CCO23_day1problem1)	C++20	0 / 25	9 ms	8256 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define endl "\n"
#define pb push_back
#define int long long

const int N = 1e6 + 5, M = 1e6 + 3, LG = 20;

int n , k , A[N] , F[N];

int pw(int a , int b){
    if (a == 1 || b == 0) return 1;
    int p = pw(a,b/2);
    if (b&1){
        return ((p*p)%M * a)%M;
    }else{
        return (p*p)%M;
    }
}

int C(int n , int r){
    if (r > n) return 0;
    return (F[n] * (pw((F[r] * F[n-r])%M , M - 2)))%M;
}

void solve(){
    cin >> n >> k;
    for (int i=0 ; i<(n-k+1) ; i++) cin >> A[i];
    for (int i=0 ; i<(n-k) ; i++){
        if (abs(A[i]-A[i+1]) >= 2){
            cout << 0 << endl;
            return;
        }
    }
    int ans = C(k,A[0]);
    for (int j=0 ; j<n-k ; j++){
        int i = (j%(k));
        if (A[j] == A[j+1]) continue;
        if (A[j] > A[j+1]){
            ans = (ans - C(k-1,A[0]) + M)%M;
            // cout << i << endl;
        }else{
            ans = (ans - C(k-1,A[0]-1) + M)%M;
            // cout << i << endl;
        }
    }
    cout << ans << endl;
}

signed main(){
    F[0] = 1;
    for (int i=1 ; i<N ; i++) F[i] = (F[i-1]*i)%M;
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int ts = 1;
    // cin >> ts;
    while(ts--){
        solve();
    }
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 3
• Subtask 3: 0 / 4
• Subtask 4: 0 / 4
• Subtask 5: 0 / 4
• Subtask 6: 0 / 7