Submission #634840

# Submission time Handle Problem Language Result Execution time Memory
634840 2022-08-25T06:31:04 Z kabika Jump (BOI06_jump) C++14
70 / 100
1 ms 468 KB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr ll MOD = 1e9 + 7;
#define pb push_back

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin >> n;
	vector<vector<int>> v(n,vector<int>(n));
	vector<vector<ll>> dp(n,vector<ll>(n,0));
	
	for(int i = 0; i < n; ++i)
	{
	    for(int j = 0; j < n; ++j)
	        cin >> v[i][j];
	}
	
	dp[0][0] = 1;
	for(int i = 0; i < n; ++i)
	{
	    for(int j = 0; j < n; ++j)
	    {
	        if(v[i][j] == 0)
	            continue;
	        if(i+v[i][j] < n)
	            dp[i+v[i][j]][j] += dp[i][j];
	        if(j+v[i][j] < n)
	            dp[i][j+v[i][j]] += dp[i][j];
	    }
	}
	
	/*for(int i = 0; i < n; ++i)
	{
	    for(int j = 0; j < n; ++j)
	        cout << dp[i][j] << " ";
	    cout << '\n';
	}*/
	
	cout << dp[n-1][n-1] << '\n';
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 320 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Incorrect 1 ms 340 KB Output isn't correct
16 Incorrect 1 ms 340 KB Output isn't correct
17 Incorrect 1 ms 332 KB Output isn't correct
18 Incorrect 1 ms 340 KB Output isn't correct
19 Incorrect 1 ms 340 KB Output isn't correct
20 Incorrect 1 ms 468 KB Output isn't correct