oj.uz

Submission #987508

# Submission time Handle Problem Language Result Execution time Memory
987508 2024-05-22T22:28:57 Z activedeltorre Semafor (COI20_semafor) C++14
79 / 100
 666 ms 1380 KB 
#include <iostream>

using namespace std;
long long nr1[2300];
long long nr2[2300];
long long biti=10;
long long cif(long long val)
{
    if(val==1)
    {
        return 1;
    }
    else if(val==2)
    {
        return 6;
    }
    else if(val==3)
    {
        return 21;
    }
    else if(val==4)
    {
        return 9;
    }
    else if(val==5)
    {
        return 28;
    }
    else if(val==6)
    {
        return 18;
    }
    else if(val==7)
    {
        return 5;
    }
    else if(val==8)
    {
        return 30;
    }
    else if(val==9)
    {
        return 29;
    }
    else
        return 3;
}
long long getid(long long val)
{
    return cif(val/10)*32+cif(val%10);
}
long long mod=1e9+7;
long long nmax=1023;
struct kuk
{
    long long mat[105][105];
}m1,m2,m3;
kuk mini;
kuk mini2;
kuk base1,base2;
kuk rasp;
void multi(kuk a,kuk b)
{
    long long i,z,j;
    for(i=0;i<=99;i++)
    {
        for(j=0;j<=99;j++)
        {
            rasp.mat[i][j]=0;
        }
    }
    for(i=0;i<=99;i++)
    {
        for(j=0;j<=99;j++)
        {
            for(z=0;z<=99;z++)
            {
                rasp.mat[i][j]+=(a.mat[i][z]*b.mat[z][j])%mod;
            }
        }
    }
    for(i=0;i<=99;i++)
    {
        for(j=0;j<=99;j++)
        {
            rasp.mat[i][j]%=mod;
        }
    }
}
long long invs(long long a,long long exp)
{
    long long prod=1;
    while(exp)
    {
        if(exp%2==1)
        {
            prod=(prod*a)%mod;
        }
        exp=exp/2;
        a=(a*a)%mod;
    }
    return prod;
}
long long differ(long long a,long long b)
{
    return __builtin_popcount(getid(a)^getid(b));
}
long long invsc[25][25];
void precalc()
{
    long long i,j,z;
    for(i=1;i<=20;i++)
    {
        for(j=0;j<=i;j++)
        {
            long long prod=1;
            for(z=1;z<=i;z++)
            {
                prod=(prod*invs(z,mod-2))%mod;
            }
            for(z=1;z<=j;z++)
            {
                prod=(prod*z)%mod;
            }
            for(z=1;z<=i-j;z++)
            {
                prod=(prod*z)%mod;
            }
            invsc[i][j]=prod;
        }
    }
}
long long anticomb(long long x)
{
    return invsc[biti][x];
}
kuk base;
kuk afis;
kuk bigmat;
kuk bigmat2;
void calcbigger()
{
    for(long long i=0;i<=99;i++)
    {
        for(long long j=0;j<=99;j++)
        {
            bigmat.mat[i][j]=(base.mat[0][differ(i,j)]*anticomb(differ(j,i))%mod);
        }
    }
}
signed main()
{
    long long n,i,j,k,l,m,st,val,z;
    cin>>m>>n>>k>>st;
    precalc();
    val=getid(st);
    nr1[val]=1;
    base.mat[0][0]=1;
    base2.mat[0][0]=1;
    for(i=0;i<=biti;i++)
    {
        if(i<biti)
        mini.mat[i][i+1]=(biti-i);
        if(i>=1)
        mini.mat[i][i-1]=i;
    }
    mini2=mini;
    long long k2=k;
    while(k)
    {
        if(k%2==1)
        {
            multi(base,mini);
            base=rasp;
        }
        multi(mini,mini);
        mini=rasp;
        k=k/2;
    }
    long long operbig=n/k2;
    long long opersmall=n%k2;
    while(opersmall)
    {
        if(opersmall%2==1)
        {
            multi(base2,mini2);
            base2=rasp;
        }
        multi(mini2,mini2);
        mini2=rasp;
        opersmall=opersmall/2;
    }
    for(i=0;i<=99;i++)
    {
        for(j=0;j<=99;j++)
        {
            bigmat2.mat[i][j]=(base2.mat[0][differ(i,j)]*anticomb(differ(i,j))%mod);
        }
    }
    afis.mat[st][st]=1;
    calcbigger();
    while(operbig)
    {
        if(operbig%2==1)
        {
            multi(afis,bigmat);
            afis=rasp;
        }
        operbig=operbig/2;
        multi(bigmat,bigmat);
        bigmat=rasp;
    }
    multi(afis,bigmat2);
    afis=rasp;
    for(i=0;i<=99;i++)
    {
        cout<<afis.mat[st][i]<<'\n';
    }
    return 0;
}

Compilation message

semafor.cpp: In function 'int main()':
semafor.cpp:153:23: warning: unused variable 'l' [-Wunused-variable]
  153 |     long long n,i,j,k,l,m,st,val,z;
      |                       ^
semafor.cpp:153:34: warning: unused variable 'z' [-Wunused-variable]
  153 |     long long n,i,j,k,l,m,st,val,z;
      |                                  ^

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 24 ms 1116 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 24 ms 1116 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 1108 KB Output is correct
2 Correct 60 ms 1200 KB Output is correct
3 Correct 86 ms 1140 KB Output is correct
4 Correct 90 ms 1108 KB Output is correct
5 Correct 82 ms 1204 KB Output is correct
6 Correct 94 ms 1200 KB Output is correct
7 Correct 95 ms 1108 KB Output is correct
8 Correct 94 ms 1104 KB Output is correct
9 Correct 81 ms 1208 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 1108 KB Output is correct
2 Correct 210 ms 1208 KB Output is correct
3 Correct 325 ms 1284 KB Output is correct
4 Correct 438 ms 1288 KB Output is correct
5 Correct 384 ms 1364 KB Output is correct
6 Correct 411 ms 1108 KB Output is correct
7 Correct 420 ms 1224 KB Output is correct
8 Correct 332 ms 1204 KB Output is correct
9 Correct 333 ms 1380 KB Output is correct
10 Correct 415 ms 1292 KB Output is correct
11 Correct 51 ms 1112 KB Output is correct
12 Correct 29 ms 1144 KB Output is correct
13 Correct 401 ms 1288 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 1108 KB Output is correct
2 Correct 210 ms 1208 KB Output is correct
3 Correct 325 ms 1284 KB Output is correct
4 Correct 438 ms 1288 KB Output is correct
5 Correct 384 ms 1364 KB Output is correct
6 Correct 411 ms 1108 KB Output is correct
7 Correct 420 ms 1224 KB Output is correct
8 Correct 332 ms 1204 KB Output is correct
9 Correct 333 ms 1380 KB Output is correct
10 Correct 415 ms 1292 KB Output is correct
11 Correct 51 ms 1112 KB Output is correct
12 Correct 29 ms 1144 KB Output is correct
13 Correct 401 ms 1288 KB Output is correct
14 Correct 150 ms 1224 KB Output is correct
15 Correct 288 ms 1288 KB Output is correct
16 Correct 366 ms 1212 KB Output is correct
17 Correct 422 ms 1204 KB Output is correct
18 Correct 440 ms 1284 KB Output is correct
19 Correct 410 ms 1284 KB Output is correct
20 Correct 443 ms 1364 KB Output is correct
21 Correct 331 ms 1112 KB Output is correct
22 Correct 414 ms 1364 KB Output is correct
23 Correct 428 ms 1104 KB Output is correct
24 Correct 450 ms 1368 KB Output is correct
25 Correct 456 ms 1364 KB Output is correct
26 Correct 50 ms 1364 KB Output is correct
27 Correct 76 ms 1144 KB Output is correct
28 Correct 370 ms 1288 KB Output is correct

Subtask #6
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 1108 KB Output is correct
2 Correct 60 ms 1200 KB Output is correct
3 Correct 86 ms 1140 KB Output is correct
4 Correct 90 ms 1108 KB Output is correct
5 Correct 82 ms 1204 KB Output is correct
6 Correct 94 ms 1200 KB Output is correct
7 Correct 95 ms 1108 KB Output is correct
8 Correct 94 ms 1104 KB Output is correct
9 Correct 81 ms 1208 KB Output is correct
10 Correct 122 ms 1108 KB Output is correct
11 Correct 210 ms 1208 KB Output is correct
12 Correct 325 ms 1284 KB Output is correct
13 Correct 438 ms 1288 KB Output is correct
14 Correct 384 ms 1364 KB Output is correct
15 Correct 411 ms 1108 KB Output is correct
16 Correct 420 ms 1224 KB Output is correct
17 Correct 332 ms 1204 KB Output is correct
18 Correct 333 ms 1380 KB Output is correct
19 Correct 415 ms 1292 KB Output is correct
20 Correct 51 ms 1112 KB Output is correct
21 Correct 29 ms 1144 KB Output is correct
22 Correct 401 ms 1288 KB Output is correct
23 Correct 150 ms 1224 KB Output is correct
24 Correct 288 ms 1288 KB Output is correct
25 Correct 366 ms 1212 KB Output is correct
26 Correct 422 ms 1204 KB Output is correct
27 Correct 440 ms 1284 KB Output is correct
28 Correct 410 ms 1284 KB Output is correct
29 Correct 443 ms 1364 KB Output is correct
30 Correct 331 ms 1112 KB Output is correct
31 Correct 414 ms 1364 KB Output is correct
32 Correct 428 ms 1104 KB Output is correct
33 Correct 450 ms 1368 KB Output is correct
34 Correct 456 ms 1364 KB Output is correct
35 Correct 50 ms 1364 KB Output is correct
36 Correct 76 ms 1144 KB Output is correct
37 Correct 370 ms 1288 KB Output is correct
38 Correct 174 ms 1292 KB Output is correct
39 Correct 360 ms 1228 KB Output is correct
40 Correct 480 ms 1208 KB Output is correct
41 Correct 653 ms 1292 KB Output is correct
42 Correct 604 ms 1212 KB Output is correct
43 Correct 666 ms 1208 KB Output is correct
44 Correct 652 ms 1200 KB Output is correct
45 Correct 331 ms 1360 KB Output is correct
46 Correct 369 ms 1140 KB Output is correct
47 Correct 641 ms 1360 KB Output is correct
48 Correct 396 ms 1108 KB Output is correct
49 Correct 320 ms 1212 KB Output is correct
50 Correct 42 ms 1108 KB Output is correct
51 Correct 94 ms 1108 KB Output is correct
52 Correct 607 ms 1292 KB Output is correct