제출 #1287904

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1287904		hssaan_arif	Binaria (CCO23_day1problem1)	C++20	25 / 25	56 ms	16084 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){
    a%=M;
    if (a == 0) return 0;
    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=1 ; i<=(n-k+1) ; i++) cin >> a[i];
    int c=a[1];
    int x=k;
    vector<int>h(k);
    for (int i=2;i<=n-k+1;i++){
        if (a[i]<a[i-1] and !h[i%k]){
            c--;
            x--;
            h[i%k]=1;
        }
        else if(a[i]>a[i-1] and !h[i%k]){
            x--;
            h[i%k]=1;
        }
    }
    // cout << s << ' ' << o << endl;
    cout << C(x,c) << 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: 3 / 3
• Subtask 2: 3 / 3
• Subtask 3: 4 / 4
• Subtask 4: 4 / 4
• Subtask 5: 4 / 4
• Subtask 6: 7 / 7