#458886 (C++14) No.1 道のショートカット

提出ソース

結果

問題	No.1 道のショートカット
ユーザー	fumiphys
提出日時	2020-04-04 23:34:07
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	13 ms / 5,000 ms
コード長	4,956 bytes
コンパイル時間	1,756 ms
コンパイル使用メモリ	183,708 KB
実行使用メモリ	9,200 KB
最終ジャッジ日時	2023-09-27 22:27:16
合計ジャッジ時間	3,388 ms
ジャッジサーバーID （参考情報）	judge12 / judge15

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 4,380 KB
testcase_01	AC	1 ms 4,380 KB
testcase_02	AC	1 ms 4,376 KB
testcase_03	AC	1 ms 4,376 KB
testcase_04	AC	2 ms 4,376 KB
testcase_05	AC	2 ms 4,380 KB
testcase_06	AC	2 ms 4,380 KB
testcase_07	AC	1 ms 4,380 KB
testcase_08	AC	11 ms 7,572 KB
testcase_09	AC	6 ms 5,604 KB
testcase_10	AC	4 ms 4,688 KB
testcase_11	AC	6 ms 5,712 KB
testcase_12	AC	13 ms 9,200 KB
testcase_13	AC	13 ms 8,940 KB
testcase_14	AC	2 ms 4,376 KB
testcase_15	AC	2 ms 4,380 KB
testcase_16	AC	4 ms 4,380 KB
testcase_17	AC	2 ms 4,376 KB
testcase_18	AC	2 ms 4,380 KB
testcase_19	AC	3 ms 4,384 KB
testcase_20	AC	4 ms 4,380 KB
testcase_21	AC	4 ms 4,468 KB
testcase_22	AC	3 ms 4,376 KB
testcase_23	AC	10 ms 7,684 KB
testcase_24	AC	11 ms 8,352 KB
testcase_25	AC	6 ms 5,176 KB
testcase_26	AC	4 ms 4,668 KB
testcase_27	AC	11 ms 7,236 KB
testcase_28	AC	2 ms 4,376 KB
testcase_29	AC	3 ms 4,428 KB
testcase_30	AC	2 ms 4,380 KB
testcase_31	AC	3 ms 4,380 KB
testcase_32	AC	8 ms 6,396 KB
testcase_33	AC	6 ms 5,484 KB
testcase_34	AC	8 ms 6,776 KB
testcase_35	AC	2 ms 4,376 KB
testcase_36	AC	3 ms 4,380 KB
testcase_37	AC	2 ms 4,380 KB
testcase_38	AC	2 ms 4,376 KB
testcase_39	AC	3 ms 4,376 KB
testcase_40	AC	2 ms 4,376 KB
testcase_41	AC	1 ms 4,376 KB
testcase_42	AC	1 ms 4,376 KB
testcase_43	AC	2 ms 4,376 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL<<(n))
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20);}
} fast_io_;

template <typename T>
struct Graph {
  int n;
  vector<vector<pair<int, T> > > edge;
  vector<T> dis;
  Graph(int n): n(n) {
    edge.resize(n);
    dis.resize(n);
  }
  void dijkstra(int s){
    dijkstra(s, 0);
  }
  T dijkstra(int s, int t){
    // initialize
    fill(dis.begin(), dis.end(), -1);
    vector<bool> used(n, false);
    dis[s] = 0;
    // dijkstra
    priority_queue<pair<T, int>, vector<pair<T, int> >, greater<pair<T, int> > > q;
    q.push(make_pair(0, s));
    while(!q.empty()){
      pair<T, int> p = q.top(); q.pop();
      int at = p.second;
      T distance = p.first;
      if(used[at])continue;
      used[at] = true;
      for(auto itr = edge[at].begin(); itr != edge[at].end(); ++itr){
        int to = (*itr).first;
        T cost = (*itr).second;
        if(used[to])continue;
        if(dis[to] == -1 || dis[to] > distance + cost){
          q.push(make_pair(distance + cost, to));
          dis[to] = distance + cost;
        }
      }
    }
    return dis[t];
  }
  void adde(int at, int to, T cost){
    edge[at].push_back(make_pair(to, cost));
  }
  [[deprecated("This function takes O(|edge[at]|).")]]
  void remove(int at, int to){
    int index = -1;
    for(int i = 0; i < edge[at].size(); i++){
      if(edge[at][i].first == to){
        index = i;
        break;
      }
    }
    edge[at].erase(edge[at].begin() + index);
  }
};

using GraphI = Graph<int>;
using GraphL = Graph<ll>;
using GraphD = Graph<double>;

int n;
int idx(int i, int c){
  return c * n + i;
}

int main(int argc, char const* argv[])
{
  int c, v; cin >> n >> c >> v;
  vector<int> s(v), t(v), y(v), m(v); cin >> s >> t >> y >> m;
  GraphL g(n * (c + 1));
  rep(i, v)s[i]--;
  rep(i, v)t[i]--;
  rep(i, v){
    rep(j, c + 1){
      if(j+y[i]<=c)g.adde(idx(s[i], j), idx(t[i], j+y[i]), m[i]);
    }
  }
  g.dijkstra(idx(0, 0));
  ll res = linf;
  rep(j, c + 1){
    if(g.dis[idx(n-1, j)] >= 0)chmin(res, g.dis[idx(n-1, j)]);
  }
  cout << (res == linf ? -1: res) << endl;
  return 0;
}

yukicoder

結果

テストケース

ソースコード