結果
問題 | No.1014 competitive fighting |
ユーザー | ei1333333 |
提出日時 | 2020-03-20 22:12:10 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 527 ms / 2,000 ms |
コード長 | 5,493 bytes |
コンパイル時間 | 2,612 ms |
コンパイル使用メモリ | 231,472 KB |
実行使用メモリ | 125,016 KB |
最終ジャッジ日時 | 2023-09-21 19:16:37 |
合計ジャッジ時間 | 18,550 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 7 ms
22,332 KB |
testcase_01 | AC | 8 ms
22,252 KB |
testcase_02 | AC | 8 ms
22,488 KB |
testcase_03 | AC | 8 ms
22,576 KB |
testcase_04 | AC | 7 ms
22,320 KB |
testcase_05 | AC | 477 ms
102,696 KB |
testcase_06 | AC | 477 ms
101,180 KB |
testcase_07 | AC | 480 ms
102,768 KB |
testcase_08 | AC | 474 ms
101,552 KB |
testcase_09 | AC | 477 ms
102,856 KB |
testcase_10 | AC | 194 ms
44,192 KB |
testcase_11 | AC | 245 ms
60,840 KB |
testcase_12 | AC | 476 ms
101,388 KB |
testcase_13 | AC | 206 ms
59,444 KB |
testcase_14 | AC | 192 ms
56,892 KB |
testcase_15 | AC | 236 ms
63,844 KB |
testcase_16 | AC | 16 ms
23,712 KB |
testcase_17 | AC | 85 ms
36,888 KB |
testcase_18 | AC | 381 ms
87,912 KB |
testcase_19 | AC | 463 ms
99,248 KB |
testcase_20 | AC | 150 ms
49,260 KB |
testcase_21 | AC | 343 ms
80,500 KB |
testcase_22 | AC | 278 ms
71,160 KB |
testcase_23 | AC | 112 ms
41,412 KB |
testcase_24 | AC | 115 ms
42,144 KB |
testcase_25 | AC | 31 ms
26,748 KB |
testcase_26 | AC | 340 ms
79,752 KB |
testcase_27 | AC | 84 ms
36,576 KB |
testcase_28 | AC | 95 ms
38,580 KB |
testcase_29 | AC | 13 ms
23,108 KB |
testcase_30 | AC | 466 ms
99,812 KB |
testcase_31 | AC | 357 ms
82,776 KB |
testcase_32 | AC | 11 ms
22,840 KB |
testcase_33 | AC | 35 ms
28,592 KB |
testcase_34 | AC | 376 ms
101,420 KB |
testcase_35 | AC | 527 ms
125,016 KB |
testcase_36 | AC | 335 ms
92,980 KB |
testcase_37 | AC | 19 ms
24,628 KB |
testcase_38 | AC | 314 ms
84,720 KB |
testcase_39 | AC | 164 ms
56,788 KB |
testcase_40 | AC | 299 ms
86,424 KB |
testcase_41 | AC | 213 ms
68,032 KB |
testcase_42 | AC | 491 ms
121,228 KB |
testcase_43 | AC | 31 ms
27,632 KB |
testcase_44 | AC | 447 ms
116,320 KB |
testcase_45 | AC | 257 ms
76,264 KB |
testcase_46 | AC | 47 ms
30,700 KB |
testcase_47 | AC | 153 ms
53,840 KB |
testcase_48 | AC | 359 ms
96,808 KB |
testcase_49 | AC | 21 ms
25,480 KB |
testcase_50 | AC | 461 ms
113,448 KB |
testcase_51 | AC | 253 ms
74,188 KB |
testcase_52 | AC | 21 ms
25,516 KB |
testcase_53 | AC | 466 ms
102,784 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using int64 = long long; const int mod = 1e9 + 7; // const int mod = 998244353; const int64 infll = (1LL << 62) - 1; const int inf = (1 << 30) - 1; struct IoSetup { IoSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); cerr << fixed << setprecision(10); } } iosetup; template< typename T1, typename T2 > ostream &operator<<(ostream &os, const pair< T1, T2 > &p) { os << p.first << " " << p.second; return os; } template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; } template< typename T > ostream &operator<<(ostream &os, const vector< T > &v) { for(int i = 0; i < (int) v.size(); i++) { os << v[i] << (i + 1 != v.size() ? " " : ""); } return os; } template< typename T > istream &operator>>(istream &is, vector< T > &v) { for(T &in : v) is >> in; return is; } template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); } template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); } template< typename T = int64 > vector< T > make_v(size_t a) { return vector< T >(a); } template< typename T, typename... Ts > auto make_v(size_t a, Ts... ts) { return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...)); } template< typename T, typename V > typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) { t = v; } template< typename T, typename V > typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) { for(auto &e : t) fill_v(e, v); } template< typename F > struct FixPoint : F { FixPoint(F &&f) : F(forward< F >(f)) {} template< typename... Args > decltype(auto) operator()(Args &&... args) const { return F::operator()(*this, forward< Args >(args)...); } }; template< typename F > inline decltype(auto) MFP(F &&f) { return FixPoint< F >{forward< F >(f)}; } template< typename T > struct edge { int src, to; T cost; edge(int to, T cost) : src(-1), to(to), cost(cost) {} edge(int src, int to, T cost) : src(src), to(to), cost(cost) {} edge &operator=(const int &x) { to = x; return *this; } operator int() const { return to; } }; template< typename T > using Edges = vector< edge< T > >; template< typename T > using WeightedGraph = vector< Edges< T > >; using UnWeightedGraph = vector< vector< int > >; template< typename T > using Matrix = vector< vector< T > >; template< typename G > struct StronglyConnectedComponents { const G &g; UnWeightedGraph gg, rg; vector< int > comp, order, used; StronglyConnectedComponents(G &g) : g(g), gg(g.size()), rg(g.size()), comp(g.size(), -1), used(g.size()) { for(int i = 0; i < g.size(); i++) { for(auto e : g[i]) { gg[i].emplace_back((int) e); rg[(int) e].emplace_back(i); } } } int operator[](int k) { return comp[k]; } void dfs(int idx) { if(used[idx]) return; used[idx] = true; for(int to : gg[idx]) dfs(to); order.push_back(idx); } void rdfs(int idx, int cnt) { if(comp[idx] != -1) return; comp[idx] = cnt; for(int to : rg[idx]) rdfs(to, cnt); } void build(UnWeightedGraph &t) { for(int i = 0; i < gg.size(); i++) dfs(i); reverse(begin(order), end(order)); int ptr = 0; for(int i : order) if(comp[i] == -1) rdfs(i, ptr), ptr++; t.resize(ptr); for(int i = 0; i < g.size(); i++) { for(auto &to : g[i]) { int x = comp[i], y = comp[to]; if(x == y) continue; t[x].push_back(y); } } } }; int main() { int N; cin >> N; vector< int > A(N), B(N), C(N); for(int i = 0; i < N; i++) { cin >> A[i] >> B[i] >> C[i]; } vector< int > xs; for(int i = 0; i < N; i++) { xs.emplace_back(A[i]); xs.emplace_back(B[i] - C[i]); } sort(begin(xs), end(xs)); xs.erase(unique(begin(xs), end(xs)), end(xs)); int M = (int) xs.size(); WeightedGraph< int64 > g(M + N); for(int i = 1; i < xs.size(); i++) { g[i].emplace_back(i - 1, 0); } for(int i = 0; i < N; i++) { { int p = lower_bound(begin(xs), end(xs), B[i] - C[i]) - begin(xs); g[M + i].emplace_back(p, B[i]); } { int p = lower_bound(begin(xs), end(xs), A[i]) - begin(xs); g[p].emplace_back(M + i, 0); } } StronglyConnectedComponents< WeightedGraph< int64 > > scc(g); UnWeightedGraph t; scc.build(t); auto dp = make_v< int64 >(t.size()); fill_v(dp, -1); vector< int64 > sz(t.size()); map< int, int > mx[404040]; for(int i = 0; i < N; i++) { sz[scc[i + M]]++; { int p = lower_bound(begin(xs), end(xs), B[i] - C[i]) - begin(xs); chmax(mx[scc[i + M]][scc[p]], B[i]); } } auto dfs = MFP([&](auto dfs, int idx) -> int64 { if(~dp[idx]) return dp[idx]; int64 ret = 0; for(auto &to : t[idx]) chmax(ret, dfs(to) + mx[idx][to]); ret += mx[idx][idx]; if(sz[idx] >= 2) ret = infll; return dp[idx] = min(ret, infll); }); for(int i = 0; i < N; i++) { auto ret = dfs(scc[M + i]); if(ret >= infll) cout << "BAN" << endl; else cout << ret << endl; } // A[j] <= B[i]-C[i] なら i->j に有向辺を張る // 閉路にぶつかればBAN // 但し自分自身には行けません // 倍長して適当にやる // ぶつからなければ普通にmaxをとります }