제출 #634893

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
634893		vendx_greyback	Jump (BOI06_jump)	C++17	70 / 100	1 ms	468 KiB

jump

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(),(x).end()

typedef pair<int,int> ppi;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;

string add(string num1, string num2){
    
    while(num1.size() < num2.size())
        num1.push_back('0');
        
    while(num1.size() > num2.size())
        num2.push_back('0');
        
    string ans;
    int carry = 0;
    
    for(int i = 0; i < num1.size(); i++){
        int curr = (num1[i] - '0') + (num2[i] - '0') + carry;
        ans.push_back((curr % 10) + '0');
        carry = curr / 10;
    }
    
    if(carry)
        ans.push_back(carry - '0');
        
    return ans;
    
}

int32_t main() {
	
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n;
	cin>>n;
	
	int grid[n][n];
	for(int i = 0; i < n; i++)
	    for(int j = 0; j < n; j++)
	        cin>>grid[i][j];
	        
	int dp[n][n];
	
	for(int i = n-1; i >= 0; i--){
	    for(int j = n-1; j >= 0; j--){
	        
	        if(i == n-1 && j == n-1){
	            dp[i][j] = 1;
	            continue;
	        } 
	        
	        
	        dp[i][j] = 0;
	        
	        if(i + grid[i][j] < n)
	            dp[i][j] = dp[i][j] + dp[i + grid[i][j]][j];
	            
	        if(j + grid[i][j] < n)
	            dp[i][j] = dp[i][j] + dp[i][j + grid[i][j]];
	        
	        
	    }
	}

	cout<<dp[0][0];
	
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

jump.cpp: In function 'std::string add(std::string, std::string)':
jump.cpp:21:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |     for(int i = 0; i < num1.size(); i++){
      |                    ~~^~~~~~~~~~~~~

• Subtask 1: 70 / 100