Submission #54596528

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<pii, int> piii;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<pii> vii;
 #define INF 10000000000000000
#define inf 1000000000
// #define MOD  1000000007
// #define MOD 672804213107214
// #define MOD 998244353
#define PI 3.1415926535897932385
 #define pb push_back
#define bitc __builtin_popcountll
#define mp make_pair
#define all(ar) ar.begin(), ar.end()
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<pii, int> piii;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<pii> vii;
 #define INF 10000000000000000
#define inf 1000000000
// #define MOD  1000000007
// #define MOD 672804213107214
// #define MOD 998244353
#define PI 3.1415926535897932385
 #define pb push_back
#define bitc __builtin_popcountll
#define mp make_pair
#define all(ar) ar.begin(), ar.end()
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define rep(i, n) for (int i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define foreach(it, ar) for (auto it = ar.begin(); it != ar.end(); it++)
#define fil(ar, val) memset(ar, val, sizeof(ar))  // 0x3f for inf, 0x80 for -INF can also use with pairs
#define print(a) for(auto x : a) cout << x << " "; cout << endl
#define print1(a) for(auto x : a) cout << x.first << " " << x.second << endl
#define print2(a,x,y)  for(int i = x; i < y; i++) cout<< a[i]<< " "; cout << endl
#define bug(...)       __f (#__VA_ARGS__, __VA_ARGS__)
 template <typename Arg1>
void __f (const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << endl; }
template <typename Arg1, typename... Args>
void __f (const char* names, Arg1&& arg1, Args&&... args)
{
   const char* comma = strchr (names + 1, ',');
   cout.write (names, comma - names) << " : " << arg1 << " | "; __f (comma + 1, args...);
}
void solve()
{
  //vector<int> sieve(N+1,0); //fill constructor
    //primeSieve(sieve);
    ll h,w,k;
    cin>>h>>w>>k;
    ll x,y;
    cin>>x>>y;
    ll k2=k;
    ll n=h;
    ll m=w;
    ll arr[h][w];
    for(int i=0;i<h;i++)
    {
        for(int j=0;j<w;j++)
        cin>>arr[i][j];
    }
    queue<pair<ll,ll>>q;
    vector<vector<ll>>dp2(h*w,vector<ll>(2500,-1));
    dp2[(x-1)*w+(y-1)][0]=0;
    ll maxn=0;
    for(int k1=1;k1<=min(k,2500LL);k1++)
    {
        for(int i=0;i<h;i++)
        {
            for(int j=0;j<w;j++)
            {
                vector<pair<ll,ll>>vec={{0,0},{-1,0},{0,1},{1,0},{0,-1}};
                for(int k=0;k<vec.size();k++)
                {
                    ll x1=vec[k].first;
                    ll y1=vec[k].second;
                    if(i+x1>=0&&(i+x1<n)&&(j+y1)>=0&&(j+y1)<m)
                    {
                        if(dp2[(i+x1)*w+j+y1][k1-1]!=-1)
                        {
                    
                        dp2[i*w+j][k1]=max(dp2[i*w+j][k1],dp2[(i+x1)*w+j+y1][k1-1]+arr[i][j]);
                        maxn=max(maxn,dp2[i*w+j][k1]+(k2-k1)*(arr[i][j]));
                        // cout<<arr[i][j]<<" "<<k-k1<<" "<<i<<" "<<j<<"\n";
                        }
                    }
                }
            }
        }
    }
    cout<<maxn;
}
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0), cout.precision(15);   cout<<fixed;
int t=1;
// cin>>t;
while(t--)
{
   solve();
}
}

Submission Info

Compile Error

Main.cpp: In function ‘void solve()’:
Main.cpp:68:30: warning: comparison of integer expressions of different signedness: ‘long long int’ and ‘std::vector<std::pair<long long int, long long int> >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   68 |                 for(int k=0;k<vec.size();k++)
      |                             ~^~~~~~~~~~~

Judge Result