Submission #1049262

#TimeUsernameProblemLanguageResultExecution timeMemory
1049262windowwifeJoker (BOI20_joker)C++17
100 / 100
125 ms19324 KiB
#include<bits/stdc++.h> #define ll long long #define task "" using namespace std; const int maxn = 4e5 + 2; int n, m, q, max_r[maxn], u[maxn], v[maxn], l, r, par[maxn]; vector<pair<int, int>> rb; int find_set (int u) { if (par[u] < 0) return u; return find_set(par[u]); } void union_set (int u, int v) { int pu = find_set(u), pv = find_set(v); if (pu == pv) return; if (par[pu] > par[pv]) swap(pu, pv); rb.push_back({pu, par[pu]}); rb.push_back({pv, par[pv]}); par[pu] += par[pv]; par[pv] = pu; } void rollback () { if (rb.empty()) return; par[rb.back().first] = rb.back().second; rb.pop_back(); } void pbs (int low, int high, int r) { if (low > high) return; //cout << low << " " << high << " " << r << endl; int mid = (low + high)/2, tmp = rb.size(); for (int i = max(low, 1); i <= mid; i++) { //cout << i << endl; union_set(u[i], v[i] + n); union_set(u[i] + n, v[i]); if (find_set(u[i]) == find_set(u[i] + n)) { for (int j = mid; j <= high; j++) max_r[j] = r; while ((int)rb.size() > tmp) rollback(); pbs(low, mid - 1, r); return; } } int tmp2 = rb.size(); for (int i = r - 1; i > low; i--) { union_set(u[i], v[i] + n); union_set(u[i] + n, v[i]); if (find_set(u[i]) == find_set(u[i] + n)) { max_r[mid] = i; break; } } while ((int)rb.size() > tmp2) rollback(); pbs(mid + 1, high, r); while ((int)rb.size() > tmp) rollback(); for (int i = r - 1; i >= max(max_r[mid], low + 1); i--) { union_set(u[i], v[i] + n); union_set(u[i] + n, v[i]); if (find_set(u[i]) == find_set(u[i] + n)) { for (int j = low; j <= mid; j++) max_r[j] = max_r[mid]; return; } } pbs(low, mid - 1, max_r[mid]); } int main () { //freopen(task".INP", "r", stdin); //freopen(task".OUT", "w", stdout); ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m >> q; for (int i = 1; i <= 2*n; i++) par[i] = -1; for (int i = 1; i <= m; i++) cin >> u[i] >> v[i]; pbs(0, m - 1, m + 1); while (q--) { cin >> l >> r; cout << (r < max_r[l - 1] ? "YES" : "NO") << '\n'; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...