oj.uz

답안 #987363

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987363 2024-05-22T16:18:59 Z alexdd Semafor (COI20_semafor) C++17
79 / 100
 3139 ms 1624 KB 
#include<iostream>
#include<map>
using namespace std;
#define int long long
const long long MOD = 1e9+7;
struct matrix
{
    int v[105][105];
};
matrix inm(matrix x, matrix y)
{
    matrix aux;
    for(int i=0;i<100;i++)
    {
        for(int j=0;j<100;j++)
        {
            aux.v[i][j]=0;
            for(int k=0;k<100;k++)
            {
                aux.v[i][j] += 1LL*x.v[i][k] * y.v[k][j]%MOD;
                aux.v[i][j]%=MOD;
            }
        }
    }
    return aux;
}
matrix unu;
matrix put(matrix a, int exp)
{
    matrix aux=unu;
    while(exp>0)
    {
        if(exp%2==1) aux = inm(aux,a);
        a = inm(a,a);
        exp/=2;
    }
    return aux;
}
int m;
map<pair<int,int>,pair<int,bool>> mp;
long long put_nr(long long a, int exp)
{
    if(exp==0)
        return 1;
    if(exp%2==0)
        return put_nr(a*a%MOD,exp/2);
    else
        return put_nr(a*a%MOD,exp/2)*a%MOD;
}
long long fact[3005],invf[3005];
long long comb(int x, int y)
{
    if(x<y)
        return 0;
    return ((((fact[x]*invf[y])%MOD)*invf[x-y])%MOD);
}
matrix dp;
int calc(int cnt1, int k)
{
    if(k%2!=cnt1%2)
        return 0;
    for(int i=0;i<100;i++)
        for(int j=0;j<100;j++)
            dp.v[i][j]=0;
    for(int cur=0;cur<=10;cur++)
    {
        if(cur>0) dp.v[cur][cur-1] = 10-(cur-1);
        if(cur<10) dp.v[cur][cur+1] = cur+1;
    }
    dp = put(dp,k);
    /*for(int nr=1;nr<=k;nr++)
    {
        for(int cur=0;cur<=10;cur++)
        {
            dp[nr][cur]=0;
            if(cur>0) dp[nr][cur] += dp[nr-1][cur-1]*(10-(cur-1));
            if(cur<10) dp[nr][cur] += dp[nr-1][cur+1]*(cur+1);
            dp[nr][cur]%=MOD;
        }
    }*/
    return dp.v[cnt1][0] * put_nr(comb(10,cnt1),MOD-2)%MOD;
}
int getmp(int config, int k)
{
    int cnt1=0;
    for(int i=0;i<10;i++)
        if(((1<<i)&config))
            cnt1++;
    if(mp[{cnt1,k}].second==0)
    {
        mp[{cnt1,k}]={calc(cnt1,k),1};
    }
    return mp[{cnt1,k}].first;
}
int mask[100];
matrix calc_matrix(int k)
{
    matrix aux;
    for(int i=0;i<100;i++)
    {
        for(int j=0;j<100;j++)
        {
            aux.v[i][j] = getmp((mask[i]^mask[j]),k);
        }
    }
    return aux;
}
void calc_mask()
{
    mask[0] = (1<<1) + (1<<3);
    mask[1] = (1<<1);
    mask[2] = (1<<0) + (1<<3);
    mask[3] = (1<<0) + (1<<1) + (1<<2);
    mask[4] = (1<<1) + (1<<4);
    mask[5] = (1<<0) + (1<<2) + (1<<4);
    mask[6] = (1<<2) + (1<<3);
    mask[7] = (1<<0) + (1<<1);
    mask[8] = (1<<0) + (1<<2) + (1<<3) + (1<<4);
    mask[9] = (1<<0) + (1<<1) + (1<<2) + (1<<4);
    for(int i=10;i<100;i++)
    {
        mask[i] = (mask[i/10]<<5) + mask[i%10];
    }
    for(int i=9;i>=0;i--)
        mask[i] += (mask[0]<<5);
}
signed main()
{
    for(int i=0;i<100;i++)
        for(int j=0;j<100;j++)
            unu.v[i][j]=0;
    for(int i=0;i<100;i++)
        unu.v[i][i]=1;

    fact[0]=1;
    for(int i=1;i<=3000;i++)
        fact[i]=fact[i-1]*i%MOD;
    invf[3000]=put_nr(fact[3000],MOD-2);
    for(int i=2999;i>=0;i--)
        invf[i]=invf[i+1]*(i+1)%MOD;

    int n,k,x;
    cin>>m>>n>>k>>x;
    calc_mask();
    matrix km = calc_matrix(k);
    matrix rm = calc_matrix(n%k);
    matrix rez=unu;
    if(n/k > 0) rez = inm(rez,put(km,n/k));
    if(n%k > 0) rez = inm(rez,rm);

    //if(n==k) rez=km;

    for(int i=0;i<100;i++)
    {
        cout<<rez.v[x][i]<<"\n";
    }
    return 0;
}

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 50 ms 1372 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 50 ms 1372 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 147 ms 1492 KB Output is correct
2 Correct 238 ms 1488 KB Output is correct
3 Correct 369 ms 1496 KB Output is correct
4 Correct 396 ms 1488 KB Output is correct
5 Correct 349 ms 1372 KB Output is correct
6 Correct 350 ms 1508 KB Output is correct
7 Correct 415 ms 1368 KB Output is correct
8 Correct 419 ms 1492 KB Output is correct
9 Correct 349 ms 1372 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 291 ms 1372 KB Output is correct
2 Correct 214 ms 1372 KB Output is correct
3 Correct 335 ms 1368 KB Output is correct
4 Correct 592 ms 1528 KB Output is correct
5 Correct 385 ms 1488 KB Output is correct
6 Correct 549 ms 1372 KB Output is correct
7 Correct 484 ms 1372 KB Output is correct
8 Correct 305 ms 1568 KB Output is correct
9 Correct 306 ms 1372 KB Output is correct
10 Correct 549 ms 1500 KB Output is correct
11 Correct 72 ms 1368 KB Output is correct
12 Correct 55 ms 1368 KB Output is correct
13 Correct 444 ms 1372 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 291 ms 1372 KB Output is correct
2 Correct 214 ms 1372 KB Output is correct
3 Correct 335 ms 1368 KB Output is correct
4 Correct 592 ms 1528 KB Output is correct
5 Correct 385 ms 1488 KB Output is correct
6 Correct 549 ms 1372 KB Output is correct
7 Correct 484 ms 1372 KB Output is correct
8 Correct 305 ms 1568 KB Output is correct
9 Correct 306 ms 1372 KB Output is correct
10 Correct 549 ms 1500 KB Output is correct
11 Correct 72 ms 1368 KB Output is correct
12 Correct 55 ms 1368 KB Output is correct
13 Correct 444 ms 1372 KB Output is correct
14 Correct 549 ms 1484 KB Output is correct
15 Correct 844 ms 1620 KB Output is correct
16 Correct 896 ms 1488 KB Output is correct
17 Correct 764 ms 1492 KB Output is correct
18 Correct 841 ms 1484 KB Output is correct
19 Correct 807 ms 1624 KB Output is correct
20 Correct 814 ms 1368 KB Output is correct
21 Correct 304 ms 1484 KB Output is correct
22 Correct 536 ms 1372 KB Output is correct
23 Correct 841 ms 1480 KB Output is correct
24 Correct 963 ms 1492 KB Output is correct
25 Correct 998 ms 1616 KB Output is correct
26 Correct 137 ms 1368 KB Output is correct
27 Correct 200 ms 1372 KB Output is correct
28 Correct 827 ms 1496 KB Output is correct

Subtask #6
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 147 ms 1492 KB Output is correct
2 Correct 238 ms 1488 KB Output is correct
3 Correct 369 ms 1496 KB Output is correct
4 Correct 396 ms 1488 KB Output is correct
5 Correct 349 ms 1372 KB Output is correct
6 Correct 350 ms 1508 KB Output is correct
7 Correct 415 ms 1368 KB Output is correct
8 Correct 419 ms 1492 KB Output is correct
9 Correct 349 ms 1372 KB Output is correct
10 Correct 291 ms 1372 KB Output is correct
11 Correct 214 ms 1372 KB Output is correct
12 Correct 335 ms 1368 KB Output is correct
13 Correct 592 ms 1528 KB Output is correct
14 Correct 385 ms 1488 KB Output is correct
15 Correct 549 ms 1372 KB Output is correct
16 Correct 484 ms 1372 KB Output is correct
17 Correct 305 ms 1568 KB Output is correct
18 Correct 306 ms 1372 KB Output is correct
19 Correct 549 ms 1500 KB Output is correct
20 Correct 72 ms 1368 KB Output is correct
21 Correct 55 ms 1368 KB Output is correct
22 Correct 444 ms 1372 KB Output is correct
23 Correct 549 ms 1484 KB Output is correct
24 Correct 844 ms 1620 KB Output is correct
25 Correct 896 ms 1488 KB Output is correct
26 Correct 764 ms 1492 KB Output is correct
27 Correct 841 ms 1484 KB Output is correct
28 Correct 807 ms 1624 KB Output is correct
29 Correct 814 ms 1368 KB Output is correct
30 Correct 304 ms 1484 KB Output is correct
31 Correct 536 ms 1372 KB Output is correct
32 Correct 841 ms 1480 KB Output is correct
33 Correct 963 ms 1492 KB Output is correct
34 Correct 998 ms 1616 KB Output is correct
35 Correct 137 ms 1368 KB Output is correct
36 Correct 200 ms 1372 KB Output is correct
37 Correct 827 ms 1496 KB Output is correct
38 Correct 734 ms 1492 KB Output is correct
39 Correct 1790 ms 1492 KB Output is correct
40 Correct 2421 ms 1496 KB Output is correct
41 Correct 3013 ms 1368 KB Output is correct
42 Correct 3089 ms 1496 KB Output is correct
43 Correct 3139 ms 1500 KB Output is correct
44 Correct 2749 ms 1496 KB Output is correct
45 Correct 309 ms 1488 KB Output is correct
46 Correct 346 ms 1372 KB Output is correct
47 Correct 2984 ms 1368 KB Output is correct
48 Correct 1981 ms 1496 KB Output is correct
49 Correct 1587 ms 1492 KB Output is correct
50 Correct 148 ms 1492 KB Output is correct
51 Correct 424 ms 1500 KB Output is correct
52 Correct 2647 ms 1492 KB Output is correct