oj.uz

Submission #635030

# Submission time Handle Problem Language Result Execution time Memory
635030 2022-08-25T10:19:42 Z kabika Jump (BOI06_jump) C++14
100 / 100
 9 ms 1108 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;
    auto sx = (x.size());
    auto sy = (y.size());
    if(sx > sy)
    {
        swap(x,y);
        swap(sx,sy);
    }
    if(sx < sy)
    {
        for(auto 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));
    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]]);
	    }
	}
	
	reverse(dp[n-1][n-1].begin(),dp[n-1][n-1].end());
	cout << dp[n-1][n-1] << '\n';
	return 0;
}

Compilation message

jump.cpp: In function 'std::string add(std::string, std::string)':
jump.cpp:23:22: warning: comparison of integer expressions of different signedness: 'int' and 'long unsigned int' [-Wsign-compare]
   23 |     for(int i = 0; i < sy; ++i)
      |                    ~~^~~~

Subtask #1
100.0 / 100.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 0 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 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 284 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 5 ms 724 KB Output is correct
17 Correct 3 ms 596 KB Output is correct
18 Correct 6 ms 852 KB Output is correct
19 Correct 6 ms 724 KB Output is correct
20 Correct 9 ms 1108 KB Output is correct