oj.uz

Submission #321233

# Submission time Handle Problem Language Result Execution time Memory
321233 2020-11-11T15:59:38 Z georgerapeanu Semafor (COI20_semafor) C++11
100 / 100
 371 ms 996 KB 
#include <bits/stdc++.h>

using namespace std;

const int MOD = 1e9 + 7;

int conf[] = {
    10,
    2,
    9,
    7,
    18,
    21,
    12,
    3,
    29,
    23
};

struct matrix_t {
    int n,m;
    int a[105][105];

    matrix_t() {
        memset(a,0,sizeof(a));
    }

    matrix_t(int n,int m) {
        this->n = n;
        this->m = m;
        memset(a,0,sizeof(a));
    }

    matrix_t operator * (const matrix_t &other) const {
        matrix_t ans(this->n,other.m);

        for(int i = 0;i < ans.n;i++){
            for(int j = 0;j < ans.m;j++){
                ans.a[i][j] = 0;
                for(int k = 0;k < m;k++){
                    ans.a[i][j] = (ans.a[i][j] + 1LL * a[i][k] * other.a[k][j]) % MOD;
                }
            }
        } 

        return ans;
    }

    void afis(){
        for(int i = 0;i < n;i++){
            for(int j = 0;j < m;j++){
                printf("%d ",a[i][j]);
            }
            printf("\n");
        }
        printf("\n");
    }
};

matrix_t lgpow(matrix_t base,long long exp) {
    matrix_t ans(base.n,base.m);

    for(int i = 0;i < ans.n;i++) {
        for(int j = 0;j < ans.m;j++) {
            ans.a[i][j] = (i == j);
        }
    }

    while(exp) {
        if(exp & 1) {
            ans = ans * base;
        }
        base = base * base;
        exp >>= 1;
    }

    return ans;
}

long long n,k;
int m,x;
int comb[105][105];

int lgpow_num(int b,long long e){
    int p = 1;

    while(e){
        if(e & 1){
            p = 1LL * p * b % MOD;
        }
        b = 1LL * b * b % MOD;
        e >>= 1;
    }

    return p;
}

int get_conf(int val){
    if(m == 1){
        return conf[val];
    }
    if(m == 2){
        return conf[val % 10] | (conf[val / 10] << 5);
    }
}

matrix_t get_matrix(long long k,matrix_t base) {
    matrix_t vec(base.m,1);
    vec.a[0][0] = 1;
    matrix_t tmp = lgpow(base,k) * vec;

    matrix_t ans((m == 1 ? 10:100),(m == 1 ? 10:100));

    for(int i = 0;i < ans.n;i++){
        for(int j = 0;j < ans.m;j++){
            int bit_diff = __builtin_popcount(get_conf(i) ^ get_conf(j));
            ans.a[i][j] = 1LL * tmp.a[bit_diff][0] * 
            lgpow_num(comb[m * 5][bit_diff],MOD - 2) % MOD;
        }
    }

    return ans;
}

int main() {

    for(int i = 0;i <= 100;i++) {
        comb[i][0] = comb[i][i] = 1;
        for(int j = 1;j < i;j++) {
            comb[i][j] = (comb[i - 1][j - 1] + comb[i - 1][j]) % MOD;
        }
    }

    scanf("%d %lld %lld %d",&m,&n,&k,&x);

    matrix_t base(m * 5 + 1,m * 5 + 1);

    for(int i = 0;i <= m * 5;i++){
        if(i > 0){
            base.a[i][i - 1] = m * 5 - (i - 1);
        }
        if(i < m * 5){
            base.a[i][i + 1] = (i + 1);
        }
    }

    matrix_t dp = lgpow(get_matrix(k,base),n / k) * get_matrix(n % k,base); 

    for(int i = 0;i < (m == 1 ? 10:100);i++) {
        printf("%d\n",dp.a[x][i]);
    }

    return 0;
}

Compilation message

semafor.cpp: In function 'int get_conf(int)':
semafor.cpp:105:1: warning: control reaches end of non-void function [-Wreturn-type]
  105 | }
      | ^
semafor.cpp: In function 'int main()':
semafor.cpp:134:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  134 |     scanf("%d %lld %lld %d",&m,&n,&k,&x);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 876 KB Output is correct
2 Correct 1 ms 876 KB Output is correct
3 Correct 1 ms 876 KB Output is correct
4 Correct 1 ms 876 KB Output is correct
5 Correct 1 ms 876 KB Output is correct
6 Correct 1 ms 876 KB Output is correct
7 Correct 1 ms 876 KB Output is correct
8 Correct 1 ms 876 KB Output is correct
9 Correct 1 ms 876 KB Output is correct
10 Correct 1 ms 876 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 876 KB Output is correct
2 Correct 19 ms 876 KB Output is correct
3 Correct 19 ms 876 KB Output is correct
4 Correct 20 ms 876 KB Output is correct
5 Correct 20 ms 876 KB Output is correct
6 Correct 19 ms 876 KB Output is correct
7 Correct 19 ms 876 KB Output is correct
8 Correct 21 ms 876 KB Output is correct
9 Correct 20 ms 876 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 844 KB Output is correct
2 Correct 194 ms 868 KB Output is correct
3 Correct 289 ms 868 KB Output is correct
4 Correct 371 ms 868 KB Output is correct
5 Correct 351 ms 868 KB Output is correct
6 Correct 336 ms 864 KB Output is correct
7 Correct 362 ms 868 KB Output is correct
8 Correct 352 ms 868 KB Output is correct
9 Correct 347 ms 864 KB Output is correct
10 Correct 336 ms 868 KB Output is correct
11 Correct 48 ms 868 KB Output is correct
12 Correct 26 ms 876 KB Output is correct
13 Correct 355 ms 868 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 844 KB Output is correct
2 Correct 194 ms 868 KB Output is correct
3 Correct 289 ms 868 KB Output is correct
4 Correct 371 ms 868 KB Output is correct
5 Correct 351 ms 868 KB Output is correct
6 Correct 336 ms 864 KB Output is correct
7 Correct 362 ms 868 KB Output is correct
8 Correct 352 ms 868 KB Output is correct
9 Correct 347 ms 864 KB Output is correct
10 Correct 336 ms 868 KB Output is correct
11 Correct 48 ms 868 KB Output is correct
12 Correct 26 ms 876 KB Output is correct
13 Correct 355 ms 868 KB Output is correct
14 Correct 44 ms 864 KB Output is correct
15 Correct 144 ms 868 KB Output is correct
16 Correct 219 ms 836 KB Output is correct
17 Correct 287 ms 868 KB Output is correct
18 Correct 311 ms 868 KB Output is correct
19 Correct 270 ms 888 KB Output is correct
20 Correct 307 ms 868 KB Output is correct
21 Correct 349 ms 876 KB Output is correct
22 Correct 345 ms 868 KB Output is correct
23 Correct 288 ms 868 KB Output is correct
24 Correct 299 ms 868 KB Output is correct
25 Correct 295 ms 868 KB Output is correct
26 Correct 29 ms 996 KB Output is correct
27 Correct 39 ms 868 KB Output is correct
28 Correct 221 ms 864 KB Output is correct

Subtask #6
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 876 KB Output is correct
2 Correct 19 ms 876 KB Output is correct
3 Correct 19 ms 876 KB Output is correct
4 Correct 20 ms 876 KB Output is correct
5 Correct 20 ms 876 KB Output is correct
6 Correct 19 ms 876 KB Output is correct
7 Correct 19 ms 876 KB Output is correct
8 Correct 21 ms 876 KB Output is correct
9 Correct 20 ms 876 KB Output is correct
10 Correct 83 ms 844 KB Output is correct
11 Correct 194 ms 868 KB Output is correct
12 Correct 289 ms 868 KB Output is correct
13 Correct 371 ms 868 KB Output is correct
14 Correct 351 ms 868 KB Output is correct
15 Correct 336 ms 864 KB Output is correct
16 Correct 362 ms 868 KB Output is correct
17 Correct 352 ms 868 KB Output is correct
18 Correct 347 ms 864 KB Output is correct
19 Correct 336 ms 868 KB Output is correct
20 Correct 48 ms 868 KB Output is correct
21 Correct 26 ms 876 KB Output is correct
22 Correct 355 ms 868 KB Output is correct
23 Correct 44 ms 864 KB Output is correct
24 Correct 144 ms 868 KB Output is correct
25 Correct 219 ms 836 KB Output is correct
26 Correct 287 ms 868 KB Output is correct
27 Correct 311 ms 868 KB Output is correct
28 Correct 270 ms 888 KB Output is correct
29 Correct 307 ms 868 KB Output is correct
30 Correct 349 ms 876 KB Output is correct
31 Correct 345 ms 868 KB Output is correct
32 Correct 288 ms 868 KB Output is correct
33 Correct 299 ms 868 KB Output is correct
34 Correct 295 ms 868 KB Output is correct
35 Correct 29 ms 996 KB Output is correct
36 Correct 39 ms 868 KB Output is correct
37 Correct 221 ms 864 KB Output is correct
38 Correct 25 ms 876 KB Output is correct
39 Correct 20 ms 876 KB Output is correct
40 Correct 21 ms 876 KB Output is correct
41 Correct 20 ms 876 KB Output is correct
42 Correct 21 ms 876 KB Output is correct
43 Correct 21 ms 876 KB Output is correct
44 Correct 20 ms 876 KB Output is correct
45 Correct 348 ms 868 KB Output is correct
46 Correct 335 ms 868 KB Output is correct
47 Correct 25 ms 876 KB Output is correct
48 Correct 20 ms 876 KB Output is correct
49 Correct 20 ms 876 KB Output is correct
50 Correct 19 ms 876 KB Output is correct
51 Correct 21 ms 876 KB Output is correct
52 Correct 112 ms 868 KB Output is correct