#include <vector> #include <cstdio> #include <stack> #include <algorithm> #include <queue> #include <map> #include <cmath> #include <unordered_set> #include <unordered_map> #include <set> #include <cstring> #include <bitset> #include <iostream> #include <queue> #include <iomanip> #include <complex> using namespace std; #define ALL(x) x.begin(), x.end() #define UNIQUE(c) (c).resize(unique(ALL(c)) - (c).begin()) #define FOR(i, a, b) for(int i =(a); i <=(b); ++i) #define RE(i, n) FOR(i, 1, n) #define RED(i, n) FORD(i, n, 1) #define FORD(i, a, b) for(int i = (a); i >= (b); --i) #define REP(i, n) for(int i = 0;i <(n); ++i) #define REPD(i, n) FORD(i, n-1,0) const int maxn = 30010; const long long mod = 998244353, inf = 1000000000; int n, m1, m2, a, b; set<int>v[maxn], v2[maxn]; bool odw[maxn], odw2[maxn]; vector<tuple<char, int, int>>res; void dfs(int x) { odw[x] = true; if(x != 1 && !v[1].contains(x)) { v[1].insert(x); v[x].insert(1); res.emplace_back('+', 1, x); } for(auto el: v[x])if(!odw[el])dfs(el); } void dfs2(int x) { odw2[x] = true; for(auto el: v2[x])if(!odw2[el])dfs2(el); if(v[1].contains(x) && !v2[1].contains(x)){ res.emplace_back('-', 1, x); } } void solve() { cin>>n>>m1; REP(i, m1){ cin>>a>>b; v[a].insert(b); v[b].insert(a); } cin>>m2; REP(i, m2){ cin>>a>>b; v2[a].insert(b); v2[b].insert(a); } dfs(1); RE(i, n){ for(auto el: v2[i])if(!v[i].contains(el)){ v[i].insert(el); v[el].insert(i); res.emplace_back('+', i, el); } } FOR(i, 2, n){ vector<int>er; for(auto el: v[i])if(el != 1 && !v2[i].contains(el)){ v[el].erase(i); er.emplace_back(el); res.emplace_back('-', i, el); } for(auto e: er)v[i].erase(e); } dfs2(1); cout<<res.size()<<"\n"; for(auto [z,x,y]: res){ cout<<z<<" "<<x<<" "<<y<<"\n"; } } int main() { ios_base::sync_with_stdio(false), cin.tie(nullptr); int tt = 1; // cin >> tt; while (tt--) { solve(); } 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 | #include <vector> #include <cstdio> #include <stack> #include <algorithm> #include <queue> #include <map> #include <cmath> #include <unordered_set> #include <unordered_map> #include <set> #include <cstring> #include <bitset> #include <iostream> #include <queue> #include <iomanip> #include <complex> using namespace std; #define ALL(x) x.begin(), x.end() #define UNIQUE(c) (c).resize(unique(ALL(c)) - (c).begin()) #define FOR(i, a, b) for(int i =(a); i <=(b); ++i) #define RE(i, n) FOR(i, 1, n) #define RED(i, n) FORD(i, n, 1) #define FORD(i, a, b) for(int i = (a); i >= (b); --i) #define REP(i, n) for(int i = 0;i <(n); ++i) #define REPD(i, n) FORD(i, n-1,0) const int maxn = 30010; const long long mod = 998244353, inf = 1000000000; int n, m1, m2, a, b; set<int>v[maxn], v2[maxn]; bool odw[maxn], odw2[maxn]; vector<tuple<char, int, int>>res; void dfs(int x) { odw[x] = true; if(x != 1 && !v[1].contains(x)) { v[1].insert(x); v[x].insert(1); res.emplace_back('+', 1, x); } for(auto el: v[x])if(!odw[el])dfs(el); } void dfs2(int x) { odw2[x] = true; for(auto el: v2[x])if(!odw2[el])dfs2(el); if(v[1].contains(x) && !v2[1].contains(x)){ res.emplace_back('-', 1, x); } } void solve() { cin>>n>>m1; REP(i, m1){ cin>>a>>b; v[a].insert(b); v[b].insert(a); } cin>>m2; REP(i, m2){ cin>>a>>b; v2[a].insert(b); v2[b].insert(a); } dfs(1); RE(i, n){ for(auto el: v2[i])if(!v[i].contains(el)){ v[i].insert(el); v[el].insert(i); res.emplace_back('+', i, el); } } FOR(i, 2, n){ vector<int>er; for(auto el: v[i])if(el != 1 && !v2[i].contains(el)){ v[el].erase(i); er.emplace_back(el); res.emplace_back('-', i, el); } for(auto e: er)v[i].erase(e); } dfs2(1); cout<<res.size()<<"\n"; for(auto [z,x,y]: res){ cout<<z<<" "<<x<<" "<<y<<"\n"; } } int main() { ios_base::sync_with_stdio(false), cin.tie(nullptr); int tt = 1; // cin >> tt; while (tt--) { solve(); } return 0; } |