제출 #1326858

#제출 시각아이디문제언어결과실행 시간메모리
1326858Faisal_SaqibJump (BOI06_jump)C++20
70 / 100
2 ms568 KiB
#include <iostream> using namespace std; typedef long long ll; const int N=102; ll dp[N][N],g[N][N]; int main() { int n; cin>>n; for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { cin>>g[i][j]; } } g[n][n]=0; dp[n][n]=1; for(int i=n;i>=1;i--) { for(int j=n;j>=1;j--) { if(g[i][j]==0)continue; if(j+g[i][j]<=n) dp[i][j]+=dp[i][j+g[i][j]]; if(i+g[i][j]<=n) dp[i][j]+=dp[i+g[i][j]][j]; } } cout<<dp[1][1]<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...