#include <bits/stdc++.h> using namespace std; //{ #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define FORD(i, a, b) for(int i = (a); i >= (b); --i) #define VAR(v, i) __typeof(i) v=(i) #define all(v) (v).begin(),(v).end() #define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i) #define PII pair<int,int> #define st first #define nd second #define pb push_back #define lint long long int #define VI vector<int> #define sim template < class c #define ris return * this #define dor > debug & operator << #define eni(x) sim > typename \ enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) { sim > struct rge { c b, e; }; sim > rge<c> range(c i, c j) { return rge<c>{i, j}; } sim > auto dud(c* x) -> decltype(cerr << *x, 0); sim > char dud(...); struct debug { ~debug() { cerr << endl; } eni(!=) cerr << boolalpha << i; ris; } eni(==) ris << range(begin(i), end(i)); } sim, class b dor(pair < b, c > d) { ris << "(" << d.first << ", " << d.second << ")"; } sim dor(rge<c> d) { *this << "["; for (auto it = d.b; it != d.e; ++it) *this << ", " + 2 * (it == d.b) << *it; ris << "]"; } }; //{ #define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] " #define make( x) int (x); scanf("%d",&(x)); #define make2( x, y) int (x), (y); scanf("%d%d",&(x),&(y)); #define make3(x, y, z) int (x), (y), (z); scanf("%d%d%d",&(x),&(y),&(z)); #define make4(x, y, z, t) int (x), (y), (z), (t); scanf("%d%d%d%d",&(x),&(y),&(z),&(t)); #define makev(v,n) VI (v); FOR(i,0,(n)) { make(a); (v).pb(a);} #define IOS ios_base::sync_with_stdio(0) #define HEAP priority_queue #define read( x) scanf("%d",&(x)); #define read2( x, y) scanf("%d%d",&(x),&(y)); #define read3(x, y, z) scanf("%d%d%d",&(x),&(y),&(z)); #define read4(x, y, z, t) scanf("%d%d%d%d",&(x),&(y),&(z),&(t)); #define readv(v,n) FOR(i,0,(n)) { make(a); (v).pb(a);} #define jeb() fflush(stdout); //} int n, m1, m2; VI g1[30005]; VI g2[30005]; bitset<30000> g1mask[30005]; bitset<30000> g2mask[30005]; vector<PII> dodaj; vector<PII> ujmij; void odpowiedz() { int ruchy = dodaj.size() + ujmij.size(); printf("%d\n", ruchy); FOR(i,0,dodaj.size()) { printf("+ %d %d\n", dodaj[i].st + 1, dodaj[i].nd + 1); } FOR(i,0,ujmij.size()) { printf("- %d %d\n", ujmij[i].st + 1, ujmij[i].nd + 1); } } void wczytaj() { read(n); read(m1); FOR(i,0,m1) { make2(a, b); a--; b--; g1[a].pb(b); g1[b].pb(a); g1mask[a].set(b); g1mask[b].set(a); } read(m2); FOR(i,0,m2) { make2(a, b); a--; b--; g2[a].pb(b); g2[b].pb(a); g2mask[a].set(b); g2mask[b].set(a); } } int visited[30005]; VI kolej1, kolej2; void dfs1(int v) { visited[v] = 1; kolej1.pb(v); FORE(i, g1[v]) { int w = *i; if (!visited[w]) { dfs1(w); } } } void dfs2(int v) { visited[v] = 1; kolej2.pb(v); FORE(i, g2[v]) { int w = *i; if (!visited[w]) { dfs2(w); } } } int main() { wczytaj(); FOR(i,0,n) visited[i] = 0; dfs1(0); FOR(i,0,n) visited[i] = 0; dfs2(0); FOR(i,0,n) { int v = kolej1[i]; if (v == 0) continue; if (!g1mask[0].test(v)) { dodaj.pb({0,v}); } } FOR(i,1,n) { FORE(j, g2[i]) { int v = *j; if (v > i && !g1mask[i].test(v)) { dodaj.pb({i, v}); } } } FOR(i,1,n) { FORE(j, g1[i]) { int v = *j; if (v > i && !g2mask[i].test(v)) { ujmij.pb({i, v}); } } } reverse(all(kolej2)); FOR(i,0,n) { int v = kolej2[i]; if (v == 0) continue; if (!g2mask[0].test(v)) { ujmij.pb({0,v}); } } odpowiedz(); }
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 | #include <bits/stdc++.h> using namespace std; //{ #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define FORD(i, a, b) for(int i = (a); i >= (b); --i) #define VAR(v, i) __typeof(i) v=(i) #define all(v) (v).begin(),(v).end() #define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i) #define PII pair<int,int> #define st first #define nd second #define pb push_back #define lint long long int #define VI vector<int> #define sim template < class c #define ris return * this #define dor > debug & operator << #define eni(x) sim > typename \ enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) { sim > struct rge { c b, e; }; sim > rge<c> range(c i, c j) { return rge<c>{i, j}; } sim > auto dud(c* x) -> decltype(cerr << *x, 0); sim > char dud(...); struct debug { ~debug() { cerr << endl; } eni(!=) cerr << boolalpha << i; ris; } eni(==) ris << range(begin(i), end(i)); } sim, class b dor(pair < b, c > d) { ris << "(" << d.first << ", " << d.second << ")"; } sim dor(rge<c> d) { *this << "["; for (auto it = d.b; it != d.e; ++it) *this << ", " + 2 * (it == d.b) << *it; ris << "]"; } }; //{ #define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] " #define make( x) int (x); scanf("%d",&(x)); #define make2( x, y) int (x), (y); scanf("%d%d",&(x),&(y)); #define make3(x, y, z) int (x), (y), (z); scanf("%d%d%d",&(x),&(y),&(z)); #define make4(x, y, z, t) int (x), (y), (z), (t); scanf("%d%d%d%d",&(x),&(y),&(z),&(t)); #define makev(v,n) VI (v); FOR(i,0,(n)) { make(a); (v).pb(a);} #define IOS ios_base::sync_with_stdio(0) #define HEAP priority_queue #define read( x) scanf("%d",&(x)); #define read2( x, y) scanf("%d%d",&(x),&(y)); #define read3(x, y, z) scanf("%d%d%d",&(x),&(y),&(z)); #define read4(x, y, z, t) scanf("%d%d%d%d",&(x),&(y),&(z),&(t)); #define readv(v,n) FOR(i,0,(n)) { make(a); (v).pb(a);} #define jeb() fflush(stdout); //} int n, m1, m2; VI g1[30005]; VI g2[30005]; bitset<30000> g1mask[30005]; bitset<30000> g2mask[30005]; vector<PII> dodaj; vector<PII> ujmij; void odpowiedz() { int ruchy = dodaj.size() + ujmij.size(); printf("%d\n", ruchy); FOR(i,0,dodaj.size()) { printf("+ %d %d\n", dodaj[i].st + 1, dodaj[i].nd + 1); } FOR(i,0,ujmij.size()) { printf("- %d %d\n", ujmij[i].st + 1, ujmij[i].nd + 1); } } void wczytaj() { read(n); read(m1); FOR(i,0,m1) { make2(a, b); a--; b--; g1[a].pb(b); g1[b].pb(a); g1mask[a].set(b); g1mask[b].set(a); } read(m2); FOR(i,0,m2) { make2(a, b); a--; b--; g2[a].pb(b); g2[b].pb(a); g2mask[a].set(b); g2mask[b].set(a); } } int visited[30005]; VI kolej1, kolej2; void dfs1(int v) { visited[v] = 1; kolej1.pb(v); FORE(i, g1[v]) { int w = *i; if (!visited[w]) { dfs1(w); } } } void dfs2(int v) { visited[v] = 1; kolej2.pb(v); FORE(i, g2[v]) { int w = *i; if (!visited[w]) { dfs2(w); } } } int main() { wczytaj(); FOR(i,0,n) visited[i] = 0; dfs1(0); FOR(i,0,n) visited[i] = 0; dfs2(0); FOR(i,0,n) { int v = kolej1[i]; if (v == 0) continue; if (!g1mask[0].test(v)) { dodaj.pb({0,v}); } } FOR(i,1,n) { FORE(j, g2[i]) { int v = *j; if (v > i && !g1mask[i].test(v)) { dodaj.pb({i, v}); } } } FOR(i,1,n) { FORE(j, g1[i]) { int v = *j; if (v > i && !g2mask[i].test(v)) { ujmij.pb({i, v}); } } } reverse(all(kolej2)); FOR(i,0,n) { int v = kolej2[i]; if (v == 0) continue; if (!g2mask[0].test(v)) { ujmij.pb({0,v}); } } odpowiedz(); } |