結果
問題 | No.1950 片道きゃっちぼーる |
ユーザー | RVindicatio |
提出日時 | 2022-05-20 23:01:51 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 315 ms / 3,000 ms |
コード長 | 4,434 bytes |
コンパイル時間 | 4,724 ms |
コンパイル使用メモリ | 249,452 KB |
実行使用メモリ | 68,772 KB |
最終ジャッジ日時 | 2023-10-20 13:54:58 |
合計ジャッジ時間 | 10,134 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,348 KB |
testcase_01 | AC | 2 ms
4,348 KB |
testcase_02 | AC | 2 ms
4,348 KB |
testcase_03 | AC | 155 ms
68,768 KB |
testcase_04 | AC | 128 ms
34,448 KB |
testcase_05 | AC | 2 ms
4,348 KB |
testcase_06 | AC | 231 ms
68,772 KB |
testcase_07 | AC | 106 ms
26,640 KB |
testcase_08 | AC | 109 ms
26,648 KB |
testcase_09 | AC | 189 ms
45,908 KB |
testcase_10 | AC | 127 ms
34,448 KB |
testcase_11 | AC | 126 ms
34,448 KB |
testcase_12 | AC | 122 ms
34,448 KB |
testcase_13 | AC | 152 ms
33,308 KB |
testcase_14 | AC | 129 ms
25,636 KB |
testcase_15 | AC | 315 ms
49,980 KB |
testcase_16 | AC | 207 ms
46,568 KB |
testcase_17 | AC | 2 ms
4,372 KB |
testcase_18 | AC | 124 ms
30,680 KB |
testcase_19 | AC | 313 ms
50,896 KB |
testcase_20 | AC | 109 ms
26,644 KB |
testcase_21 | AC | 117 ms
26,140 KB |
testcase_22 | AC | 116 ms
25,396 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include<bits/stdc++.h> using namespace std; using ll = long long; const int INF = 1e9; const ll inf = 1LL<<60; namespace internal { template <class E> struct csr { std::vector<int> start; std::vector<E> elist; csr(int n, const std::vector<std::pair<int, E>>& edges) : start(n + 1), elist(edges.size()) { for (auto e : edges) { start[e.first + 1]++; } for (int i = 1; i <= n; i++) { start[i] += start[i - 1]; } auto counter = start; for (auto e : edges) { elist[counter[e.first]++] = e.second; } } }; // Reference: // R. Tarjan, // Depth-First Search and Linear Graph Algorithms struct scc_graph { public: scc_graph(int n) : _n(n) {} int num_vertices() { return _n; } void add_edge(int from, int to) { edges.push_back({from, {to}}); } // @return pair of (# of scc, scc id) std::pair<int, std::vector<int>> scc_ids() { auto g = csr<edge>(_n, edges); int now_ord = 0, group_num = 0; std::vector<int> visited, low(_n), ord(_n, -1), ids(_n); visited.reserve(_n); auto dfs = [&](auto self, int v) -> void { low[v] = ord[v] = now_ord++; visited.push_back(v); for (int i = g.start[v]; i < g.start[v + 1]; i++) { auto to = g.elist[i].to; if (ord[to] == -1) { self(self, to); low[v] = std::min(low[v], low[to]); } else { low[v] = std::min(low[v], ord[to]); } } if (low[v] == ord[v]) { while (true) { int u = visited.back(); visited.pop_back(); ord[u] = _n; ids[u] = group_num; if (u == v) break; } group_num++; } }; for (int i = 0; i < _n; i++) { if (ord[i] == -1) dfs(dfs, i); } for (auto& x : ids) { x = group_num - 1 - x; } return {group_num, ids}; } std::vector<std::vector<int>> scc() { auto ids = scc_ids(); int group_num = ids.first; std::vector<int> counts(group_num); for (auto x : ids.second) counts[x]++; std::vector<std::vector<int>> groups(ids.first); for (int i = 0; i < group_num; i++) { groups[i].reserve(counts[i]); } for (int i = 0; i < _n; i++) { groups[ids.second[i]].push_back(i); } return groups; } private: int _n; struct edge { int to; }; std::vector<std::pair<int, edge>> edges; }; } // namespace internal struct scc_graph { public: scc_graph() : internal(0) {} scc_graph(int n) : internal(n) {} void add_edge(int from, int to) { int n = internal.num_vertices(); assert(0 <= from && from < n); assert(0 <= to && to < n); internal.add_edge(from, to); } std::vector<std::vector<int>> scc() { return internal.scc(); } private: internal::scc_graph internal; }; void solve() { int n; cin >> n; vector<ll> x(n), a(n); for (int i=0; i<n; i++) cin >> x[i]; for (int i=0; i<n; i++) cin >> a[i]; scc_graph scc(n); vector<vector<int>> G(n); for (int i=0; i<n; i++) { int cur = lower_bound(x.begin(), x.end(), x[i] + a[i]) - x.begin(); if (cur < n && x[cur] == x[i] + a[i]) { scc.add_edge(i, cur); G[i].emplace_back(cur); } cur = lower_bound(x.begin(), x.end(), x[i] - a[i]) - x.begin(); if (x[cur] == x[i] - a[i]) { scc.add_edge(i, cur); G[i].emplace_back(cur); } } auto g = scc.scc(); reverse(g.begin(), g.end()); vector<ll> ans(n); vector<ll> dp(n, -inf); for (auto v : g) { set<int> s; ll ma = -inf; for (auto e : v) { s.insert(e); ma = max(ma, a[e] + x[e]); } for (auto e : v) { for (auto r : G[e]) if (!s.count(r)) { ma = max(ma, dp[r]); } } for (auto e : v) { ans[e] = ma - x[e]; dp[e] = ma; } } for (int i=0; i<n; i++) cout << ans[i] << '\n'; } int main() { ios::sync_with_stdio(false); std::cin.tie(nullptr); // int t; cin >> t; /*while (t--)*/ solve(); }