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 `#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef vector VI; typedef long long LL; typedef vector VVI; typedef vector VLL; typedef vector VD; typedef vector VS; typedef pair PII; typedef vector VPII; typedef pair PLL; typedef vector VPLL; #define FOR(x, b, e) for(int x = b; x <= (e); ++x) #define FORD(x, b, e) for(int x = b; x >= (e); --x) #define REP(x, n) for(int x = 0; x < (n); ++x) #define VAR(v, n) typeof(n) v = (n) #define ALL(c) (c).begin(), (c).end() #define SIZE(x) ((int)(x).size()) #define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i) #define PB push_back #define ST first #define ND second #define MP make_pair #define PF push_front int t,n,m; const int maxn=(1e5+5); vector g[maxn]; vector bajt[maxn]; int deg[maxn]; int a,b; char zn; int s[maxn]; int skoj[maxn][2]; bitset v; int ile; bool dfs(int x ) { v[x]=1; for(int w : g[x]) { if((skoj[w][1]==0) || (!v[skoj[w][1]] && dfs(skoj[w][1]) )) { skoj[x][0]=w; skoj[w][1]=x; return true; } } return false; } void ofast() { bool dalej=true; while(dalej) { dalej=false; v.reset(); for(int i=1; i<=n; i++) { if(!v[i] && skoj[i][0]==0) { if(dfs(i)) { ile++; dalej=true; } } } } /* if(ile==2*n) { printf("YES\n"); return; } printf("NO\n"); return; */ } int main() { scanf("%d", &t); while(t--) { //cerr<<"test "<<12-t<