Submission #988305

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
988305	2024-05-24 12:41:42	Abdalaziz_Alshami	Binaria (CCO23_day1problem1)	C++17	0 / 25	18 ms	24052 KiB

Main

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
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e6+1,mod=1e6+3;
int fac[N],ifac[N],a[N];
int pxp(int x,int p)
{
  if(!p) return 1;
  if(p&1) return (x*pxp(x,p-1)%mod)%mod;
  int ret=pxp(x,p/2);
  return (ret*ret)%mod;
}
signed main()
{
  ios::sync_with_stdio(0); cin.tie(0);
  fac[0]=1;
  for(int i=1;i<N;i++) fac[i]=(fac[i-1]*i)%mod;
  ifac[N-1]=pxp(fac[N-1],mod-2);
  for(int i=N-2;i>=0;i--) ifac[i]=(ifac[i+1]*(i+1))%mod;
  
  
  int n,k; cin>>n>>k;
  int b[n-k+1]; for(int i=0;i<n-k+1;i++) cin>>b[i];
  memset(a,-1,sizeof a);
  bool f=false;
  for(int i=0;i<n-k;i++){
    if(a[i]==-1){
      if(b[i]>b[i+1]) a[i]=1,a[i+k]=0;
      else if(b[i]<b[i+1]) a[i]=0,a[i+k]=1;
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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