Submission #336029

#	Time	Username	Problem	Language	Result	Execution time	Memory
336029		monus1042	Maja (COCI18_maja)	C++17	11 / 110	92 ms	65536 KiB

maja

    // NK
    #include <bits/stdc++.h>
    using namespace std;
     
    typedef pair<int,int> ii;
    typedef int ll;
    typedef vector<int> vi;
    typedef vector<ii> vii;
    typedef vector<ll> vll;
    #define pb push_back
    #define eb emplace_back
    #define all(x) x.begin(), x.end()
    #define Bolivia_is_nice ios::sync_with_stdio(false), cin.tie(nullptr)
     
    //typedef tree<ii, null_type, less<ii>, rb_tree_tag, tree_order_statistics_node_update> ord_set;
     
    int ma[100][100];
    ll dp[100][100][1000];
    int dx[] = {1, 0, -1, 0};
    int dy[] = {0, -1, 0, 1};
    int a,b,n,m;
     
    ll f(int r, int c, int st){
    	if (st == -1){ // base case
    		if (r == a && c == b) return 0;
    		return -2;
    	}
    	//general case
    	ll &ans = dp[r][c][st];
    	if (ans != -1) return ans;
    	for (int i=0; i<4; i++){
    		int ro = r+dy[i];
    		int co = c+dx[i];
    		if (0<=ro && ro<n && 0<=co && co<m){
    			ll temp = f(ro, co, st-1) + ma[r][c];
    			ans = max(ans, temp);
    		}
    	}
    	return ans;
    }
     
    void solve(){
    	cin>>n>>m;
    	cin>>a>>b;
    	a--, b--;
    	int k; cin >> k;
    	for (int i=0; i<n; i++){
    		for (int j=0; j<m; j++){
    			cin >> ma[i][j];
    		}
    	}
    	memset(dp, -1, sizeof dp);
    	cout << f(a,b,k-1) << '\n';
    }
     
    int main(){
    	Bolivia_is_nice;
    	solve();
    	
    	return 0;
    }
    /*
      ~/.emacs
    */

• Subtask 1: 11 / 11
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 11
• Subtask 5: 0 / 11
• Subtask 6: 0 / 11
• Subtask 7: 0 / 11
• Subtask 8: 0 / 11
• Subtask 9: 0 / 11
• Subtask 10: 0 / 11