Submission #1287685

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

Main

// #include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <vector>
#include <iomanip>
#include <string>
#include <queue>
#include <set>
#include <deque>
using namespace std;
#define int long long
#define endl "\n"
#define fi first
#define se second
const int M=1e6+3;
const int inf = 1e14;
const int LOG=18;
const int N=1e6+5;
int n , m , c , w , k , t=1 , q=1 , x , y , z , l , r;
int dp[N][2];
int bp(int x,int y){
    x=x%M;
    if (y==0)return 1;
    if (y==1)return x;
    int r=bp(x*x,y/2);
    if (y%2)r*=x;
    return r%M;
}
int inv(int x){
    return bp(x,M-2);
}
int fn[N];
int C(int n,int k){
    return (fn[n]*inv(fn[k]*fn[n-k]))%M;
}
void solve()
{   
    cin >> n >> k;
    vector<int>a(n-k+2);
    for (int i=1;i<=n-k+1;i++){
        cin >> a[i];
    }
    c=a[1];
    x=k;
    for (int i=2;i<=min(k,n-k+1);i++){
        if (a[i]<a[i-1]){
            c--;
            x--;
        }
        else if(a[i]>a[i-1]){
            x--;
        }
    }
    if (x<c){
        cout << 0 << endl;
    }
    else{
        cout << C(x,c) << endl;
    }

}
signed main()    
{

    ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
    cin.tie(0), cout.tie(0);//DO NOT USE IN INTERACTIVE
    cout << fixed << setprecision(9);
    srand(time(0));
    // int t=1;
    // cin >> t;
    fn[0]=1;
    for (int i=1;i<N;i++){
        fn[i]=(fn[i-1]*i)%M;
    }
    for (int _=1;_<=t;_++){
        solve();
        q++;
    }
} 

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