oj.uz

Submission #634997

# Submission time Handle Problem Language Result Execution time Memory
634997 2022-08-25T10:04:07 Z kabika Jump (BOI06_jump) C++17
20 / 100
 8 ms 1028 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr ll MOD = 1e9 + 7;
#define pb push_back

string add(string x, string y)
{
    int carry = 0;
    int sx = static_cast<int>(x.size());
    int sy = static_cast<int>(y.size());
    if(sx > sy)
    {
        swap(x,y);
        swap(sx,sy);
    }
    if(sx < sy)
    {
        for(int i = sx; i < sy; ++i)
            x.pb('0');
    }
    string s = "";
    for(int i = 0; i < sy; ++i)
    {
        int a = x[i]-48;
        int b = y[i]-48;
        s.pb(static_cast<char>((a+b+carry)%10 + 48));
        carry = (a+b+carry)/10;
    }
    if(carry != 0)
        s.pb(static_cast<char>(carry + 48));
    //cout << x << "+" << y << "=" << s;
    return s;
}

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<string>> dp(n,vector<string>(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] = add(dp[i][j],dp[i+v[i][j]][j]);
	        if(j+v[i][j] < n)
	            dp[i][j+v[i][j]] = add(dp[i][j],dp[i][j+v[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;
}

Subtask #1
20.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 0 ms 212 KB Output isn't correct
6 Incorrect 0 ms 212 KB Output isn't correct
7 Incorrect 1 ms 212 KB Output isn't correct
8 Incorrect 1 ms 340 KB Output isn't correct
9 Incorrect 1 ms 340 KB Output isn't correct
10 Incorrect 1 ms 212 KB Output isn't correct
11 Incorrect 1 ms 340 KB Output isn't correct
12 Incorrect 1 ms 340 KB Output isn't correct
13 Incorrect 1 ms 340 KB Output isn't correct
14 Incorrect 1 ms 340 KB Output isn't correct
15 Incorrect 2 ms 468 KB Output isn't correct
16 Incorrect 5 ms 724 KB Output isn't correct
17 Incorrect 4 ms 596 KB Output isn't correct
18 Incorrect 6 ms 852 KB Output isn't correct
19 Incorrect 4 ms 724 KB Output isn't correct
20 Incorrect 8 ms 1028 KB Output isn't correct