oj.uz

Submission #851493

# Submission time Handle Problem Language Result Execution time Memory
851493 2023-09-20T01:26:15 Z bachhoangxuan Binaria (CCO23_day1problem1) C++17
25 / 25
 94 ms 45116 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/

#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=1e6+3;
const int maxn=1000005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=20;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

int par[maxn],col[maxn],a[maxn];

int findpar(int u){
    if(u!=par[u]) return par[u]=findpar(par[u]);
    return u;
}
void unions(int u,int v){
    u=findpar(u);v=findpar(v);
    if(u==v) return;
    par[v]=u;
}

int dd[maxn][2];

int C(int k,int n){
    int res=1;
    for(int i=k+1;i<=n;i++) res=res*i%mod;
    for(int i=1;i<=n-k;i++) res=res*power(i,mod-2)%mod;
    return res;
}

void solve(){
    memset(col,-1,sizeof(col));
    int n,k;cin >> n >> k;
    for(int i=1;i<=n;i++) par[i]=i;
    for(int i=k;i<=n;i++) cin >> a[i];
    int ans=1;
    for(int i=k+1;i<=n;i++){
        int d=a[i]-a[i-1];
        if(d==0) unions(i-k,i);
        else if(d==1){
            if(col[i-k]==1) ans=0;
            col[i-k]=0;col[i]=1;
        }
        else{
            if(col[i-k]==0) ans=0;
            col[i-k]=1;col[i]=0;
        }
    }
    for(int i=1;i<=n;i++){
        if(col[i]!=-1) dd[findpar(i)][col[i]]=1;
    }
    for(int i=1;i<=n;i++){
        if(dd[i][0] && dd[i][1]) ans=0;
        int x=findpar(i);
        if(dd[x][0]) col[i]=0;
        else if(dd[x][1]) col[i]=1;
    }
    int cnt=a[k],num=0;
    for(int i=1;i<=k;i++){
        if(col[i]!=-1) cnt-=col[i];
        else num++;
    }
    if(cnt<0 || cnt>num) ans=0;
    if(!ans){
        cout << 0 << '\n';
        return;
    }
    cout << C(cnt,num) << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12636 KB Output is correct
11 Correct 2 ms 12764 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12636 KB Output is correct
11 Correct 2 ms 12764 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 2 ms 12636 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 2 ms 12636 KB Output is correct
16 Correct 2 ms 12636 KB Output is correct
17 Correct 2 ms 12636 KB Output is correct
18 Correct 2 ms 12636 KB Output is correct
19 Correct 2 ms 12636 KB Output is correct
20 Correct 2 ms 12636 KB Output is correct
21 Correct 2 ms 12636 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12636 KB Output is correct
11 Correct 2 ms 12764 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 2 ms 12636 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 2 ms 12636 KB Output is correct
16 Correct 2 ms 12636 KB Output is correct
17 Correct 2 ms 12636 KB Output is correct
18 Correct 2 ms 12636 KB Output is correct
19 Correct 2 ms 12636 KB Output is correct
20 Correct 2 ms 12636 KB Output is correct
21 Correct 2 ms 12636 KB Output is correct
22 Correct 2 ms 12636 KB Output is correct
23 Correct 2 ms 12636 KB Output is correct
24 Correct 2 ms 12760 KB Output is correct
25 Correct 2 ms 12636 KB Output is correct
26 Correct 2 ms 12636 KB Output is correct
27 Correct 2 ms 12636 KB Output is correct
28 Correct 2 ms 12636 KB Output is correct
29 Correct 2 ms 12636 KB Output is correct
30 Correct 2 ms 12636 KB Output is correct
31 Correct 2 ms 12636 KB Output is correct
32 Correct 2 ms 12636 KB Output is correct
33 Correct 2 ms 12636 KB Output is correct
34 Correct 2 ms 12636 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12636 KB Output is correct
11 Correct 2 ms 12764 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 2 ms 12636 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 2 ms 12636 KB Output is correct
16 Correct 2 ms 12636 KB Output is correct
17 Correct 2 ms 12636 KB Output is correct
18 Correct 2 ms 12636 KB Output is correct
19 Correct 2 ms 12636 KB Output is correct
20 Correct 2 ms 12636 KB Output is correct
21 Correct 2 ms 12636 KB Output is correct
22 Correct 2 ms 12636 KB Output is correct
23 Correct 2 ms 12636 KB Output is correct
24 Correct 2 ms 12760 KB Output is correct
25 Correct 2 ms 12636 KB Output is correct
26 Correct 2 ms 12636 KB Output is correct
27 Correct 2 ms 12636 KB Output is correct
28 Correct 2 ms 12636 KB Output is correct
29 Correct 2 ms 12636 KB Output is correct
30 Correct 2 ms 12636 KB Output is correct
31 Correct 2 ms 12636 KB Output is correct
32 Correct 2 ms 12636 KB Output is correct
33 Correct 2 ms 12636 KB Output is correct
34 Correct 2 ms 12636 KB Output is correct
35 Correct 44 ms 26972 KB Output is correct
36 Correct 55 ms 42064 KB Output is correct
37 Correct 52 ms 42324 KB Output is correct
38 Correct 51 ms 42576 KB Output is correct
39 Correct 41 ms 27164 KB Output is correct
40 Correct 48 ms 27840 KB Output is correct
41 Correct 52 ms 42328 KB Output is correct
42 Correct 54 ms 41672 KB Output is correct
43 Correct 48 ms 41404 KB Output is correct
44 Correct 50 ms 26940 KB Output is correct
45 Correct 44 ms 26816 KB Output is correct
46 Correct 45 ms 26824 KB Output is correct
47 Correct 45 ms 26964 KB Output is correct
48 Correct 47 ms 27960 KB Output is correct
49 Correct 52 ms 27968 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12636 KB Output is correct
11 Correct 2 ms 12764 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 2 ms 12636 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 2 ms 12636 KB Output is correct
16 Correct 2 ms 12636 KB Output is correct
17 Correct 2 ms 12636 KB Output is correct
18 Correct 2 ms 12636 KB Output is correct
19 Correct 2 ms 12636 KB Output is correct
20 Correct 2 ms 12636 KB Output is correct
21 Correct 2 ms 12636 KB Output is correct
22 Correct 2 ms 12636 KB Output is correct
23 Correct 2 ms 12636 KB Output is correct
24 Correct 2 ms 12760 KB Output is correct
25 Correct 2 ms 12636 KB Output is correct
26 Correct 2 ms 12636 KB Output is correct
27 Correct 2 ms 12636 KB Output is correct
28 Correct 2 ms 12636 KB Output is correct
29 Correct 2 ms 12636 KB Output is correct
30 Correct 2 ms 12636 KB Output is correct
31 Correct 2 ms 12636 KB Output is correct
32 Correct 2 ms 12636 KB Output is correct
33 Correct 2 ms 12636 KB Output is correct
34 Correct 2 ms 12636 KB Output is correct
35 Correct 44 ms 26972 KB Output is correct
36 Correct 55 ms 42064 KB Output is correct
37 Correct 52 ms 42324 KB Output is correct
38 Correct 51 ms 42576 KB Output is correct
39 Correct 41 ms 27164 KB Output is correct
40 Correct 48 ms 27840 KB Output is correct
41 Correct 52 ms 42328 KB Output is correct
42 Correct 54 ms 41672 KB Output is correct
43 Correct 48 ms 41404 KB Output is correct
44 Correct 50 ms 26940 KB Output is correct
45 Correct 44 ms 26816 KB Output is correct
46 Correct 45 ms 26824 KB Output is correct
47 Correct 45 ms 26964 KB Output is correct
48 Correct 47 ms 27960 KB Output is correct
49 Correct 52 ms 27968 KB Output is correct
50 Correct 58 ms 29776 KB Output is correct
51 Correct 66 ms 29780 KB Output is correct
52 Correct 63 ms 44364 KB Output is correct
53 Correct 68 ms 44344 KB Output is correct
54 Correct 66 ms 44376 KB Output is correct
55 Correct 70 ms 44116 KB Output is correct
56 Correct 62 ms 44348 KB Output is correct
57 Correct 62 ms 43716 KB Output is correct
58 Correct 58 ms 29892 KB Output is correct
59 Correct 65 ms 44232 KB Output is correct
60 Correct 61 ms 43344 KB Output is correct

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12636 KB Output is correct
11 Correct 2 ms 12764 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 2 ms 12636 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 2 ms 12636 KB Output is correct
16 Correct 2 ms 12636 KB Output is correct
17 Correct 2 ms 12636 KB Output is correct
18 Correct 2 ms 12636 KB Output is correct
19 Correct 2 ms 12636 KB Output is correct
20 Correct 2 ms 12636 KB Output is correct
21 Correct 2 ms 12636 KB Output is correct
22 Correct 2 ms 12636 KB Output is correct
23 Correct 2 ms 12636 KB Output is correct
24 Correct 2 ms 12760 KB Output is correct
25 Correct 2 ms 12636 KB Output is correct
26 Correct 2 ms 12636 KB Output is correct
27 Correct 2 ms 12636 KB Output is correct
28 Correct 2 ms 12636 KB Output is correct
29 Correct 2 ms 12636 KB Output is correct
30 Correct 2 ms 12636 KB Output is correct
31 Correct 2 ms 12636 KB Output is correct
32 Correct 2 ms 12636 KB Output is correct
33 Correct 2 ms 12636 KB Output is correct
34 Correct 2 ms 12636 KB Output is correct
35 Correct 44 ms 26972 KB Output is correct
36 Correct 55 ms 42064 KB Output is correct
37 Correct 52 ms 42324 KB Output is correct
38 Correct 51 ms 42576 KB Output is correct
39 Correct 41 ms 27164 KB Output is correct
40 Correct 48 ms 27840 KB Output is correct
41 Correct 52 ms 42328 KB Output is correct
42 Correct 54 ms 41672 KB Output is correct
43 Correct 48 ms 41404 KB Output is correct
44 Correct 50 ms 26940 KB Output is correct
45 Correct 44 ms 26816 KB Output is correct
46 Correct 45 ms 26824 KB Output is correct
47 Correct 45 ms 26964 KB Output is correct
48 Correct 47 ms 27960 KB Output is correct
49 Correct 52 ms 27968 KB Output is correct
50 Correct 58 ms 29776 KB Output is correct
51 Correct 66 ms 29780 KB Output is correct
52 Correct 63 ms 44364 KB Output is correct
53 Correct 68 ms 44344 KB Output is correct
54 Correct 66 ms 44376 KB Output is correct
55 Correct 70 ms 44116 KB Output is correct
56 Correct 62 ms 44348 KB Output is correct
57 Correct 62 ms 43716 KB Output is correct
58 Correct 58 ms 29892 KB Output is correct
59 Correct 65 ms 44232 KB Output is correct
60 Correct 61 ms 43344 KB Output is correct
61 Correct 50 ms 16852 KB Output is correct
62 Correct 61 ms 16856 KB Output is correct
63 Correct 17 ms 16732 KB Output is correct
64 Correct 45 ms 18780 KB Output is correct
65 Correct 52 ms 40952 KB Output is correct
66 Correct 59 ms 35664 KB Output is correct
67 Correct 75 ms 45116 KB Output is correct
68 Correct 91 ms 23388 KB Output is correct
69 Correct 5 ms 16728 KB Output is correct
70 Correct 94 ms 16732 KB Output is correct
71 Correct 50 ms 18780 KB Output is correct