結果
問題 | No.2319 Friends+ |
ユーザー | hliuser1 |
提出日時 | 2023-12-26 06:17:02 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2,812 ms / 3,000 ms |
コード長 | 3,657 bytes |
コンパイル時間 | 6,092 ms |
コンパイル使用メモリ | 308,808 KB |
実行使用メモリ | 72,112 KB |
最終ジャッジ日時 | 2023-12-26 06:17:40 |
合計ジャッジ時間 | 36,860 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 20 ms
57,260 KB |
testcase_01 | AC | 20 ms
57,260 KB |
testcase_02 | AC | 919 ms
69,296 KB |
testcase_03 | AC | 855 ms
69,552 KB |
testcase_04 | AC | 694 ms
69,424 KB |
testcase_05 | AC | 792 ms
69,296 KB |
testcase_06 | AC | 713 ms
69,168 KB |
testcase_07 | AC | 969 ms
71,832 KB |
testcase_08 | AC | 986 ms
71,728 KB |
testcase_09 | AC | 954 ms
71,824 KB |
testcase_10 | AC | 941 ms
71,740 KB |
testcase_11 | AC | 984 ms
71,728 KB |
testcase_12 | AC | 21 ms
57,264 KB |
testcase_13 | AC | 20 ms
57,264 KB |
testcase_14 | AC | 21 ms
57,264 KB |
testcase_15 | AC | 20 ms
57,264 KB |
testcase_16 | AC | 20 ms
57,264 KB |
testcase_17 | AC | 20 ms
57,260 KB |
testcase_18 | AC | 283 ms
59,056 KB |
testcase_19 | AC | 687 ms
71,808 KB |
testcase_20 | AC | 505 ms
69,040 KB |
testcase_21 | AC | 420 ms
65,712 KB |
testcase_22 | AC | 536 ms
69,936 KB |
testcase_23 | AC | 608 ms
71,420 KB |
testcase_24 | AC | 676 ms
71,140 KB |
testcase_25 | AC | 609 ms
71,856 KB |
testcase_26 | AC | 646 ms
71,524 KB |
testcase_27 | AC | 623 ms
70,960 KB |
testcase_28 | AC | 577 ms
71,088 KB |
testcase_29 | AC | 558 ms
70,704 KB |
testcase_30 | AC | 499 ms
69,808 KB |
testcase_31 | AC | 496 ms
68,272 KB |
testcase_32 | AC | 409 ms
65,072 KB |
testcase_33 | AC | 365 ms
64,176 KB |
testcase_34 | AC | 321 ms
60,976 KB |
testcase_35 | AC | 267 ms
59,056 KB |
testcase_36 | AC | 314 ms
72,112 KB |
testcase_37 | AC | 1,644 ms
63,664 KB |
testcase_38 | AC | 218 ms
59,056 KB |
testcase_39 | AC | 195 ms
59,056 KB |
testcase_40 | AC | 190 ms
59,056 KB |
testcase_41 | AC | 190 ms
59,056 KB |
testcase_42 | AC | 209 ms
59,056 KB |
testcase_43 | AC | 281 ms
59,192 KB |
testcase_44 | AC | 521 ms
60,336 KB |
testcase_45 | AC | 1,727 ms
65,072 KB |
testcase_46 | AC | 2,812 ms
70,704 KB |
ソースコード
// https://yukicoder.me/problems/no/2319 // really cool problem // // Solution 0. use bitsets and bruteforce (cheating) // // Solution 1. sqrt over nodes // let K = sqrt(M) // a person is "few" if it has < K friends and "many" if >= K // there are at most 2M / K ~= K people that are "many" // to solve a query where x is few, brute force it // to solve a query where x is many, consider its friends that are: // a. many - you can check ALL many's for the condition // b. few - store this as map f[i][j] = # of few friends of the many i in world j // update naively, it works in O(Q*sqrt M + N*sqrt M + M) // // Solution 2. ft. Jerry -> sqrt over queries // for each chunk, recompute a map of for each person i, how many friends they have in world j // then for each query, loop over the previous queries in the chunk and simulate. if by the end, // you still have at least one friend in world[y], ur good // the map computations take M sqrt(Q) time total, the rest is Q sqrt(Q) #include <bits/stdc++.h> #pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx2") using namespace std; #include <ext/pb_ds/assoc_container.hpp> using namespace __gnu_pbds; template <typename K, typename V> using HashTable = gp_hash_table<K,V>; constexpr size_t MXN = 20001; constexpr size_t MXM = 400000; constexpr size_t SQR = 450; #define all(x) begin(x), end(x) signed main() { cin.tie(0)->sync_with_stdio(0); int N, M, Q; cin >> N >> M; short world[MXN]; bitset<MXN> friends[MXN]; vector<short> friendss[MXN]; short friendships[MXM]; HashTable<int, short> initial_count[MXN]; // initial_count[i][j] = # of friends of i in world j short X[SQR], Y[SQR]; vector<int> whos_involved; for (int i = 1; i <= N; ++i) cin >> world[i]; for (int i = 0; i < M; ++i) { short a, b; cin >> a >> b; friendss[a].push_back(b); friendss[b].push_back(a); friendships[2*i] = a, friendships[2*i+1] = b; friends[a][b] = true; friends[b][a] = true; } auto reset_map = [&] { sort( all(whos_involved) ); whos_involved.resize(unique(all(whos_involved)) - begin(whos_involved)); for (int c : whos_involved) { if (!initial_count[c].empty()) initial_count[c].clear(); for (int f : friendss[c]) { ++initial_count[c][world[f]]; } } }; cin >> Q; int K = sqrt(Q); int q = 0; HashTable<int,vector<int>> succeeded_wx, succeeded_wy; while (q < Q) { int last = min(Q, q + K); for (int k = q; k < last; ++k) { cin >> X[k-q] >> Y[k-q]; whos_involved.push_back(X[k-q]); whos_involved.push_back(Y[k-q]); } reset_map(); for (int k = 0; k < K && q < Q; ++k, ++q) { short x = X[k], y = Y[k]; if (world[x] == world[y]) { cout << "No\n"; continue; } int start = initial_count[x][world[y]]; for (int xl : succeeded_wx[ world[y] ]) { start -= (friends[x][xl]); } for (int xl : succeeded_wy[ world[y] ]) { start += (friends[x][xl]); } if (start > 0) { cout << "Yes\n"; succeeded_wx[world[x]].push_back(x); succeeded_wy[world[y]].push_back(x); world[x] = world[y]; } else cout << "No\n"; } succeeded_wx.clear(); succeeded_wy.clear(); whos_involved.clear(); } return 0; }