結果
問題 | No.2311 [Cherry 5th Tune] Cherry Month |
ユーザー | ei1333333 |
提出日時 | 2023-05-19 22:25:06 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,952 bytes |
コンパイル時間 | 3,089 ms |
コンパイル使用メモリ | 223,120 KB |
実行使用メモリ | 55,772 KB |
最終ジャッジ日時 | 2024-12-18 03:13:41 |
合計ジャッジ時間 | 19,737 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 3 ms
5,248 KB |
testcase_02 | WA | - |
testcase_03 | AC | 111 ms
17,664 KB |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | AC | 112 ms
14,720 KB |
testcase_08 | AC | 214 ms
38,616 KB |
testcase_09 | AC | 170 ms
28,140 KB |
testcase_10 | WA | - |
testcase_11 | AC | 226 ms
31,480 KB |
testcase_12 | WA | - |
testcase_13 | AC | 201 ms
31,384 KB |
testcase_14 | AC | 195 ms
37,596 KB |
testcase_15 | AC | 220 ms
37,700 KB |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | AC | 208 ms
37,424 KB |
testcase_20 | AC | 200 ms
31,056 KB |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | AC | 212 ms
35,756 KB |
testcase_24 | AC | 204 ms
32,896 KB |
testcase_25 | AC | 182 ms
35,840 KB |
testcase_26 | AC | 249 ms
39,040 KB |
testcase_27 | WA | - |
testcase_28 | AC | 210 ms
44,816 KB |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | AC | 286 ms
47,876 KB |
testcase_37 | AC | 326 ms
49,148 KB |
testcase_38 | AC | 341 ms
49,684 KB |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | AC | 277 ms
45,360 KB |
testcase_44 | WA | - |
testcase_45 | AC | 287 ms
45,424 KB |
testcase_46 | AC | 254 ms
42,240 KB |
testcase_47 | AC | 312 ms
45,472 KB |
testcase_48 | AC | 266 ms
47,044 KB |
testcase_49 | AC | 367 ms
55,772 KB |
testcase_50 | AC | 262 ms
46,820 KB |
ソースコード
#line 1 "template/template.hpp" #include<bits/stdc++.h> using namespace std; using int64 = long long; const int mod = 1e9 + 7; 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 { explicit 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)}; } #line 2 "structure/union-find/union-find.hpp" struct UnionFind { vector< int > data; UnionFind() = default; explicit UnionFind(size_t sz) : data(sz, -1) {} bool unite(int x, int y) { x = find(x), y = find(y); if(x == y) return false; if(data[x] > data[y]) swap(x, y); data[x] += data[y]; data[y] = x; return true; } int find(int k) { if(data[k] < 0) return (k); return data[k] = find(data[k]); } int size(int k) { return -data[find(k)]; } bool same(int x, int y) { return find(x) == find(y); } vector< vector< int > > groups() { int n = (int) data.size(); vector< vector< int > > ret(n); for(int i = 0; i < n; i++) { ret[find(i)].emplace_back(i); } ret.erase(remove_if(begin(ret), end(ret), [&](const vector< int > &v) { return v.empty(); }), end(ret)); return ret; } }; int main() { int N; cin >> N; vector< int64 > A(N); cin >> A; int T; cin >> T; vector< int > O(T), X(T), K(T); vector< int > deg(N); for (int i = 0; i < T; i++) { cin >> O[i] >> X[i] >> K[i]; --X[i]; if (O[i] == 1) { --K[i]; deg[X[i]]++; deg[K[i]]++; } } int Q; cin >> Q; vector< vector< pair< int, int > > > qs(T + 1); for (int i = 0; i < Q; i++) { int s, t; cin >> s >> t; --t; qs[s].emplace_back(t, i); } vector< int64 > ans(Q); UnionFind uf(N); vector< vector< int > > vs(N); vector< int64 > sub(N); vector< vector< pair< int, int > > > g(N); vector< vector< pair< int, int64 > > > lazy(N); for (int i = 0; i < N; i++) { vs[i] = {i}; lazy[i] = {{-1, 0ll}}; } for(int i = 0; i <= T; i++) { for(auto& [k, id] : qs[i]) { int64 now = A[k]; now -= sub[uf.find(k)]; for(auto& [p, t] : g[k]) { for(auto& [y, x] : lazy[p]) { if(t <= y) { now -= x; } } } chmax(now, 0ll); ans[id] = now; } if(i < T) { if(O[i] == 1) { int x = uf.find(X[i]); int y = uf.find(K[i]); if(x == y) continue; uf.unite(x, y); int New = uf.find(x); int Old = x ^ y ^ New; for(auto& v: vs[Old]) { A[v] -= sub[Old]; A[v] += sub[New]; vs[New].emplace_back(v); } vs[Old].clear(); if(make_pair(deg[X[i]], X[i]) < make_pair(deg[K[i]], K[i])) { g[X[i]].emplace_back(K[i], i); } else { g[K[i]].emplace_back(X[i], i); } } else if(O[i] == 2) { A[X[i]] -= K[i]; } else if(O[i] == 3) { A[X[i]] -= K[i]; for(auto& [p,_] : g[X[i]]) A[p] -= K[i]; //auto sum = lazy[X[i]].empty() ? 0 : lazy[X[i]].back().second; lazy[X[i]].emplace_back(i, K[i]); } else { sub[uf.find(X[i])] += K[i]; } } } for(auto& p : ans) cout << p << "\n"; }