Submission #46823333

---

Source Code Expand

/*
  2023/10/21
  ABC325 E
*/


//#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int  INF = 2147483647;
const ll  INF2 = 9223372036854775807;
const ll  MOD = 998244353;
const int  MOD2 = 1000000007;
const double PI = 3.14159263589793;
const long double EPS = 1e-14;

int main(){
  ll n,a,b,c;
  cin >> n >> a >> b >> c;

  vector<vector<ll>> d(n+10,vector<ll> (n+10));

  map<int,vector<pair<int,ll>>> mp;

  for(int i = 0; i < n; i++){
    for(int j = 0; j < n; j++){
      cin >> d[i][j];
    }
  }

  for(int i = 0; i < n; i++){
    for(int j = 0; j < n; j++){
      ll memo,memo2;
      if(d[i][j] != 0){
        memo = d[i][j]*a;
        memo2 = (d[i][j]*b)+c;
        d[i][j] = min(memo,memo2);
        mp[i].push_back({j,min(memo,memo2)});
      }
    }
  }

  int memo = 0;

  vector<ll> ans(n+10,INF2);

  vector<bool> ans_flag(n+10,true);

  ans[0] = 0;
  ans_flag[0] = false;

  while(true){
    int min_memo = 0;
    ll min_memo_el = INF2;
    for(int j = 0; j < mp[memo].size(); j++){
      if(ans_flag[mp[memo][j].first]){
        //cout << memo << " " << mp[memo][j].second << endl;
        ans[mp[memo][j].first] = min(ans[mp[memo][j].first],ans[memo] + mp[memo][j].second);
        if(min_memo_el > ans[mp[memo][j].first]){
          min_memo_el = ans[mp[memo][j].first];
          min_memo = mp[memo][j].first;
        }
      }
    }

    ans_flag[min_memo] = false;

    memo = min_memo;

    //cout << memo << endl;

    if(memo == n-1){
      break;
    }


  }


  cout << ans[n-1] << endl;

}

Submission Info

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:56:22: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<std::pair<int, long long int> >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   56 |     for(int j = 0; j < mp[memo].size(); j++){
      |                    ~~^~~~~~~~~~~~~~~~~

Judge Result