oj.uz

답안 #744955

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
744955 2023-05-19T08:57:33 Z sword060 Magneti (COCI21_magneti) C++17
0 / 110
 223 ms 524288 KB 
#include <bits/stdc++.h>
using namespace std;
const int N=10005,M=1e9+7;
long long x,k,dp[N][1<<10][11],dp2[N][51],a[N];
long long rec(int i,int msk,int lst){
  if(i>k)return 0;
  if((msk^(1<<lst))==0)return k-i+1;
  if(~dp[i][msk][lst])return dp[i][msk][lst];
  long long ret=rec(i+1,msk,lst)%M;
  for(int nxt=0;nxt<x;nxt++)
    if(msk&(1<<nxt))
      ret=(ret+rec(i+max(a[lst+1],a[nxt+1]),msk^(1<<lst),nxt))%M;
  return dp[i][msk][lst]=ret;
}
long long rec2(int i,int j){
  if(j==0)return 1;
  if(i>k)return 0;
  if(~dp2[i][j])return dp2[i][j];
  long long ret=(((rec2(i+a[1],j-1)*j)%M)+(rec2(i+1,j)%M))%M;
  return dp2[i][j]=ret;
}
int main(){
  ios::sync_with_stdio(0);cin.tie(0);
  cin>>x>>k;
  for(int i=1;i<=x;i++)cin>>a[i];
  if(x<=10){
    memset(dp,-1,sizeof(dp));
    long long sum=0;
    for(int i=0;i<x;i++)sum=(sum+rec(1,(1<<x)-1,i))%M;
    cout<<sum;
  }else{
    memset(dp2,-1,sizeof(dp2));
    cout<<rec2(1,x);
  }
  return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 4944 KB Output is correct
2 Correct 3 ms 4292 KB Output is correct
3 Correct 4 ms 4808 KB Output is correct
4 Runtime error 199 ms 524288 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 223 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

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

Subtask #4
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 4944 KB Output is correct
2 Correct 3 ms 4292 KB Output is correct
3 Correct 4 ms 4808 KB Output is correct
4 Runtime error 199 ms 524288 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -