oj.uz

Submission #1016083

# Submission time Handle Problem Language Result Execution time Memory
1016083 2024-07-07T11:32:06 Z Khanhcsp2 Binaria (CCO23_day1problem1) C++14
0 / 25
 1 ms 4696 KB 
#include<bits/stdc++.h>
#define el '\n'
#define fi first
#define sc second
#define int ll
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
const int mod=1e6+3;
const int N=1e6+11;
int n, k, a[N], ned[N], f[N];
int po(int a, int b)
{
    int r=1;
    while(b)
    {
        if(b&1) r=r*a%mod;
        b/=2;
        a=a*a%mod;
    }
    return r%mod;
}
void sol()
{
    cin >> n >> k;
    for(int i=1;i<=n-k+1;i++) cin >> a[i];
    for(int i=1;i<=n;i++) ned[i]=-1;
    for(int i=1;i<=n-k;i++)
    {
        if(abs(a[i]-a[i+1])>=2)
        {
            cout << 0;
            return;
        }
        if(a[i]>a[i+1])
        {
            if(ned[i]==0)
            {
                cout << 0;
                return;
            }
            ned[i]=1;
        }
        else if(a[i]<a[i+1])
        {
            if(ned[i]==1)
            {
                cout << 0;
                return;
            }
            ned[i]=0;
        }
        else if(a[i]==a[i+1])
        {
//            if(ned[i]!=-1 && ned[i+k]!=-1)
//            {
//                if(ned[i]!=ned[i+k])
//                {
//                    cout << 0;
//                    return;
//                }
//            }
//            else ned[i]=ned[i+k];
            ned[i]=ned[i+k];
        }
    }
    f[0]=1;
    int s1=a[1], s2=0;
    for(int i=1;i<=k;i++)
    {
        if(ned[i]==1) s1--;
        else if(ned[i]==-1) s2++;
    }
    for(int i=1;i<=n;i++) f[i]=f[i-1]*i%mod;
    cout << f[s2]*po(f[s1], mod-2)%mod*po(f[s2-s1], mod-2)%mod;

}
signed main()
{
//    freopen("divisor.INP", "r", stdin);
//    freopen("divisor.OUT", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    //cin >> t;
    while(t--)
    {
        sol();
    }
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4560 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4560 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4560 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4560 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4560 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4560 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -