結果

問題 No.1950 片道きゃっちぼーる
ユーザー cutmdocutmdo
提出日時 2022-05-21 09:26:42
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 725 ms / 3,000 ms
コード長 4,658 bytes
コンパイル時間 3,974 ms
コンパイル使用メモリ 270,284 KB
実行使用メモリ 170,624 KB
最終ジャッジ日時 2024-09-20 11:17:05
合計ジャッジ時間 14,253 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 391 ms
167,296 KB
testcase_04 AC 369 ms
167,296 KB
testcase_05 AC 1 ms
5,376 KB
testcase_06 AC 387 ms
167,168 KB
testcase_07 AC 400 ms
167,296 KB
testcase_08 AC 502 ms
167,420 KB
testcase_09 AC 436 ms
166,528 KB
testcase_10 AC 391 ms
169,592 KB
testcase_11 AC 441 ms
170,496 KB
testcase_12 AC 383 ms
170,624 KB
testcase_13 AC 419 ms
167,168 KB
testcase_14 AC 423 ms
167,324 KB
testcase_15 AC 725 ms
167,168 KB
testcase_16 AC 401 ms
167,296 KB
testcase_17 AC 2 ms
5,376 KB
testcase_18 AC 421 ms
167,296 KB
testcase_19 AC 706 ms
167,216 KB
testcase_20 AC 418 ms
167,296 KB
testcase_21 AC 424 ms
167,680 KB
testcase_22 AC 383 ms
167,168 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cassert>
#include <memory>
#include <random>
#include <functional>
#include <complex>
#include <immintrin.h>
#include <stdexcept>
#ifdef DEBUG
#include "./CompetitiveProgrammingCpp/debug.hpp"
#include "./CompetitiveProgrammingCpp/Timer.hpp"
#include "./CompetitiveProgrammingCpp/sample.hpp"
#else
#define dump(...)
#endif

/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)((e)-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, (n))
#define RREP(i, n) RFOR(i, 0, (n))
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
template<class T>
inline auto sort(T& t) { std::sort(ALL(t)); }
template<class T>
inline auto rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }
template<class T>
inline auto unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); }
template<class T, class S>
inline auto chmax(T& t, const S& s) { if(s > t) { t = s; return true; } return false; }
template<class T, class S>
inline auto chmin(T& t, const S& s) { if(s < t) { t = s; return true; } return false; }
inline auto BR() { std::cout << "\n"; }

/* type define */
using ll = long long;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VVVVL = std::vector<VVVL>;
using VVVVVL = std::vector<VVVVL>;
using VD = std::vector<double>;
template<class T>
using V = std::vector<T>;
template<class T = ll, class U = T>
using P = std::pair<T, U>;
using PAIR = P<ll>;

/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::deque;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;

/* Initial processing  */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;

/* Remove the source of the bug */
auto pow(signed, signed) { assert(false); }

/* define hash */
namespace std {
template <>	class hash<std::pair<ll, ll>> { public:	size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } };
}

/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for(T& x : vec) is >> x; return is; }

/* constant value */
constexpr ll MOD = 1000000007;
// constexpr ll MOD = 998244353;

//=============================================================================================


signed main() {
    ll n;
    cin >> n;
    VL x(n), a(n);
    cin >> x >> a;

    map<ll, ll> mp;
    REP(i, n) { mp.emplace(x[i], i); }

    multimap<ll, ll, std::greater<ll>> order;
    REP(i, n) { order.emplace(x[i] + a[i], i); }

    V<std::deque<ll>> to(n);
    REP(i, n) {
        auto fit1 = mp.find(x[i] + a[i]);
        if(fit1 != mp.end()) { to[fit1->second].emplace_back(i); }
        auto fit2 = mp.find(x[i] - a[i]);
        if(fit2 != mp.end()) { to[fit2->second].emplace_back(i); }
    }

    VL ans(n);
    for(const auto& [d, j] : order) if(!ans[j]) {
        queue<ll> q;
        q.emplace(j);
        while(!q.empty()) {
            auto i = q.front();
            q.pop();
            chmax(ans[i], d);
            auto fit1 = mp.find(x[i] + a[i]);
            if(fit1 != mp.end()) { chmax(ans[i], ans[fit1->second]); }
            auto fit2 = mp.find(x[i] - a[i]);
            if(fit2 != mp.end()) { chmax(ans[i], ans[fit2->second]); }
            REPC(t, to[i])if(!ans[t]) { ans[t] = 1; q.emplace(t); }
        }
    }
    dump(ans, order);
    REP(i, n) {
        cout << ans[i] - x[i] << endl;
    }
}
0