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 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 `//#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 const int maxn=3e3+3; const LL MOD=1e9+7; int n,k; char c; int a,b; int d[maxn][maxn]; char tab[maxn][maxn]; queue kol; LL ile[6]; VPII pola[6]; VPII polx; LL wyn[10]; LL ret,ans; PII m[]={{0,1},{1,0},{-1,0},{0,-1}}; void bfs() { PII w; int dist; while(!kol.empty()) { w=kol.front(); dist=d[w.ST][w.ND]; kol.pop(); for(PII z : m) { if(d[w.ST+z.ST][w.ND+z.ND]>dist+1) { d[w.ST+z.ST][w.ND+z.ND]=dist+1; kol.push(MP(w.ST+z.ST,w.ND+z.ND)); } } } } int sciezki(PII w , int dl) { int fret=0; if(dl==2) { for(PII z : m) { if(d[w.ST+z.ST][w.ND+z.ND]==1) fret++; } return fret; } return 0; } inline bool sasiad(PII w) { if(tab[w.ST][w.ND]=='#') return true; for(PII z : m) { if(tab[w.ST+z.ST][w.ND+z.ND]=='#') return true; } return false; } inline bool dobre(LL maska) { VPII zbior; zbior.clear(); REP(i,SIZE(polx)) { if(maska%2==1) zbior.PB(polx[i]); maska/=2; if(maska==0) break; } REP(i,k) { REP(p,SIZE(zbior)) { if(sasiad(zbior[p])) { tab[zbior[p].ST][zbior[p].ND]='#'; } } } bool wynik=true; REP(p,SIZE(zbior)) { if(tab[zbior[p].ST][zbior[p].ND]=='.') { wynik=false; } tab[zbior[p].ST][zbior[p].ND]='.'; } return wynik; } int main() { scanf("%d %d", &n, &k); REP(i,n+2) { REP(p,n+2) { d[i][p]=4*n; } } FOR(i,1,n) { FOR(p,1,n) { cerr<