oj.uz

Submission #557120

# Submission time Handle Problem Language Result Execution time Memory
557120 2022-05-04T18:30:58 Z new_acc Magneti (COCI21_magneti) C++14
50 / 110
 1000 ms 64204 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
#define pitem item*
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
const int N=50+10;
const int SS=1<<19;
const int INFi=2e9;
const ll INFl=1e13;
const ll mod2=998244353;
const ll mod=1e9+7;
const ll mod3=1000696969;
const ll p=70032301;
const ull p2=913;
const int L=20;
int t[N];
ll dp1[N][10*1000+10][2][2],dp2[N][10*1000+10][2][2],sp1[N][10*1000+10][2][2],sp2[N][10*1000+10][2][2];
void solve(){
    int n,k;
    cin>>n>>k;
    for(int i=1;i<=n;t[i]--,i++) cin>>t[i];
    if(1==n){
        cout<<k<<"\n";
        return;
    }
    sort(t+1,t+1+n);
    dp1[0][0][1][1]=1;
    for(int i=1;i<=n;i++){
        for(int i2=0;i2<=n;i2++){
            for(int k1=0;k1<2;k1++) for(int k2=0;k2<2;k2++){
                sp1[i2][0][k1][k2]=dp1[i2][0][k1][k2];
                for(int sum=1;sum<=k;sum++)
                    (sp1[i2][sum][k1][k2]=sp1[i2][sum-1][k1][k2]+dp1[i2][sum][k1][k2])%=mod;
                ll curr=dp1[i2][0][k1][k2];
                sp2[i2][0][k1][k2]=dp1[i2][0][k1][k2];
                for(int sum=1;sum<=k;sum++) 
                    (curr+=dp1[i2][sum][k1][k2])%=mod,(sp2[i2][sum][k1][k2]=sp2[i2][sum-1][k1][k2]+curr)%=mod; 
            }
        }
        //nowa spojna
        for(int i2=1;i2<=n;i2++){
            for(int sum=1;sum<=k;sum++){
                (dp2[i2][sum][0][0]=dp1[i2-1][sum-1][0][0]*(ll)(i2-2)+sp1[i2-1][sum-1][1][0]+sp1[i2-1][sum-1][0][1]);
                (dp2[i2][sum][1][0]=dp1[i2-1][sum-1][1][0]*(ll)(i2-1)+sp1[i2-1][sum-1][1][1]);
                (dp2[i2][sum][1][1]=dp1[i2-1][sum-1][1][1]*(ll)(i2));
                (dp2[i2][sum][0][1]=dp1[i2-1][sum-1][0][1]*(ll)(i2-1)+sp1[i2-1][sum-1][1][1]);
            }
        }
        //na koniec spojnej
        for(int i2=1;i2<=n;i2++){
            for(int sum=t[i]+1;sum<=k;sum++){
                for(int k1=0;k1<2;k1++) for(int k2=0;k2<2;k2++){
                    (dp2[i2][sum][k1][k2]+=sp1[i2][sum-t[i]-1][k1][k2]*(ll)(i2*2-(k1^1)-(k2^1)));
                    if(!k1) (dp2[i2][sum][k1][k2]+=sp2[i2][sum-t[i]-1][1][k2]);
                    if(!k2) (dp2[i2][sum][k1][k2]+=sp2[i2][sum-t[i]-1][k1][1]);
                }
            }
        }
        //laczenie spojnych 
        for(int i2=1;i2<n;i2++){
            for(int sum=(t[i]<<1)+1;sum<=k;sum++){
                for(int k1=0;k1<2;k1++) for(int k2=0;k2<2;k2++){
                    (dp2[i2][sum][k1][k2]+=sp2[i2+1][sum-(t[i]<<1)-1][k1][k2]*(ll)(i2));
                }
            }
        }
        for(int i2=0;i2<=n;i2++){
            for(int sum=0;sum<=k;sum++){
                for(int k1=0;k1<2;k1++) for(int k2=0;k2<2;k2++){
                    dp1[i2][sum][k1][k2]=dp2[i2][sum][k1][k2]%mod;
                    dp2[i2][sum][k1][k2]=0;
                }
            }
        }
    }
    cout<<dp1[1][k][0][0]<<"\n";
}
int main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    int tt=1;
    while(tt--) solve();
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1090 ms 64204 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 14120 KB Output is correct
2 Correct 5 ms 3028 KB Output is correct
3 Correct 67 ms 14112 KB Output is correct
4 Correct 10 ms 5204 KB Output is correct
5 Correct 68 ms 14120 KB Output is correct
6 Correct 10 ms 4308 KB Output is correct
7 Correct 64 ms 14040 KB Output is correct
8 Correct 6 ms 1796 KB Output is correct
9 Correct 9 ms 4380 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 2040 KB Output is correct
2 Correct 5 ms 1304 KB Output is correct
3 Correct 14 ms 2092 KB Output is correct
4 Correct 7 ms 1492 KB Output is correct
5 Correct 15 ms 2004 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 14 ms 2044 KB Output is correct
8 Correct 2 ms 852 KB Output is correct
9 Correct 6 ms 1364 KB Output is correct
10 Correct 2 ms 852 KB Output is correct

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1090 ms 64204 KB Time limit exceeded
2 Halted 0 ms 0 KB -