結果

問題 No.1950 片道きゃっちぼーる
ユーザー maimai
提出日時 2022-05-21 00:46:53
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 7,018 bytes
コンパイル時間 2,866 ms
コンパイル使用メモリ 232,952 KB
実行使用メモリ 47,232 KB
最終ジャッジ日時 2024-09-20 10:51:42
合計ジャッジ時間 9,225 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 171 ms
47,232 KB
testcase_04 WA -
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 179 ms
47,104 KB
testcase_07 AC 140 ms
28,928 KB
testcase_08 AC 152 ms
29,056 KB
testcase_09 WA -
testcase_10 AC 155 ms
35,512 KB
testcase_11 AC 170 ms
35,936 KB
testcase_12 AC 150 ms
35,936 KB
testcase_13 AC 184 ms
38,892 KB
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 190 ms
43,520 KB
testcase_17 AC 2 ms
5,376 KB
testcase_18 AC 163 ms
34,816 KB
testcase_19 WA -
testcase_20 AC 146 ms
28,984 KB
testcase_21 WA -
testcase_22 AC 178 ms
40,056 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

// clang-format off
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 upto(cnt,b,e,step) for(auto cnt=(b);(cnt)<=(e);(cnt)+=(step))
#define downto(cnt,b,e,step) for(auto cnt=(b);(e)<=(cnt);(cnt)-=(step))
const long long MD = 998244353; 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 T>
static ostream& operator<<(ostream& o, const std::vector<T>& v) {
  o << "[ "; for(const auto& e : v) o<<e<<' '; return o << ']';
}

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<<(const 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);
// clang-format on

class DGraph {
 public:
  int n;
  vector<vector<int>> vertex_to;
  vector<vector<int>> vertex_from;

  explicit DGraph(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) {
    vertex_to[(int)from].emplace_back(to);
    vertex_from[(int)to].emplace_back(from);
  }
};

//

int N;
int X[200010];
int A[200010];

//

int best[200010];

int main() {
  scanner >> N;
  scanner.in(X, X+N);
  scanner.in(A, A+N);
  
  map<ll, int> x2i;
  repeat(i, N) {
    x2i[X[i]] = i;
  }
  
  DGraph graph(N);
  
  repeat(i, N) {
    int x = X[i];
    int a = A[i];
    {
      auto it = x2i.find(x + a);
      if (it != x2i.end()) {
        int to = it->second;
        graph.connect(i, to);
      }
    }
    {
      auto it = x2i.find(x - a);
      if (it != x2i.end()) {
        int to = it->second;
        graph.connect(i, to);
      }
    }
  }
  
  stack<int> que;
  vector<int> visited(N);
  repeat(i, N) {
    int d = graph.vertex_to[i].size();
    if (d == 0) que.push(i);
    visited[i] = d;
  }
  
  while(!que.empty()) {
    int v = que.top(); que.pop();
    chmax(best[v], X[v] + A[v]);
    for (auto to : graph.vertex_from[v]) {
      chmax(best[to], best[v]);
      visited[to]-=1;
      if (visited[to] == 0) que.push(to);
    }
  }
  
  // loop
  auto dfs = [&](int r, int v, auto dfs){
    if (visited[v] < 0) return -visited[v] - 1;
    visited[v] = -1 - r;
    chmax(best[r], X[v] + A[v]);
    for (auto to : graph.vertex_to[v]) {
      int r2 = dfs(r, to, dfs);
      if (r2 >= 0) {
        visited[v] = -1 - r2;
      }
    }
    return -1;
  };
  
  repeat(i, N) {
    if (best[i] == 0) dfs(i, i, dfs);
    if (visited[i] < 0) {
      int j = -visited[i] -1;
      printer << best[j] - X[i] << '\n';
      continue;
    }
    printer << best[i] - X[i] << '\n';
  }
  
  return 0;
}
0