QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#587804#7778. Turning PermutationTMM233WA 312ms506588kbC++2013.7kb2024-09-24 21:44:532024-09-24 21:44:54

Judging History

你现在查看的是最新测评结果

  • [2024-09-24 21:44:54]
  • 评测
  • 测评结果:WA
  • 用时:312ms
  • 内存:506588kb
  • [2024-09-24 21:44:53]
  • 提交

answer

#include<bits/stdc++.h>
#define ll long long
#define int long long
using namespace std;
const int maxn =1e6+5;
const int N=53;
__int128_t dp[N][N][N][N][2];// [pos,kaitou,duan,i,left or right]    
__int128_t sum_dp[N][N][N][2][2];//[len,kaitou,duan,kaitou state,jiewei state]
__int128_t sum_sum[N][N][2][2];//[len,duan,kaitou state,jiewei state]
__int128_t pre1[N][N][N];//[ct_merge,ct_x,ct_v]
__int128_t pre2[N][N][N][N];//[kon,fan,tie,jiao]
__int128_t pre3[N][N][N][N];//[kon,fan,tie,jiao]
ll C[N][N];
__int128_t dp1[N][N];//[kaitou,duan]
__int128_t sum1[N];//[duan]
__int128_t DP1[N][N];//[kaitou,duan]
void init0()
{
    C[0][0]=1;
    for(int i=1;i<N;i++)
    {
        C[i][0]=1;
        for(int j=1;j<=i;j++)
        C[i][j]=C[i-1][j]+C[i-1][j-1];
    }
}
void init2()
{
    pre2[0][0][0][0]=1;
    for(int i=0;i<N-1;i++)
    {
        for(int j=0;j<N;j++)
        {
            for(int k=0;k<=j;k++)
            {
                for(int jiao=0;jiao<=i&&jiao+k<=j;jiao++)
                {
                    if(j+1<N)
                    pre2[i+1][j+1][k][jiao+1]+=pre2[i][j][k][jiao];
                    for(int w=0;w+j<N;w++)
                    {
                        // for(int kk=0;kk<=2&&kk<=w;kk++)
                        if(1<=w)
                        pre2[i+1][w+j][k+1][jiao]+=pre2[i][j][k][jiao]*2;
                        if(2<=w)
                        pre2[i+1][w+j][k+2][jiao]+=pre2[i][j][k][jiao];
                        pre2[i+1][w+j][k+0][jiao]+=pre2[i][j][k][jiao];
                    }
                }
                
            }
        }
    }
    // chu li zui hou yi ge mei you right
    for(int i=0;i<N-1;i++)
    {
        for(int j=0;j<N;j++)
        {
            for(int k=0;k<=j;k++)
            {
                for(int jiao=0;jiao<=i&&jiao+k<=j;jiao++)
                for(int w=0;w+j<N;w++)
                {
                    for(int kk=0;kk<=1&&kk<=w;kk++)
                    pre3[i][w+j][k+kk][jiao]+=pre2[i][j][k][jiao];
                }
            }
        }
    }
}
void init1()
{
    for(int i=1;i<N;i++)
    {
        for(int j=1;j<N;j++)
        {
            for(int k=0;k<=j&&k<=i-1;k++)
            {
                for(int w=0;k+w<=j&&w<=(i-k)*2-1;w++)
                {
                    pre1[i+(j-k-w)-k][i][j]+=pre3[i-1][j][w][k];
                }
            }
        }
    }
}
// ll dp[N][N][N][N][2]; [pos,kaitou,duan,i,left or right]
// ll sum_dp[N][N][N];//[len,kaitou,duan]
void init3()
{
    dp[2][1][1][1][0]=1;
    dp[2][2][1][1][1]=1;
    dp[2][2][2][1][1]=1;
    dp[2][1][2][2][0]=1;
    for(int i=2;i<N-1;i++)
    {
        for(int j=1;j<=i;j++)
        {
            for(int k=1;k<=i;k++)
            {
                for(int w=1;w<=k;w++)
                {
                    // add
                    for(int z=1;z<=k+1;z++)
                    {
                        if(z<=w)
                        {
                            if(z==1)
                            dp[i+1][i+1][k+1][z][1]+=dp[i][j][k][w][0];
                            else
                            dp[i+1][j][k+1][z][1]+=dp[i][j][k][w][0];
                        }
                        else
                        {
                            if(z==1)
                            dp[i+1][i+1][k+1][z][0]+=dp[i][j][k][w][1];
                            else
                            dp[i+1][j][k+1][z][0]+=dp[i][j][k][w][1];
                        }
                    }
                    // tie
                    for(int z=1;z<=k;z++)
                    {
                        if(z<w)
                        {
                            if(z==1)
                            {
                                dp[i+1][i+1][k][z][1]+=dp[i][j][k][w][0];// tie left
                                dp[i+1][j][k][z][1]+=dp[i][j][k][w][0];// tie right
                            }
                            else
                            {
                                dp[i+1][j][k][z][1]+=dp[i][j][k][w][0];
                                dp[i+1][j][k][z][1]+=dp[i][j][k][w][0];
                            }
                        }
                        else if(z==w)
                        {
                            if(z==1)
                            {
                                dp[i+1][i+1][k][z][1]+=dp[i][j][k][w][0];// tie left
                                dp[i+1][j][k][z][0]+=dp[i][j][k][w][1];// tie right
                            }
                            else
                            {
                                dp[i+1][j][k][z][1]+=dp[i][j][k][w][0];
                                dp[i+1][j][k][z][0]+=dp[i][j][k][w][1];
                            }
                        }
                        else if(z>w)
                        {
                            if(z==1)
                            {
                                dp[i+1][i+1][k][z][0]+=dp[i][j][k][w][1];// tie left
                                dp[i+1][j][k][z][0]+=dp[i][j][k][w][1];// tie right
                            }
                            else
                            {
                                dp[i+1][j][k][z][0]+=dp[i][j][k][w][1];
                                dp[i+1][j][k][z][0]+=dp[i][j][k][w][1];
                            }
                        }
                    }
                    // jiao
                    for(int z=1;z<=k-1;z++)
                    {
                        if(z<w)
                        {
                            dp[i+1][j][k-1][z][1]+=dp[i][j][k][w][0];
                        }
                        else 
                        {
                            dp[i+1][j][k-1][z][0]+=dp[i][j][k][w][1];
                        }
                    }
                }
            }
        }
    }
    sum_dp[1][1][1][0][0]=1;
    sum_dp[1][1][1][0][1]=1;
    for(int i=2;i<N;i++)
    {
        for(int j=1;j<=i;j++)
        {
            for(int k=1;k<=i;k++)
            {
                for(int w=1;w<=k;w++)
                {
                    for(int z=0;z<=1;z++)
                    sum_dp[i][j][k][0][0]+=dp[i][j][k][w][z];
                    sum_dp[i][j][k][0][1]+=dp[i][j][k][w][0];
                }
            }
            
        }
    }
    memset(dp,0,sizeof(dp));
    dp[2][2][1][1][1]=1;
    dp[2][2][2][1][1]=1;
    for(int i=2;i<N-1;i++)
    {
        for(int j=1;j<=i;j++)
        {
            for(int k=1;k<=i;k++)
            {
                for(int w=1;w<=k;w++)
                {
                    // add
                    for(int z=1;z<=k+1;z++)
                    {
                        if(z<=w)
                        {
                            if(z==1)
                            dp[i+1][i+1][k+1][z][1]+=dp[i][j][k][w][0];
                            else
                            dp[i+1][j][k+1][z][1]+=dp[i][j][k][w][0];
                        }
                        else
                        {
                            if(z==1)
                            dp[i+1][i+1][k+1][z][0]+=dp[i][j][k][w][1];
                            else
                            dp[i+1][j][k+1][z][0]+=dp[i][j][k][w][1];
                        }
                    }
                    // tie
                    for(int z=1;z<=k;z++)
                    {
                        if(z<w)
                        {
                            if(z==1)
                            {
                                dp[i+1][i+1][k][z][1]+=dp[i][j][k][w][0];// tie left
                                dp[i+1][j][k][z][1]+=dp[i][j][k][w][0];// tie right
                            }
                            else
                            {
                                dp[i+1][j][k][z][1]+=dp[i][j][k][w][0];
                                dp[i+1][j][k][z][1]+=dp[i][j][k][w][0];
                            }
                        }
                        else if(z==w)
                        {
                            if(z==1)
                            {
                                dp[i+1][i+1][k][z][1]+=dp[i][j][k][w][0];// tie left
                                dp[i+1][j][k][z][0]+=dp[i][j][k][w][1];// tie right
                            }
                            else
                            {
                                dp[i+1][j][k][z][1]+=dp[i][j][k][w][0];
                                dp[i+1][j][k][z][0]+=dp[i][j][k][w][1];
                            }
                        }
                        else if(z>w)
                        {
                            if(z==1)
                            {
                                dp[i+1][i+1][k][z][0]+=dp[i][j][k][w][1];// tie left
                                dp[i+1][j][k][z][0]+=dp[i][j][k][w][1];// tie right
                            }
                            else
                            {
                                dp[i+1][j][k][z][0]+=dp[i][j][k][w][1];
                                dp[i+1][j][k][z][0]+=dp[i][j][k][w][1];
                            }
                        }
                    }
                    // jiao
                    for(int z=1;z<=k-1;z++)
                    {
                        if(z<w)
                        {
                            dp[i+1][j][k-1][z][1]+=dp[i][j][k][w][0];
                        }
                        else 
                        {
                            dp[i+1][j][k-1][z][0]+=dp[i][j][k][w][1];
                        }
                    }
                }
            }
        }
    }
    sum_dp[1][1][1][1][0]=1;
    sum_dp[1][1][1][1][1]=1;
    for(int i=2;i<N;i++)
    {
        for(int j=1;j<=i;j++)
        {
            for(int k=1;k<=i;k++)
            {
                for(int w=1;w<=k;w++)
                {
                    for(int z=0;z<=1;z++)
                    sum_dp[i][j][k][1][0]+=dp[i][j][k][w][z];
                    sum_dp[i][j][k][1][1]+=dp[i][j][k][w][0];
                }
            }
            
        }
    }
    memset(sum_sum,0,sizeof(sum_sum));
    sum_sum[1][1][0][0]=1;
    sum_sum[1][1][0][1]=1;
    sum_sum[1][1][1][0]=1;
    sum_sum[1][1][1][1]=1;
    for(int i=2;i<N;i++)
    {
        for(int j=1;j<=i;j++)
        {
            for(int k=1;k<=i;k++)
            for(int z1=0;z1<2;z1++)
            for(int z2=0;z2<2;z2++)
            sum_sum[i][k][z1][z2]+=sum_dp[i][j][k][z1][z2];
        }
    }
}
void solve()
{
    ll n,k;cin>>n>>k;
    k--;
    init0();
    init2();
    init1();
    init3();
    vector<int> ans;
    set<int> st;
    st.insert(0);
    st.insert(n+1);
    for(int i=1;i<=n;i++)
    {
        ll lt=-1;
        memset(dp1,0,sizeof(dp1));
        memset(dp1,0,sizeof(DP1));
        bool fg=0;
        for(auto v:st)
        {
            if(v-lt-1==0)
            {
                lt=v;
                continue;
            }
            if(!fg)
            {
                fg=1;
                for(int j=lt+1,jj=1;j<=v-1;j++,jj++)
                {
                    for(int k=1;k<=v-lt-1;k++)
                    {
                        dp1[j][k]=sum_dp[v-lt-1][jj][k][(lt!=0)][(v!=n+1)];
                    }
                }
                memset(sum1,0,sizeof(sum1));
                for(int k=1;k<=v-lt-1;k++)
                {
                    for(int j=lt+1;j<=v-1;j++)
                    sum1[k]+=dp1[j][k];
                }
                lt=v;
                continue;
            } 
            for(int w=1;w<=v-1;w++)
            {
                if(w<lt)
                {
                    for(int ct_merge=1;ct_merge<=v-1;ct_merge++)
                    {
                        for(int ct_x=1;ct_x<=lt-1;ct_x++)
                        {
                            for(int ct_v=1;ct_v<=v-lt-1;ct_v++)
                            {
                                DP1[w][ct_merge]+=pre1[ct_merge][ct_x][ct_v]*dp1[w][ct_x]*sum_sum[v-lt-1][ct_v][(lt!=0)][(v!=n+1)];
                            }
                        }
                    }
                }
                else if(w>lt)
                {
                    for(int ct_merge=1;ct_merge<=v-1;ct_merge++)
                    {
                        for(int ct_x=1;ct_x<=lt-1;ct_x++)
                        {
                            for(int ct_v=1;ct_v<=v-lt-1;ct_v++)
                            {
                                DP1[w][ct_merge]+=pre1[ct_merge][ct_v][ct_x]*sum1[ct_x]*sum_dp[v-lt-1][w-lt][ct_v][(lt!=0)][(v!=n+1)];
                            }
                        }
                    }
                }
            }
            for(int j=1;j<=v-1;j++)
            {
                for(int k=1;k<=v-1;k++)
                {
                    dp1[j][k]=DP1[j][k];
                    DP1[j][k]=0;
                }
            }
            memset(sum1,0,sizeof(sum1));
            for(int k=1;k<=n;k++)
            {
                for(int j=1;j<=n;j++)
                sum1[k]+=dp1[j][k];
            }
            lt=v;
        }
        bool mk=0;
        for(int j=1;j<=n;j++)
        {
            if(k>=dp1[j][1])
            {
                k-=dp1[j][1];
            }
            else if(dp1[j][1]!=0)
            {
                ans.push_back(j);
                st.insert(j);
                mk=1;
                break;
            }
        }
        if(!mk)
        {
            cout<<-1<<'\n';
            return ;
        }
    }
    for(auto v:ans)
    cout<<v<<' ';
}
signed main()
{
    ios::sync_with_stdio(0), cin.tie(0) ;
    int t= 1;
    // cin>>t;
    while(t--)solve();
}

详细

Test #1:

score: 100
Accepted
time: 272ms
memory: 506564kb

input:

3 2

output:

2 1 3 

result:

ok 3 number(s): "2 1 3"

Test #2:

score: 0
Accepted
time: 283ms
memory: 505052kb

input:

3 5

output:

-1

result:

ok 1 number(s): "-1"

Test #3:

score: 0
Accepted
time: 281ms
memory: 505336kb

input:

4 6

output:

3 1 2 4 

result:

ok 4 number(s): "3 1 2 4"

Test #4:

score: 0
Accepted
time: 267ms
memory: 504244kb

input:

4 11

output:

-1

result:

ok 1 number(s): "-1"

Test #5:

score: 0
Accepted
time: 286ms
memory: 504152kb

input:

3 1

output:

1 3 2 

result:

ok 3 number(s): "1 3 2"

Test #6:

score: 0
Accepted
time: 291ms
memory: 505308kb

input:

3 10

output:

-1

result:

ok 1 number(s): "-1"

Test #7:

score: 0
Accepted
time: 261ms
memory: 506296kb

input:

3 52

output:

-1

result:

ok 1 number(s): "-1"

Test #8:

score: 0
Accepted
time: 300ms
memory: 506380kb

input:

3 756

output:

-1

result:

ok 1 number(s): "-1"

Test #9:

score: 0
Accepted
time: 263ms
memory: 506396kb

input:

3 7721

output:

-1

result:

ok 1 number(s): "-1"

Test #10:

score: 0
Accepted
time: 275ms
memory: 506412kb

input:

5 1

output:

1 3 2 5 4 

result:

ok 5 number(s): "1 3 2 5 4"

Test #11:

score: 0
Accepted
time: 292ms
memory: 504520kb

input:

5 8

output:

2 4 1 3 5 

result:

ok 5 number(s): "2 4 1 3 5"

Test #12:

score: 0
Accepted
time: 260ms
memory: 506280kb

input:

5 85

output:

-1

result:

ok 1 number(s): "-1"

Test #13:

score: 0
Accepted
time: 258ms
memory: 504308kb

input:

5 846

output:

-1

result:

ok 1 number(s): "-1"

Test #14:

score: 0
Accepted
time: 281ms
memory: 504272kb

input:

5 6957

output:

-1

result:

ok 1 number(s): "-1"

Test #15:

score: 0
Accepted
time: 273ms
memory: 504328kb

input:

8 1

output:

1 3 2 5 4 7 6 8 

result:

ok 8 numbers

Test #16:

score: 0
Accepted
time: 278ms
memory: 505300kb

input:

8 7

output:

1 3 2 5 7 8 4 6 

result:

ok 8 numbers

Test #17:

score: 0
Accepted
time: 289ms
memory: 506504kb

input:

8 71

output:

1 3 7 5 4 2 6 8 

result:

ok 8 numbers

Test #18:

score: 0
Accepted
time: 290ms
memory: 506544kb

input:

8 863

output:

3 5 7 1 4 2 8 6 

result:

ok 8 numbers

Test #19:

score: 0
Accepted
time: 283ms
memory: 505148kb

input:

8 7099

output:

-1

result:

ok 1 number(s): "-1"

Test #20:

score: 0
Accepted
time: 280ms
memory: 505312kb

input:

10 100000

output:

10 8 4 6 9 2 7 3 5 1 

result:

ok 10 numbers

Test #21:

score: 0
Accepted
time: 284ms
memory: 504236kb

input:

10 62278

output:

7 1 9 8 5 10 3 6 2 4 

result:

ok 10 numbers

Test #22:

score: 0
Accepted
time: 258ms
memory: 504520kb

input:

10 1000000

output:

-1

result:

ok 1 number(s): "-1"

Test #23:

score: 0
Accepted
time: 292ms
memory: 504244kb

input:

10 572106

output:

-1

result:

ok 1 number(s): "-1"

Test #24:

score: 0
Accepted
time: 267ms
memory: 506328kb

input:

10 10000000

output:

-1

result:

ok 1 number(s): "-1"

Test #25:

score: 0
Accepted
time: 267ms
memory: 506356kb

input:

10 9715489

output:

-1

result:

ok 1 number(s): "-1"

Test #26:

score: 0
Accepted
time: 270ms
memory: 506356kb

input:

10 100000000

output:

-1

result:

ok 1 number(s): "-1"

Test #27:

score: 0
Accepted
time: 274ms
memory: 506312kb

input:

10 85089137

output:

-1

result:

ok 1 number(s): "-1"

Test #28:

score: 0
Accepted
time: 264ms
memory: 506352kb

input:

10 1000000000

output:

-1

result:

ok 1 number(s): "-1"

Test #29:

score: 0
Accepted
time: 266ms
memory: 504228kb

input:

10 906109922

output:

-1

result:

ok 1 number(s): "-1"

Test #30:

score: 0
Accepted
time: 284ms
memory: 506536kb

input:

15 100000

output:

1 3 2 5 7 9 13 15 11 6 4 14 10 8 12 

result:

ok 15 numbers

Test #31:

score: 0
Accepted
time: 288ms
memory: 505128kb

input:

15 99389

output:

1 3 2 5 7 9 13 15 6 4 11 8 10 14 12 

result:

ok 15 numbers

Test #32:

score: 0
Accepted
time: 286ms
memory: 505180kb

input:

15 1000000

output:

1 3 2 7 15 13 5 11 6 9 8 14 4 10 12 

result:

ok 15 numbers

Test #33:

score: 0
Accepted
time: 289ms
memory: 504328kb

input:

15 691130

output:

1 3 2 7 9 5 11 4 13 6 15 12 10 8 14 

result:

ok 15 numbers

Test #34:

score: 0
Accepted
time: 271ms
memory: 506348kb

input:

15 10000000

output:

1 3 7 5 4 9 13 11 6 15 10 12 14 2 8 

result:

ok 15 numbers

Test #35:

score: 0
Accepted
time: 278ms
memory: 504332kb

input:

15 8403898

output:

1 3 5 13 15 9 7 6 11 12 10 8 14 2 4 

result:

ok 15 numbers

Test #36:

score: 0
Accepted
time: 285ms
memory: 505244kb

input:

15 100000000

output:

1 9 5 7 13 11 12 3 15 10 14 2 6 4 8 

result:

ok 15 numbers

Test #37:

score: 0
Accepted
time: 270ms
memory: 505080kb

input:

15 80159790

output:

1 7 9 15 11 5 13 3 4 8 12 10 14 2 6 

result:

ok 15 numbers

Test #38:

score: 0
Accepted
time: 281ms
memory: 505292kb

input:

15 1000000000

output:

4 14 10 6 15 8 2 5 12 3 11 7 13 9 1 

result:

ok 15 numbers

Test #39:

score: 0
Accepted
time: 272ms
memory: 506368kb

input:

15 941321083

output:

4 12 2 14 10 8 9 1 3 6 7 13 11 5 15 

result:

ok 15 numbers

Test #40:

score: 0
Accepted
time: 271ms
memory: 505156kb

input:

20 100000000000000

output:

3 15 9 13 1 19 7 5 14 11 6 20 8 12 10 17 16 2 4 18 

result:

ok 20 numbers

Test #41:

score: 0
Accepted
time: 276ms
memory: 504232kb

input:

20 88340160907341

output:

3 9 7 15 5 17 19 16 13 11 14 12 1 18 8 20 6 10 4 2 

result:

ok 20 numbers

Test #42:

score: 0
Accepted
time: 276ms
memory: 505228kb

input:

20 1000000000000000

output:

-1

result:

ok 1 number(s): "-1"

Test #43:

score: 0
Accepted
time: 273ms
memory: 506280kb

input:

20 825683798851116

output:

-1

result:

ok 1 number(s): "-1"

Test #44:

score: 0
Accepted
time: 270ms
memory: 505144kb

input:

20 10000000000000000

output:

-1

result:

ok 1 number(s): "-1"

Test #45:

score: 0
Accepted
time: 283ms
memory: 504512kb

input:

20 7757196171989613

output:

-1

result:

ok 1 number(s): "-1"

Test #46:

score: 0
Accepted
time: 289ms
memory: 506472kb

input:

20 100000000000000000

output:

-1

result:

ok 1 number(s): "-1"

Test #47:

score: 0
Accepted
time: 261ms
memory: 506340kb

input:

20 97697763625539018

output:

-1

result:

ok 1 number(s): "-1"

Test #48:

score: 0
Accepted
time: 279ms
memory: 506316kb

input:

20 1000000000000000000

output:

-1

result:

ok 1 number(s): "-1"

Test #49:

score: 0
Accepted
time: 302ms
memory: 505072kb

input:

20 828662389005083354

output:

-1

result:

ok 1 number(s): "-1"

Test #50:

score: 0
Accepted
time: 270ms
memory: 505184kb

input:

21 100000000000000

output:

1 7 11 13 17 9 3 21 15 19 18 12 16 5 8 4 20 14 2 6 10 

result:

ok 21 numbers

Test #51:

score: 0
Accepted
time: 274ms
memory: 506344kb

input:

21 84706086886746

output:

1 7 3 9 13 17 5 15 19 8 6 11 4 21 12 2 20 18 14 10 16 

result:

ok 21 numbers

Test #52:

score: 0
Accepted
time: 273ms
memory: 504540kb

input:

21 1000000000000000

output:

3 5 1 11 2 13 9 17 21 15 12 7 4 14 10 19 18 6 20 16 8 

result:

ok 21 numbers

Test #53:

score: 0
Accepted
time: 281ms
memory: 505156kb

input:

21 554929680010592

output:

2 8 10 18 16 4 6 5 14 9 12 7 20 15 11 1 13 21 3 17 19 

result:

ok 21 numbers

Test #54:

score: 0
Accepted
time: 274ms
memory: 506588kb

input:

21 10000000000000000

output:

-1

result:

ok 1 number(s): "-1"

Test #55:

score: 0
Accepted
time: 265ms
memory: 506408kb

input:

21 6191328159326492

output:

14 4 2 10 1 6 5 20 12 8 9 7 16 18 21 15 11 13 3 19 17 

result:

ok 21 numbers

Test #56:

score: 0
Accepted
time: 269ms
memory: 505344kb

input:

21 100000000000000000

output:

-1

result:

ok 1 number(s): "-1"

Test #57:

score: 0
Accepted
time: 283ms
memory: 505336kb

input:

21 78209209037176977

output:

-1

result:

ok 1 number(s): "-1"

Test #58:

score: 0
Accepted
time: 265ms
memory: 504512kb

input:

21 1000000000000000000

output:

-1

result:

ok 1 number(s): "-1"

Test #59:

score: 0
Accepted
time: 271ms
memory: 506332kb

input:

21 924750540534119586

output:

-1

result:

ok 1 number(s): "-1"

Test #60:

score: 0
Accepted
time: 282ms
memory: 506284kb

input:

22 100000000000000

output:

1 3 5 21 19 15 22 2 11 9 10 7 6 4 20 17 18 16 13 14 12 8 

result:

ok 22 numbers

Test #61:

score: 0
Accepted
time: 272ms
memory: 504276kb

input:

22 81076307833447

output:

1 3 5 17 15 9 13 11 14 7 19 12 8 18 4 2 21 20 22 16 6 10 

result:

ok 22 numbers

Test #62:

score: 0
Accepted
time: 263ms
memory: 504276kb

input:

22 1000000000000000

output:

1 5 19 21 17 13 11 20 7 12 3 15 22 9 16 18 6 2 10 8 14 4 

result:

ok 22 numbers

Test #63:

score: 0
Accepted
time: 272ms
memory: 506520kb

input:

22 784179856137365

output:

1 5 11 13 12 7 19 21 3 9 17 18 15 22 14 6 8 2 20 10 4 16 

result:

ok 22 numbers

Test #64:

score: 0
Accepted
time: 299ms
memory: 504344kb

input:

22 10000000000000000

output:

2 16 4 6 5 20 18 10 8 22 12 14 11 17 1 13 19 9 7 3 15 21 

result:

ok 22 numbers

Test #65:

score: 0
Accepted
time: 277ms
memory: 505332kb

input:

22 9625464441630667

output:

2 14 12 16 18 10 11 20 22 4 19 6 8 7 17 9 21 15 3 5 13 1 

result:

ok 22 numbers

Test #66:

score: 0
Accepted
time: 274ms
memory: 504280kb

input:

22 100000000000000000

output:

16 20 8 2 6 4 18 12 14 13 5 17 3 10 9 15 7 22 11 21 1 19 

result:

ok 22 numbers

Test #67:

score: 0
Accepted
time: 267ms
memory: 506284kb

input:

22 58720645858880344

output:

10 8 2 6 7 4 16 18 9 12 14 17 11 20 22 3 19 5 21 1 13 15 

result:

ok 22 numbers

Test #68:

score: 0
Accepted
time: 273ms
memory: 505032kb

input:

22 1000000000000000000

output:

-1

result:

ok 1 number(s): "-1"

Test #69:

score: 0
Accepted
time: 271ms
memory: 505336kb

input:

22 797466650913412732

output:

-1

result:

ok 1 number(s): "-1"

Test #70:

score: 0
Accepted
time: 287ms
memory: 504300kb

input:

23 100000000000000

output:

1 3 2 9 13 15 19 11 5 23 17 21 20 14 18 7 10 6 22 16 4 8 12 

result:

ok 23 numbers

Test #71:

score: 0
Accepted
time: 297ms
memory: 504496kb

input:

23 77446528780149

output:

1 3 2 7 21 9 23 5 19 20 8 17 11 15 6 18 22 13 14 10 4 16 12 

result:

ok 23 numbers

Test #72:

score: 0
Accepted
time: 275ms
memory: 504208kb

input:

23 1000000000000000

output:

1 3 5 17 15 16 21 23 4 9 13 7 2 14 19 11 8 10 6 18 12 20 22 

result:

ok 23 numbers

Test #73:

score: 0
Accepted
time: 265ms
memory: 505264kb

input:

23 513430032264138

output:

1 3 5 7 13 17 9 8 11 23 10 6 4 21 15 14 19 16 18 12 20 2 22 

result:

ok 23 numbers

Test #74:

score: 0
Accepted
time: 284ms
memory: 506348kb

input:

23 10000000000000000

output:

1 5 9 21 19 3 23 11 2 15 22 20 4 13 17 7 14 6 10 12 18 8 16 

result:

ok 23 numbers

Test #75:

score: 0
Accepted
time: 296ms
memory: 504252kb

input:

23 8059600723934841

output:

1 5 3 9 21 7 17 11 4 19 6 23 8 20 13 15 18 2 10 12 16 22 14 

result:

ok 23 numbers

Test #76:

score: 0
Accepted
time: 276ms
memory: 506548kb

input:

23 100000000000000000

output:

2 8 10 14 12 6 18 4 13 11 20 19 3 1 22 7 23 21 16 9 17 5 15 

result:

ok 23 numbers

Test #77:

score: 0
Accepted
time: 252ms
memory: 504324kb

input:

23 62604119535359335

output:

1 21 17 5 11 3 4 19 23 7 20 9 13 15 8 18 22 14 6 2 10 16 12 

result:

ok 23 numbers

Test #78:

score: 0
Accepted
time: 250ms
memory: 506300kb

input:

23 1000000000000000000

output:

12 8 6 22 4 20 2 14 13 16 1 7 18 10 9 11 17 3 15 23 21 19 5 

result:

ok 23 numbers

Test #79:

score: 0
Accepted
time: 278ms
memory: 506300kb

input:

23 670182765587673173

output:

8 14 18 12 10 22 16 15 4 9 11 20 2 6 7 19 17 21 5 23 3 1 13 

result:

ok 23 numbers

Test #80:

score: 0
Accepted
time: 288ms
memory: 505092kb

input:

30 100000000000000

output:

1 3 2 5 4 7 6 9 8 11 13 29 27 23 30 10 19 17 18 15 14 12 28 25 26 24 21 22 20 16 

result:

ok 30 numbers

Test #81:

score: 0
Accepted
time: 267ms
memory: 504316kb

input:

30 67586042048201

output:

1 3 2 5 4 7 6 9 8 11 13 21 27 29 15 10 17 19 20 23 12 28 22 25 16 26 18 24 14 30 

result:

ok 30 numbers

Test #82:

score: 0
Accepted
time: 279ms
memory: 506292kb

input:

30 1000000000000000

output:

1 3 2 5 4 7 6 9 8 13 27 29 25 21 19 28 15 20 11 23 30 17 24 26 14 10 18 16 22 12 

result:

ok 30 numbers

Test #83:

score: 0
Accepted
time: 282ms
memory: 506380kb

input:

30 759815786187925

output:

1 3 2 5 4 7 6 9 8 13 17 29 25 27 19 26 11 18 10 23 21 22 28 15 14 24 12 30 16 20 

result:

ok 30 numbers

Test #84:

score: 0
Accepted
time: 292ms
memory: 506312kb

input:

30 10000000000000000

output:

1 3 2 5 4 7 6 9 11 19 10 27 13 25 21 26 12 15 23 29 14 17 8 16 22 18 28 24 30 20 

result:

ok 30 numbers

Test #85:

score: 0
Accepted
time: 273ms
memory: 506344kb

input:

30 8268632993693498

output:

1 3 2 5 4 7 6 9 11 15 23 17 21 19 20 13 25 27 26 29 8 16 30 18 12 10 14 22 28 24 

result:

ok 30 numbers

Test #86:

score: 0
Accepted
time: 279ms
memory: 506308kb

input:

30 100000000000000000

output:

1 3 2 5 4 7 6 9 29 15 11 13 21 25 30 27 10 28 8 26 23 14 19 22 12 20 24 17 18 16 

result:

ok 30 numbers

Test #87:

score: 0
Accepted
time: 288ms
memory: 504232kb

input:

30 70413882594766775

output:

1 3 2 5 4 7 6 9 23 17 8 25 13 24 11 21 12 19 27 20 29 15 14 10 16 18 26 22 28 30 

result:

ok 30 numbers

Test #88:

score: 0
Accepted
time: 312ms
memory: 505280kb

input:

30 1000000000000000000

output:

1 3 2 5 4 7 6 29 27 11 13 28 15 17 12 21 16 19 25 30 9 23 8 26 20 18 14 10 24 22 

result:

ok 30 numbers

Test #89:

score: 0
Accepted
time: 302ms
memory: 505044kb

input:

30 508539703844690157

output:

1 3 2 5 4 7 6 19 21 9 25 15 27 17 23 29 26 30 11 20 13 10 14 28 16 18 22 8 12 24 

result:

ok 30 numbers

Test #90:

score: -100
Wrong Answer
time: 294ms
memory: 506336kb

input:

40 100000000000000

output:

3 1 2 5 4 7 6 9 8 11 10 13 12 15 14 17 16 19 18 21 20 23 22 25 24 27 26 29 28 31 30 33 32 35 34 37 36 39 38 40 

result:

wrong answer 1st numbers differ - expected: '1', found: '3'