#506149 (C++17) No.1104 オンライン点呼

提出ソース

結果

問題	No.1104 オンライン点呼
ユーザー	mai
提出日時	2020-07-03 22:03:46
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,670 bytes
コンパイル時間	2,563 ms
コンパイル使用メモリ	228,540 KB
実行使用メモリ	21,564 KB
最終ジャッジ日時	2024-09-17 01:56:27
合計ジャッジ時間	4,185 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	32 ms 18,880 KB
testcase_02	AC	35 ms 18,908 KB
testcase_03	AC	33 ms 18,868 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	2 ms 6,944 KB
testcase_07	AC	20 ms 12,216 KB
testcase_08	AC	9 ms 6,940 KB
testcase_09	AC	54 ms 21,564 KB
testcase_10	AC	1 ms 6,940 KB
testcase_11	AC	14 ms 9,464 KB
testcase_12	AC	19 ms 12,560 KB
testcase_13	AC	12 ms 9,192 KB
testcase_14	AC	2 ms 6,944 KB
testcase_15	AC	23 ms 13,324 KB
testcase_16	WA	-
testcase_17	AC	17 ms 10,840 KB
testcase_18	AC	22 ms 13,208 KB
testcase_19	AC	27 ms 16,580 KB
testcase_20	AC	28 ms 17,352 KB
testcase_21	AC	31 ms 18,244 KB
testcase_22	AC	28 ms 16,124 KB
testcase_23	AC	20 ms 12,164 KB
testcase_24	AC	10 ms 7,128 KB
testcase_25	AC	2 ms 6,940 KB
testcase_26	AC	2 ms 6,940 KB
testcase_27	AC	2 ms 6,940 KB

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

ソースコード

raw source code

#pragma GCC optimize ("O3")
#include "bits/stdc++.h"

using namespace std;
using ll = long long int;

#define all(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(typename remove_const<typename remove_reference<decltype(l)>::type>::type cnt={};(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))
const long long MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;
template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; }
template<typename T> inline T& chmax(T& to, const T& val) { return to = max(to, val); }
template<typename T> inline T& chmin(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
template<typename T, typename Random = decltype(randdev), typename enable_if<is_integral<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_int_distribution<T>(l, h)(rand); }
template<typename T, typename Random = decltype(randdev), typename enable_if<is_floating_point<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_real_distribution<T>(l, h)(rand); }

template <typename I>
struct MyRangeFormat{ I b,e; MyRangeFormat(I _b, I _e):b(_b),e(_e){} };
template<typename I>
static ostream& operator<<(ostream& o, const MyRangeFormat<I>& f) {
  o << "[ "; iterate(i,f.b,f.e) o<<*i<<' ';
  return o << ']';
}
template <typename I>
struct MyMatrixFormat{
  const I& p; long long n, m;
  MyMatrixFormat(const I& _p, long long _n, long long _m):p(_p),n(_n),m(_m){}
};
template<typename I>
static ostream& operator<<(ostream& o, const MyMatrixFormat<I>& f) {
  o<<'\n';
  repeat(i,(f.n)) {
    repeat(j,f.m) o<<f.p[i][j]<<' ';
    o<<'\n';
  }
  return o;
}
struct LOG_t { ~LOG_t() { cout << endl; } };
#define LOG (LOG_t(),cout<<'L'<<__LINE__<<": ")
#define FMTA(m,w) (MyRangeFormat<decltype(m+0)>(m,m+w))
#define FMTR(b,e) (MyRangeFormat<decltype(e)>(b,e))
#define FMTV(v) FMTR(v.begin(),v.end())
#define FMTM(m,h,w) (MyMatrixFormat<decltype(m+0)>(m,h,w))

#if defined(_WIN32) || defined(_WIN64)
#define getc_x _getc_nolock
#define putc_x _putc_nolock
#elif defined(__GNUC__)
#define getc_x getc_unlocked
#define putc_x putc_unlocked
#else
#define getc_x getc
#define putc_x putc
#endif
class MaiScanner {
  FILE* fp_;
  constexpr bool isvisiblechar(char c) noexcept { return (0x21<=(c)&&(c)<=0x7E); }
public:
  inline MaiScanner(FILE* fp):fp_(fp){}
  template<typename T> void input_integer(T& var) noexcept {
    var = 0; T sign = 1;
    int cc = getc_x(fp_);
    for (; cc < '0' || '9' < cc; cc = getc_x(fp_))
      if (cc == '-') sign = -1;
    for (; '0' <= cc && cc <= '9'; cc = getc_x(fp_))
      var = (var << 3) + (var << 1) + cc - '0';
    var = var * sign;
  }
  inline int c() noexcept { return getc_x(fp_); }
  template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr>
  inline MaiScanner& operator>>(T& var) noexcept { input_integer<T>(var); return *this; }
  inline MaiScanner& operator>>(string& var) {
    int cc = getc_x(fp_);
    for (; !isvisiblechar(cc); cc = getc_x(fp_));
    for (; isvisiblechar(cc); cc = getc_x(fp_))
      var.push_back(cc);
    return *this;
  }
  template<typename IT> inline void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
};
class MaiPrinter {
  FILE* fp_;
public:
  inline MaiPrinter(FILE* fp):fp_(fp){}
  template<typename T>
  void output_integer(T var) noexcept {
    if (var == 0) { putc_x('0', fp_); return; }
    if (var < 0)
      putc_x('-', fp_),
      var = -var;
    char stack[32]; int stack_p = 0;
    while (var)
      stack[stack_p++] = '0' + (var % 10),
      var /= 10;
    while (stack_p)
      putc_x(stack[--stack_p], fp_);
  }
  inline MaiPrinter& operator<<(char c) noexcept { putc_x(c, fp_); return *this; }
  template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr>
  inline MaiPrinter& operator<<(T var) noexcept { output_integer<T>(var); return *this; }
  inline MaiPrinter& operator<<(char* str_p) noexcept { while (*str_p) putc_x(*(str_p++), fp_); return *this; }
  inline MaiPrinter& operator<<(const string& str) {
    const char* p = str.c_str();
    const char* l = p + str.size();
    while (p < l) putc_x(*p++, fp_);
    return *this;
  }
  template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin : *this << *begin; }
};
MaiScanner scanner(stdin);
MaiPrinter printer(stdout);

class DGraphE {
 public:
  using W_T = ll;
  struct Arc {
    int from, to;
    W_T value;
    Arc(int f = 0, int t = 0, W_T value = 0) : from(f), to(t), value(value) {}
    inline int pair(int _v) const { return _v == to ? from : to; }
  };
  int n;
  vector<vector<int>> vertex_to;
  vector<vector<int>> vertex_from;
  vector<Arc> arcs;

  explicit DGraphE(int n = 1) : n(n), vertex_to(n), vertex_from(n) {}

  inline int size() const { return n; }
  void resize(int _n) {
    n = _n;
    vertex_to.resize(_n);
    vertex_from.resize(_n);
  }
  void connect(int from, int to, W_T val = 0) {
    vertex_to[(int)from].push_back((int)arcs.size());
    vertex_from[(int)to].push_back((int)arcs.size());
    arcs.emplace_back(from, to, val);
  }
};

vector<DGraphE::W_T> dijkstraDEdgeWeighted(const DGraphE& graph, int startIndex) {
  using T = DGraphE::W_T;
  vector<T> dist(graph.size(), numeric_limits<T>::max());

  priority_queue<pair<T, int>> que;  // <dist, idx>
  que.emplace(0, startIndex);
  dist[startIndex] = 0;

  while (!que.empty()) {
    T d = -que.top().first;
    int v = que.top().second;
    que.pop();
    if (dist[v] < d)
      continue;

    for (int ei : graph.vertex_to[v]) {
      auto e = graph.arcs[ei];
      int u = e.to;
      if (d + e.value < dist[u]) {
        que.emplace(-(dist[u] = d + e.value), u);
      }
    }
  }
  return move(dist);
}


//

int N, K;
int A[100010];
int B[100010];
DGraphE G;

//




int main() {
  scanner >> N >> K;
  
  if (N == 1) bye("0");
  
  G.resize(N+5);
  
  repeat(i, N) {
    int a; scanner >> A[i];
  }
  repeat(i, N) {
    int b; scanner >> B[i];
  }
  repeat(i, N-1) {
    G.connect(i, i+1, A[i] + B[i+1]);
    G.connect(i, i+2, A[i] + B[i+2] + K);
  }
  auto tt = dijkstraDEdgeWeighted(G, 0);
  
  ll ans = 0;
  repeat(i, N) {
    chmax(ans, tt[i]);
  }
  cout << ans << endl;
  
  return 0;
}

yukicoder

結果

テストケース

ソースコード