#include <algorithm> #include <cstdio> #include <map> #include <utility> #include <vector> using namespace std; class DisjointSets { public: DisjointSets(int n) { parent.resize(n); rank.resize(n); for (int i = 0; i < n; i++) make_set(i); } void make_set(int a) { parent[a] = a; rank[a] = 0; original_kids[a].clear(); } void merge(int a, int b) { int roota = find(a); int rootb = find(b); if (roota != rootb) { if (rank[roota] > rank[rootb]) { parent[rootb] = roota; original_kids[roota].push_back(rootb); } else if(rank[roota] < rank[rootb]) { parent[roota] = rootb; original_kids[rootb].push_back(roota); } else { parent[roota] = rootb; rank[rootb]++; original_kids[rootb].push_back(roota); } } } int find(int a) { if (parent[a] != a) { return find(parent[a]); } return a; } vector<int> explode(int a) { vector<int> kids; collect_kids(find(a), kids); for (int kid : kids) make_set(kid); return kids; } bool alone(int a) { return original_kids[find(a)].empty(); } void liberate(int a) { int roota = find(a); if (roota != a) { for (int kid : original_kids[a]) { parent[kid] = kid; merge(roota, kid); } } else if (!original_kids[a].empty()) { int first_brother = original_kids[a][0]; for (int kid : original_kids[a]) { parent[kid] = kid; merge(first_brother, kid); } } if (parent[a] != a) { vector<int>& parent_kids = original_kids[parent[a]]; parent_kids.erase(std::find(parent_kids.begin(), parent_kids.end(), a)); } make_set(a); } private: vector<int> parent; vector<int> rank; map<int, vector<int>> original_kids; void collect_kids(int a, vector<int>& kids) { kids.push_back(a); for (int kid : original_kids[a]) { collect_kids(kid, kids); } } }; DisjointSets ds(0); vector<bool> has_pc; void handle_plus(int a, int b) { bool alonea = ds.alone(a - 1); bool aloneb = ds.alone(b - 1); if (alonea && aloneb) { if ((has_pc[a-1] + has_pc[b-1]) || (a == b)) { has_pc[a-1] = has_pc[b-1] = true; } else { ds.merge(a-1, b-1); } } else if (alonea + aloneb) { if (alonea) { swap(alonea, aloneb); swap(a, b); } if (has_pc[b-1]) { for(int c : ds.explode(a-1)) { has_pc[c] = true; } } else { ds.merge(a-1, b-1); } } else { if (ds.find(a-1) == ds.find(b-1)) { for(int c : ds.explode(a-1)) { has_pc[c] = true; } } else { ds.merge(a-1, b-1); } } } void handle_minus(int c) { if (ds.alone(c - 1)) { has_pc[c - 1] = false; } else { ds.liberate(c-1); } } void handle_question(int d) { if (ds.alone(d-1)) { printf("%d", has_pc[d-1] ? 1 : 0); return; } printf("?"); } int main() { int n, q, a, b, c, d; char cmd[2]; scanf("%d%d", &n, &q); ds = DisjointSets(n); has_pc = vector<bool>(n, false); while(q--) { scanf("%s", cmd); switch (cmd[0]) { case '+': scanf("%d%d", &a, &b); handle_plus(a, b); break; case '-': scanf("%d", &c); handle_minus(c); break; case '?': scanf("%d", &d); handle_question(d); break; } } printf("\n"); return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 | #include <algorithm> #include <cstdio> #include <map> #include <utility> #include <vector> using namespace std; class DisjointSets { public: DisjointSets(int n) { parent.resize(n); rank.resize(n); for (int i = 0; i < n; i++) make_set(i); } void make_set(int a) { parent[a] = a; rank[a] = 0; original_kids[a].clear(); } void merge(int a, int b) { int roota = find(a); int rootb = find(b); if (roota != rootb) { if (rank[roota] > rank[rootb]) { parent[rootb] = roota; original_kids[roota].push_back(rootb); } else if(rank[roota] < rank[rootb]) { parent[roota] = rootb; original_kids[rootb].push_back(roota); } else { parent[roota] = rootb; rank[rootb]++; original_kids[rootb].push_back(roota); } } } int find(int a) { if (parent[a] != a) { return find(parent[a]); } return a; } vector<int> explode(int a) { vector<int> kids; collect_kids(find(a), kids); for (int kid : kids) make_set(kid); return kids; } bool alone(int a) { return original_kids[find(a)].empty(); } void liberate(int a) { int roota = find(a); if (roota != a) { for (int kid : original_kids[a]) { parent[kid] = kid; merge(roota, kid); } } else if (!original_kids[a].empty()) { int first_brother = original_kids[a][0]; for (int kid : original_kids[a]) { parent[kid] = kid; merge(first_brother, kid); } } if (parent[a] != a) { vector<int>& parent_kids = original_kids[parent[a]]; parent_kids.erase(std::find(parent_kids.begin(), parent_kids.end(), a)); } make_set(a); } private: vector<int> parent; vector<int> rank; map<int, vector<int>> original_kids; void collect_kids(int a, vector<int>& kids) { kids.push_back(a); for (int kid : original_kids[a]) { collect_kids(kid, kids); } } }; DisjointSets ds(0); vector<bool> has_pc; void handle_plus(int a, int b) { bool alonea = ds.alone(a - 1); bool aloneb = ds.alone(b - 1); if (alonea && aloneb) { if ((has_pc[a-1] + has_pc[b-1]) || (a == b)) { has_pc[a-1] = has_pc[b-1] = true; } else { ds.merge(a-1, b-1); } } else if (alonea + aloneb) { if (alonea) { swap(alonea, aloneb); swap(a, b); } if (has_pc[b-1]) { for(int c : ds.explode(a-1)) { has_pc[c] = true; } } else { ds.merge(a-1, b-1); } } else { if (ds.find(a-1) == ds.find(b-1)) { for(int c : ds.explode(a-1)) { has_pc[c] = true; } } else { ds.merge(a-1, b-1); } } } void handle_minus(int c) { if (ds.alone(c - 1)) { has_pc[c - 1] = false; } else { ds.liberate(c-1); } } void handle_question(int d) { if (ds.alone(d-1)) { printf("%d", has_pc[d-1] ? 1 : 0); return; } printf("?"); } int main() { int n, q, a, b, c, d; char cmd[2]; scanf("%d%d", &n, &q); ds = DisjointSets(n); has_pc = vector<bool>(n, false); while(q--) { scanf("%s", cmd); switch (cmd[0]) { case '+': scanf("%d%d", &a, &b); handle_plus(a, b); break; case '-': scanf("%d", &c); handle_minus(c); break; case '?': scanf("%d", &d); handle_question(d); break; } } printf("\n"); return 0; } |