제출 #1291486

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1291486		omtheprogrammer1	Robot (JOI21_ho_t4)	C++20	100 / 100	1495 ms	137252 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#define endl "\n"
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define mp make_pair
#define pb push_back
#define fix(prec) {cout << setprecision(prec) << fixed;}
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL); cout.tie(NULL);
#define ins insert
#define f first
#define s second
#define all(v) v.begin(), v.end()
#define sz(v) (ll)v.size()
#define readgraph(list, edges) for (ll i = 0; i < edges; i++) {ll a, b; cin >> a >> b; a--; b--; list[a].pb(b); list[b].pb(a);}
typedef long long ll;
typedef unsigned long long ull;
typedef long double lld;
typedef vector<ll> vi;
typedef pair<ll, ll> pii;
#define F_OR(i, a, b, s) for (ll i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, 1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)
#define FOR(...) F_ORC(__VA_ARGS__)(__VA_ARGS__)
#define EACH(x, a) for (auto& x: a)

ll FIRSTTRUE(function<bool(ll)> f, ll lb, ll rb) {
  while (lb < rb) {
    ll mb = (lb + rb) / 2;
    f(mb) ? rb = mb : lb = mb + 1;
  }
  return lb;
}
ll LASTTRUE(function<bool(ll)> f, ll lb, ll rb) {
  while (lb < rb) {
    ll mb = (lb + rb + 1) / 2;
    f(mb) ? lb = mb : rb = mb - 1;
  }
  return lb;
}

void yn(bool t) {
  if (t)cout << "YES" << endl;
  else cout << "NO" << endl;
}

ll getmax(ll l, ll r, ll (*check)(ll)) {
  ll lo = l, hi = r;
  while (lo < hi) {
    ll mid = (hi + lo) >> 1;
    if (check(mid) > check(mid + 1))
      hi = mid;
    else
      lo = mid + 1;
  }
  return check(hi);
}// returns maximum//returns maximum

ll getmin(ll l, ll r, ll (*check)(ll)) {
  ll lo = l, hi = r;
  while (lo < hi) {
    ll mid = (hi + lo) >> 1;
    if (check(mid) < check(mid + 1))
      hi = mid;
    else
      lo = mid + 1;
  }
  return check(hi);
}// returns minimum//returns minimum


#ifndef DEBUG_TEMPLATE_CPP
#define DEBUG_TEMPLATE_CPP
#include <bits/stdc++.h>
// #define cerr cout
namespace __DEBUG_UTIL__
{
using namespace std;
/* Primitive Datatypes Print */
void print(const char *x) { cerr << x; }
void print(bool x) { cerr << (x ? "T" : "F"); }
void print(char x) { cerr << '\'' << x << '\''; }
void print(signed short int x) { cerr << x; }
void print(unsigned short int x) { cerr << x; }
void print(signed int x) { cerr << x; }
void print(unsigned int x) { cerr << x; }
void print(signed long int x) { cerr << x; }
void print(unsigned long int x) { cerr << x; }
void print(signed long long int x) { cerr << x; }
void print(unsigned long long int x) { cerr << x; }
void print(float x) { cerr << x; }
void print(double x) { cerr << x; }
void print(long double x) { cerr << x; }
void print(string x) { cerr << '\"' << x << '\"'; }
template <size_t N>
void print(bitset<N> x) { cerr << x; }
void print(vector<bool> v)
{ /* Overloaded this because stl optimizes vector<bool> by using
      _Bit_reference instead of bool to conserve space. */
  int f = 0;
  cerr << '{';
  for (auto && i : v)
    cerr << (f++ ? "," : "") << (i ? "T" : "F");
  cerr << "}";
}
/* Templates Declarations to support nested datatypes */
template <typename T>
void print(T &&x);
template <typename T>
void print(vector<vector<T>> mat);
template <typename T, size_t N, size_t M>
void print(T (&mat)[N][M]);
template <typename F, typename S>
void print(pair<F, S> x);
template <typename T, size_t N>
struct Tuple;
template <typename T>
struct Tuple<T, 1>;
template <typename... Args>
void print(tuple<Args...> t);
template <typename... T>
void print(priority_queue<T...> pq);
template <typename T>
void print(stack<T> st);
template <typename T>
void print(queue<T> q);
/* Template Datatypes Definitions */
template <typename T>
void print(T &&x)
{
  /*  This works for every container that supports range-based loop
      i.e. vector, set, map, oset, omap, dequeue */
  int f = 0;
  cerr << '{';
  for (auto && i : x)
    cerr << (f++ ? "," : ""), print(i);
  cerr << "}";
}
template <typename T>
void print(vector<vector<T>> mat)
{
  int f = 0;
  cerr << "\n~~~~~\n";
  for (auto && i : mat)
  {
    cerr << setw(2) << left << f++, print(i), cerr << "\n";
  }
  cerr << "~~~~~\n";
}
template <typename T, size_t N, size_t M>
void print(T (&mat)[N][M])
{
  int f = 0;
  cerr << "\n~~~~~\n";
  for (auto && i : mat)
  {
    cerr << setw(2) << left << f++, print(i), cerr << "\n";
  }
  cerr << "~~~~~\n";
}
template <typename F, typename S>
void print(pair<F, S> x)
{
  cerr << '(';
  print(x.first);
  cerr << ',';
  print(x.second);
  cerr << ')';
}
template <typename T, size_t N>
struct Tuple
{
  static void printTuple(T t)
  {
    Tuple < T, N - 1 >::printTuple(t);
    cerr << ",", print(get < N - 1 > (t));
  }
};
template <typename T>
struct Tuple<T, 1>
{
  static void printTuple(T t) { print(get<0>(t)); }
};
template <typename... Args>
void print(tuple<Args...> t)
{
  cerr << "(";
  Tuple<decltype(t), sizeof...(Args)>::printTuple(t);
  cerr << ")";
}
template <typename... T>
void print(priority_queue<T...> pq)
{
  int f = 0;
  cerr << '{';
  while (!pq.empty())
    cerr << (f++ ? "," : ""), print(pq.top()), pq.pop();
  cerr << "}";
}
template <typename T>
void print(stack<T> st)
{
  int f = 0;
  cerr << '{';
  while (!st.empty())
    cerr << (f++ ? "," : ""), print(st.top()), st.pop();
  cerr << "}";
}
template <typename T>
void print(queue<T> q)
{
  int f = 0;
  cerr << '{';
  while (!q.empty())
    cerr << (f++ ? "," : ""), print(q.front()), q.pop();
  cerr << "}";
}
/* Printer functions */
void printer(const char *) {} /* Base Recursive */
template <typename T, typename... V>
void printer(const char *names, T &&head, V &&...tail)
{
  /* Using && to capture both lvalues and rvalues */
  int i = 0;
  for (size_t bracket = 0; names[i] != '\0' and (names[i] != ',' or bracket != 0); i++)
    if (names[i] == '(' or names[i] == '<' or names[i] == '{')
      bracket++;
    else if (names[i] == ')' or names[i] == '>' or names[i] == '}')
      bracket--;
  cerr.write(names, i) << " = ";
  print(head);
  if (sizeof...(tail))
    cerr << " ||", printer(names + i + 1, tail...);
  else
    cerr << "]\n";
}
/* PrinterArr */
void printerArr(const char *) {} /* Base Recursive */
template <typename T, typename... V>
void printerArr(const char *names, T arr[], size_t N, V... tail)
{
  size_t ind = 0;
  for (; names[ind] and names[ind] != ','; ind++)
    cerr << names[ind];
  for (ind++; names[ind] and names[ind] != ','; ind++)
    ;
  cerr << " = {";
  for (size_t i = 0; i < N; i++)
    cerr << (i ? "," : ""), print(arr[i]);
  cerr << "}";
  if (sizeof...(tail))
    cerr << " ||", printerArr(names + ind + 1, tail...);
  else
    cerr << "]\n";
}
}
#ifdef LOCAL
#define debug(...) std::cerr << __LINE__ << ": [", __DEBUG_UTIL__::printer(#__VA_ARGS__, __VA_ARGS__);
#define debugArr(...) std::cerr << __LINE__ << ": [", __DEBUG_UTIL__::printerArr(#__VA_ARGS__, __VA_ARGS__);
#else
#define debug(...)
#define debugArr(...)
#endif
#endif


mt19937 mt_rng(chrono::steady_clock::now().time_since_epoch().count());
ll randint(ll a, ll b) {
  return uniform_int_distribution<ll>(a, b)(mt_rng);
}
/*--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------*/

const lld pi = 3.14159265358979323846;
const ll mod = 1000000007;
// const ll mod = 998244353;
// ll mod;
const ll INF = 1e17;
const int d4i[4] = { -1, 0, 1, 0}, d4j[4] = {0, 1, 0, -1};
const int d8i[8] = { -1, -1, 0, 1, 1, 1, 0, -1}, d8j[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int kni[8] = { +2, +2, -2, -2, 1, -1, 1, -1}, knj[8] = {1, -1, 1, -1, 2, 2, -2, -2};

ll n, m, k, q, l, r, x, y, z , h;
const ll tas = 5e5 + 10;
ll a[tas];
ll vis[tas];
ll dist[tas];
string s, t;
// set<int> grid1[tas];
map<ll, vector<pii>> grid[tas];
map<ll, ll> grid1[tas];
vector<ll> edges[tas];
// vector<pii> edges[tas];
ll ans = 0;

map<pii, pii> ma;
ll t1 = 0, t2 = -1;

ll give(ll x, ll y) {
  ma[mp(x, y)] = mp(t1, y != 0);
  return t1++;
}

ll get(ll x, ll y) {
  // t2=-1;
  t2 = ma[mp(x, y)].s;
  return ma[mp(x, y)].f;
}

void solve(int tc = 0) {

  cin >> n >> m;
  // map<ll,set<int>> ma;
  FOR(m) {
    cin >> x >> y >> z >> h;
    x--, y--;
    grid[x][z].pb(mp(y, h));
    grid[y][z].pb(mp(x, h));
    grid1[x][z] += h;
    grid1[y][z] += h;
    edges[x].pb(y);
    edges[y].pb(x);
  }
  FOR(n) {
    give(i, 0);
    for (auto val : grid[i]) {
      give(i, val.f);
    }
  }
  FOR(t1)vis[i] = 0, dist[i] = INF;
  priority_queue <pair<ll, pii>> pq;
  pq.push(mp(0, mp(0, 0)));
  dist[0] = 0;
  while (!pq.empty()) {
    auto cur = pq.top();
    ll tx = get(cur.s.f, cur.s.s);
    pq.pop();
    if (vis[tx]) continue;
    vis[tx] = 1;
    if (cur.s.s == 0) {
      for (auto val : grid[cur.s.f]) {
        y = val.f;
        for (auto v1 : val.s) {
          x = v1.f, z = v1.s;
          ll tot = grid1[cur.s.f][y] - z;
          if (dist[get(x, 0)] > dist[tx] + min(z, tot)) {
            dist[get(x, 0)] = dist[tx] + min(z, tot);
            // debug(dist[get(x, 0)], x)
            // debug(z, tot)
            pq.push(mp(-dist[get(x, 0)], mp(x, 0)));
          }
          if (dist[get(x, y)] > dist[tx]) {
            dist[get(x, y)] = dist[tx];
            // debug(dist[get(x, y)], x, y)
            pq.push(mp(-dist[get(x, y)], mp(x, y)));
          }
        }
      }
    }
    else {
      y = cur.s.s;
      for (auto v1 : grid[cur.s.f][y]) {
        x = v1.f, z = v1.s;
        ll tot = grid1[cur.s.f][y] - z;
        if (dist[get(x, 0)] > dist[tx] + tot) {
          dist[get(x, 0)] = dist[tx] + tot;
          // debug(dist[get(x, 0)], x)
          // debug(z, tot)
          pq.push(mp(-dist[get(x, 0)], mp(x, 0)));
        }
      }
    }
  }
  ans = INF;
  ans = min(ans, dist[get(n - 1, 0)]);
  // for (auto val : grid[n - 1]) {
  // ans = min(ans, dist[get(n - 1, val.f)]);
  // }b
  if (ans == INF) cout << -1 << endl;
  else cout << ans << endl;
}

int main() {
  fastio

#ifdef LOCAL
  auto begin = std::chrono::high_resolution_clock::now();
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
  freopen("error.txt", "w", stderr);
#endif

  ll tc = 1;
  // cin >> tc;
  for (int t = 0; t < tc; t++) solve(t);
#ifdef LOCAL
  auto end = std::chrono::high_resolution_clock::now();
  auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
  // cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n";
#endif
}

• Subtask 1: 34 / 34
• Subtask 2: 24 / 24
• Subtask 3: 42 / 42