//#define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <vector> #include <cmath> using namespace std; int n, mag[100][4], pun[10][2], nr1, nr2, nr3, to[100], nrp, si; long double dob1, dob2, dob3, wyn = 0;; vector <long double>prost[4]; vector <int>kom; int portan(int x1, int y1, int x2, int y2) { if (y1 * x2 == y2 * x1)return 0; if (y1 * x2 > y2 * x1)return 1; return 2; } int sorwek(int a1, int a2, int b1, int b2, int c1, int c2) { //printf("%d %d %d %d %d %d\n\n", a1, a2, b1, b2, c1, c2); if (a1 == 0) { if (a2 > 0) { if (b1 > 0 && c1 < 0)return 2; if (b1 < 0 && c1 > 0)return 3; if (portan(b1, b2, c1, c2) == 0) { if (b1*b1 + b2 * b2 < c1*c1 + c2 * c2) { return 2; } return 3; } if (portan(b1, b2, c1, c2) == 1)return 3; return 2; } else { if (b1 > 0 && c1 < 0)return 3; if (b1 < 0 && c1 > 0)return 2; if (portan(b1, b2, c1, c2) == 0) { if (b1*b1 + b2 * b2 < c1*c1 + c2 * c2) { return 2; } return 3; } if (portan(b1, b2, c1, c2) == 1)return 2; return 3; } } if (a1 < 0) { if (b1 == 0 && c1 == 0) { if (b2*c2 > 0) { if (b2*b2 > c2*c2)return 3; else return 2; } if (b2 > 0) return 2; return 3; } if (b1 == 0) { if (b2 > 0) { if (c1 > 0)return 2; if (portan(a1, a2, c1, c2) == 0)return 2; if (portan(a1, a2, c1, c2) == 1)return 3; return 2; } if (b2 < 0) { if (c1 > 0)return 3; if (portan(a1, a2, c1, c2) == 0)return 2; if (portan(a1, a2, c1, c2) == 1)return 3; return 2; } } if (c1 == 0) { if (c2 > 0) { if (b1 > 0)return 3; if (portan(a1, a2, b1, b2) == 0)return 3; if (portan(a1, a2, b1, b2) == 1)return 2; return 3; } if (c2 < 0) { if (b1 > 0)return 2; if (portan(a1, a2, b1, b2) == 0)return 3; if (portan(a1, a2, b1, b2) == 1)return 2; return 3; } } } if (a1 > 0) { if (b1 == 0 && c1 == 0) { if (b2*c2 > 0) { if (b2*b2 > c2*c2)return 3; else return 2; } if (b2 > 0) return 3; return 2; } if (b1 == 0) { if (b2 > 0) { if (c1 > 0)return 3; if (portan(a1, a2, c1, c2) == 0)return 2; if (portan(a1, a2, c1, c2) == 1)return 3; return 2; } if (b2 < 0) { if (c1 > 0)return 2; if (portan(a1, a2, c1, c2) == 0)return 2; if (portan(a1, a2, c1, c2) == 1)return 3; return 2; } } if (c1 == 0) { if (c2 > 0) { if (b1 > 0)return 2; if (portan(a1, a2, b1, b2) == 0)return 3; if (portan(a1, a2, b1, b2) == 1)return 2; return 3; } if (c2 < 0) { if (b1 > 0)return 3; if (portan(a1, a2, b1, b2) == 0)return 3; if (portan(a1, a2, b1, b2) == 1)return 2; return 3; } } } if (b1*c1 > 0) { if (a1*b1 > 0) { if (portan(a1, a2, b1, b2) == 0)return 3; if (portan(a1, a2, c1, c2) == 0)return 2; if (portan(a1, a2, b1, b2) == 1 && portan(a1, a2, c1, c2) == 2)return 2; if (portan(a1, a2, b1, b2) == 2 && portan(a1, a2, c1, c2) == 1)return 3; if (portan(b1, b2, c1, c2) == 0) { if (b1*b1 < c1*c1)return 2; return 3; } if (portan(b1, b2, c1, c2) == 1)return 2; return 3; } if (portan(b1, b2, c1, c2) == 0) { if (b1*b1 < c1*c1)return 2; return 3; } if (portan(b1, b2, c1, c2) == 1)return 2; return 3; } if (a1*b1 > 0) { if (portan(a1, a2, b1, b2) == 0)return 3; if (portan(a1, a2, b1, b2) == 1)return 2; return 3; } if (portan(a1, a2, c1, c2) == 0)return 2; if (portan(a1, a2, c1, c2) == 1)return 3; return 2; } long double polet(long double x1, long double y1, long double x2, long double y2, long double x3, long double y3) { long double a, b, c, p; a = (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1); b = (x3 - x2) * (x3 - x2) + (y3 - y2) * (y3 - y2); c = (x3 - x1) * (x3 - x1) + (y3 - y1) * (y3 - y1); a = sqrt(a); b = sqrt(b); c = sqrt(c); p = a + b + c; p /= 2; p = p * (p - a)*(p - b)*(p - c); p = sqrt(p); return p; } int main() { scanf("%d", &n); for (int i = 0; i < n; i++) { scanf("%d%d%d%d", &mag[i][0], &mag[i][1], &mag[i][2], &mag[i][3]); } for (int i = 0; i < n; i++)to[i] = 0; //printf("mag nr 2\n%d %d\n%d %d\n", mag[1][0], mag[1][1], mag[1][2], mag[1][3]); pun[0][0] = mag[0][0]; pun[0][1] = mag[0][1]; pun[1][0] = mag[0][2]; pun[1][1] = mag[0][3]; if (pun[0][0] == pun[1][0] && pun[0][1] < pun[1][1]) { pun[0][0] = pun[1][0]; pun[0][1] = pun[1][1]; } if (pun[0][0] < pun[1][0]) { pun[0][0] = pun[1][0]; pun[0][1] = pun[1][1]; } nr1 = 0; for (int i = 1; i < n; i++) { pun[2][0] = mag[i][0]; pun[2][1] = mag[i][1]; pun[3][0] = mag[i][2]; pun[3][1] = mag[i][3]; if (pun[2][0] == pun[3][0] && pun[2][1] < pun[3][1]) { pun[2][0] = pun[3][0]; pun[2][1] = pun[3][1]; } if (pun[2][0] < pun[3][0]) { pun[2][0] = pun[3][0]; pun[2][1] = pun[3][1]; } if (pun[0][0] == pun[2][0] && pun[0][1] > pun[2][1]) { pun[0][0] = pun[2][0]; pun[0][1] = pun[2][1]; nr1 = i; } if (pun[0][0] > pun[2][0]) { pun[0][0] = pun[2][0]; pun[0][1] = pun[2][1]; nr1 = i; } } nrp = nr1; pun[0][0] = mag[nr1][0]; pun[0][1] = mag[nr1][1]; pun[2][0] = pun[0][0] - 1; pun[2][1] = pun[0][1]; for (int i = 0; i < n; i++) { if (i == nr1)continue; if (to[i] == 1)continue; if (sorwek(-502, 0, mag[i][0] - pun[0][0], mag[i][1] - pun[0][1], mag[i][2] - pun[0][0], mag[i][3] - pun[0][1]) == 2) { pun[1][0] = mag[i][2]; pun[1][1] = mag[i][3]; } else { //printf("%d\n", i); pun[1][0] = mag[i][0]; pun[1][1] = mag[i][1]; } if (sorwek(-500, 0, pun[1][0] - pun[0][0], pun[1][1] - pun[0][1], pun[2][0] - pun[0][0], pun[2][1] - pun[0][1]) == 2) { pun[2][0] = pun[1][0]; pun[2][1] = pun[1][1]; nr2 = i; } } nr3 = nr2; pun[3][0] = pun[2][0]; pun[3][1] = pun[2][0]; pun[0][0] = mag[nr1][2]; pun[0][1] = mag[nr1][3]; pun[2][0] = pun[0][0] - 1; pun[2][1] = pun[0][1]; for (int i = 0; i < n; i++) { if (i == nr1)continue; if (to[i] == 1)continue; if (sorwek(-502, 0, mag[i][0] - pun[0][0], mag[i][1] - pun[0][1], mag[i][2] - pun[0][0], mag[i][3] - pun[0][1]) == 2) { pun[1][0] = mag[i][2]; pun[1][1] = mag[i][3]; } else { //printf("%d\n", i); pun[1][0] = mag[i][0]; pun[1][1] = mag[i][1]; } if (sorwek(-500, 0, pun[1][0] - pun[0][0], pun[1][1] - pun[0][1], pun[2][0] - pun[0][0], pun[2][1] - pun[0][1]) == 2) { pun[2][0] = pun[1][0]; pun[2][1] = pun[1][1]; nr2 = i; } } if (sorwek(-1, 0, pun[3][0] - mag[nr1][0], pun[3][1] - mag[nr1][1], pun[2][0] - mag[nr1][2], pun[2][1] - mag[nr1][3]) == 2) { nr2 = nr3; pun[2][0] = pun[3][0]; pun[2][1] = pun[3][1]; pun[0][0] = mag[nr1][0]; pun[0][1] = mag[nr1][1]; } else { pun[0][0] = mag[nr1][2]; pun[0][1] = mag[nr1][3]; } prost[0].push_back(pun[0][0]); prost[1].push_back(pun[0][1]); prost[2].push_back(pun[2][0]); prost[3].push_back(pun[2][1]); kom.push_back(nr1); kom.push_back(nr2); for (int j = 0; nr2 != nrp; j++) { nr1 = nr2; to[nr1] = 1; pun[0][0] = mag[nr1][0]; pun[0][1] = mag[nr1][1]; pun[2][0] = pun[0][0]; pun[2][1] = pun[0][1]; for (int i = 0; i < n; i++) { if (to[i] == 1)continue; if (sorwek(prost[2][j] - prost[0][j], prost[1][j] - prost[1][j], mag[i][0] - pun[0][0], mag[i][1] - pun[0][1], mag[i][2] - pun[0][0], mag[i][3] - pun[0][1]) == 2) { pun[1][0] = mag[i][2]; pun[1][1] = mag[i][3]; } else { //printf("%d\n", i); pun[1][0] = mag[i][0]; pun[1][1] = mag[i][1]; } if (sorwek(prost[2][j] - prost[0][j], prost[1][j] - prost[1][j], pun[1][0] - pun[0][0], pun[1][1] - pun[0][1], pun[2][0] - pun[0][0], pun[2][1] - pun[0][1]) == 2) { pun[2][0] = pun[1][0]; pun[2][1] = pun[1][1]; nr2 = i; } } nr3 = nr2; pun[3][0] = pun[2][0]; pun[3][1] = pun[2][1]; pun[0][0] = mag[nr1][2]; pun[0][1] = mag[nr1][3]; pun[2][0] = pun[0][0]; pun[2][1] = pun[0][1]; for (int i = 0; i < n; i++) { if (to[i] == 1)continue; if (sorwek(prost[2][j] - prost[0][j], prost[1][j] - prost[1][j], mag[i][0] - pun[0][0], mag[i][1] - pun[0][1], mag[i][2] - pun[0][0], mag[i][3] - pun[0][1]) == 2) { pun[1][0] = mag[i][2]; pun[1][1] = mag[i][3]; } else { //printf("%d\n", i); pun[1][0] = mag[i][0]; pun[1][1] = mag[i][1]; } if (sorwek(prost[2][j] - prost[0][j], prost[1][j] - prost[1][j], pun[1][0] - pun[0][0], pun[1][1] - pun[0][1], pun[2][0] - pun[0][0], pun[2][1] - pun[0][1]) == 2) { pun[2][0] = pun[1][0]; pun[2][1] = pun[1][1]; nr2 = i; } } if (sorwek(prost[2][j] - prost[0][j], prost[1][j] - prost[1][j], pun[3][0] - mag[nr1][0], pun[3][1] - mag[nr1][1], pun[2][0] - mag[nr1][2], pun[2][1] - mag[nr1][3]) == 2) { //printf("."); nr2 = nr3; pun[2][0] = pun[3][0]; pun[2][1] = pun[3][1]; pun[0][0] = mag[nr1][0]; pun[0][1] = mag[nr1][1]; } else { pun[0][0] = mag[nr1][2]; pun[0][1] = mag[nr1][3]; } prost[0].push_back(pun[0][0]); prost[1].push_back(pun[0][1]); prost[2].push_back(pun[2][0]); //printf("%d",pun[2][1]); prost[3].push_back(pun[2][1]); kom.push_back(nr2); if (j > n + 2) { printf("0.000000000"); return 0; } } si = prost[0].size(); for (int j = 1; j < n; j++) { if (prost[0][j] == prost[2][j - 1] && prost[1][j] == prost[3][j - 1])continue; dob1 = polet(prost[0][j - 1], prost[1][j - 1], prost[0][j], prost[1][j], prost[2][j], prost[3][j]); dob2 = polet(prost[2][j - 1], prost[3][j - 1], prost[0][j], prost[1][j], prost[2][j], prost[3][j]); dob3 = dob1 / (dob1 + dob2); dob1 = (prost[2][j - 1] - prost[0][j - 1])*dob3 + prost[0][j - 1]; dob2 = (prost[3][j - 1] - prost[1][j - 1])*dob3 + prost[1][j - 1]; prost[2][j - 1] = dob1; prost[3][j - 1] = dob2; prost[0][j] = dob1; prost[1][j] = dob2; } if (prost[0][0] != prost[2][si - 1] || prost[1][0] != prost[3][si - 1]) { dob1 = polet(prost[0][si - 1], prost[1][si - 1], prost[0][0], prost[1][0], prost[2][0], prost[3][0]); dob2 = polet(prost[2][si - 1], prost[3][si - 1], prost[0][0], prost[1][0], prost[2][0], prost[3][0]); dob3 = dob1 / (dob1 + dob2); dob1 = (prost[2][si - 1] - prost[0][si - 1])*dob3 + prost[0][si - 1]; dob2 = (prost[3][si - 1] - prost[1][si - 1])*dob3 + prost[1][si - 1]; prost[2][si - 1] = dob1; prost[3][si - 1] = dob2; prost[0][0] = dob1; prost[1][0] = dob2; } for (int i = 2; i < si; i++) { //printf("%Lf %Lf\n", prost[0][i], prost[1][i]); wyn += polet(prost[0][0], prost[1][0], prost[0][i - 1], prost[1][i - 1], prost[0][i], prost[1][i]); } printf("%.10Lf\n", wyn); //printf("%Lf",dob); /*for (int i = 0; i < prost[0].size(); i++) { printf("%d %d %d %d %d\n", prost[0][i], prost[1][i], prost[2][i], prost[3][i], kom[i +1]); }*/ //printf("%d %d %d %d %d %d ",nr1, pun[0][0], pun[0][1] , nr2,pun[2][0],pun[2][1]); //printf("\n%d %d %d", pun[0][0], pun[0][1], nr1); //system("PAUSE"); }
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 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 | //#define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <vector> #include <cmath> using namespace std; int n, mag[100][4], pun[10][2], nr1, nr2, nr3, to[100], nrp, si; long double dob1, dob2, dob3, wyn = 0;; vector <long double>prost[4]; vector <int>kom; int portan(int x1, int y1, int x2, int y2) { if (y1 * x2 == y2 * x1)return 0; if (y1 * x2 > y2 * x1)return 1; return 2; } int sorwek(int a1, int a2, int b1, int b2, int c1, int c2) { //printf("%d %d %d %d %d %d\n\n", a1, a2, b1, b2, c1, c2); if (a1 == 0) { if (a2 > 0) { if (b1 > 0 && c1 < 0)return 2; if (b1 < 0 && c1 > 0)return 3; if (portan(b1, b2, c1, c2) == 0) { if (b1*b1 + b2 * b2 < c1*c1 + c2 * c2) { return 2; } return 3; } if (portan(b1, b2, c1, c2) == 1)return 3; return 2; } else { if (b1 > 0 && c1 < 0)return 3; if (b1 < 0 && c1 > 0)return 2; if (portan(b1, b2, c1, c2) == 0) { if (b1*b1 + b2 * b2 < c1*c1 + c2 * c2) { return 2; } return 3; } if (portan(b1, b2, c1, c2) == 1)return 2; return 3; } } if (a1 < 0) { if (b1 == 0 && c1 == 0) { if (b2*c2 > 0) { if (b2*b2 > c2*c2)return 3; else return 2; } if (b2 > 0) return 2; return 3; } if (b1 == 0) { if (b2 > 0) { if (c1 > 0)return 2; if (portan(a1, a2, c1, c2) == 0)return 2; if (portan(a1, a2, c1, c2) == 1)return 3; return 2; } if (b2 < 0) { if (c1 > 0)return 3; if (portan(a1, a2, c1, c2) == 0)return 2; if (portan(a1, a2, c1, c2) == 1)return 3; return 2; } } if (c1 == 0) { if (c2 > 0) { if (b1 > 0)return 3; if (portan(a1, a2, b1, b2) == 0)return 3; if (portan(a1, a2, b1, b2) == 1)return 2; return 3; } if (c2 < 0) { if (b1 > 0)return 2; if (portan(a1, a2, b1, b2) == 0)return 3; if (portan(a1, a2, b1, b2) == 1)return 2; return 3; } } } if (a1 > 0) { if (b1 == 0 && c1 == 0) { if (b2*c2 > 0) { if (b2*b2 > c2*c2)return 3; else return 2; } if (b2 > 0) return 3; return 2; } if (b1 == 0) { if (b2 > 0) { if (c1 > 0)return 3; if (portan(a1, a2, c1, c2) == 0)return 2; if (portan(a1, a2, c1, c2) == 1)return 3; return 2; } if (b2 < 0) { if (c1 > 0)return 2; if (portan(a1, a2, c1, c2) == 0)return 2; if (portan(a1, a2, c1, c2) == 1)return 3; return 2; } } if (c1 == 0) { if (c2 > 0) { if (b1 > 0)return 2; if (portan(a1, a2, b1, b2) == 0)return 3; if (portan(a1, a2, b1, b2) == 1)return 2; return 3; } if (c2 < 0) { if (b1 > 0)return 3; if (portan(a1, a2, b1, b2) == 0)return 3; if (portan(a1, a2, b1, b2) == 1)return 2; return 3; } } } if (b1*c1 > 0) { if (a1*b1 > 0) { if (portan(a1, a2, b1, b2) == 0)return 3; if (portan(a1, a2, c1, c2) == 0)return 2; if (portan(a1, a2, b1, b2) == 1 && portan(a1, a2, c1, c2) == 2)return 2; if (portan(a1, a2, b1, b2) == 2 && portan(a1, a2, c1, c2) == 1)return 3; if (portan(b1, b2, c1, c2) == 0) { if (b1*b1 < c1*c1)return 2; return 3; } if (portan(b1, b2, c1, c2) == 1)return 2; return 3; } if (portan(b1, b2, c1, c2) == 0) { if (b1*b1 < c1*c1)return 2; return 3; } if (portan(b1, b2, c1, c2) == 1)return 2; return 3; } if (a1*b1 > 0) { if (portan(a1, a2, b1, b2) == 0)return 3; if (portan(a1, a2, b1, b2) == 1)return 2; return 3; } if (portan(a1, a2, c1, c2) == 0)return 2; if (portan(a1, a2, c1, c2) == 1)return 3; return 2; } long double polet(long double x1, long double y1, long double x2, long double y2, long double x3, long double y3) { long double a, b, c, p; a = (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1); b = (x3 - x2) * (x3 - x2) + (y3 - y2) * (y3 - y2); c = (x3 - x1) * (x3 - x1) + (y3 - y1) * (y3 - y1); a = sqrt(a); b = sqrt(b); c = sqrt(c); p = a + b + c; p /= 2; p = p * (p - a)*(p - b)*(p - c); p = sqrt(p); return p; } int main() { scanf("%d", &n); for (int i = 0; i < n; i++) { scanf("%d%d%d%d", &mag[i][0], &mag[i][1], &mag[i][2], &mag[i][3]); } for (int i = 0; i < n; i++)to[i] = 0; //printf("mag nr 2\n%d %d\n%d %d\n", mag[1][0], mag[1][1], mag[1][2], mag[1][3]); pun[0][0] = mag[0][0]; pun[0][1] = mag[0][1]; pun[1][0] = mag[0][2]; pun[1][1] = mag[0][3]; if (pun[0][0] == pun[1][0] && pun[0][1] < pun[1][1]) { pun[0][0] = pun[1][0]; pun[0][1] = pun[1][1]; } if (pun[0][0] < pun[1][0]) { pun[0][0] = pun[1][0]; pun[0][1] = pun[1][1]; } nr1 = 0; for (int i = 1; i < n; i++) { pun[2][0] = mag[i][0]; pun[2][1] = mag[i][1]; pun[3][0] = mag[i][2]; pun[3][1] = mag[i][3]; if (pun[2][0] == pun[3][0] && pun[2][1] < pun[3][1]) { pun[2][0] = pun[3][0]; pun[2][1] = pun[3][1]; } if (pun[2][0] < pun[3][0]) { pun[2][0] = pun[3][0]; pun[2][1] = pun[3][1]; } if (pun[0][0] == pun[2][0] && pun[0][1] > pun[2][1]) { pun[0][0] = pun[2][0]; pun[0][1] = pun[2][1]; nr1 = i; } if (pun[0][0] > pun[2][0]) { pun[0][0] = pun[2][0]; pun[0][1] = pun[2][1]; nr1 = i; } } nrp = nr1; pun[0][0] = mag[nr1][0]; pun[0][1] = mag[nr1][1]; pun[2][0] = pun[0][0] - 1; pun[2][1] = pun[0][1]; for (int i = 0; i < n; i++) { if (i == nr1)continue; if (to[i] == 1)continue; if (sorwek(-502, 0, mag[i][0] - pun[0][0], mag[i][1] - pun[0][1], mag[i][2] - pun[0][0], mag[i][3] - pun[0][1]) == 2) { pun[1][0] = mag[i][2]; pun[1][1] = mag[i][3]; } else { //printf("%d\n", i); pun[1][0] = mag[i][0]; pun[1][1] = mag[i][1]; } if (sorwek(-500, 0, pun[1][0] - pun[0][0], pun[1][1] - pun[0][1], pun[2][0] - pun[0][0], pun[2][1] - pun[0][1]) == 2) { pun[2][0] = pun[1][0]; pun[2][1] = pun[1][1]; nr2 = i; } } nr3 = nr2; pun[3][0] = pun[2][0]; pun[3][1] = pun[2][0]; pun[0][0] = mag[nr1][2]; pun[0][1] = mag[nr1][3]; pun[2][0] = pun[0][0] - 1; pun[2][1] = pun[0][1]; for (int i = 0; i < n; i++) { if (i == nr1)continue; if (to[i] == 1)continue; if (sorwek(-502, 0, mag[i][0] - pun[0][0], mag[i][1] - pun[0][1], mag[i][2] - pun[0][0], mag[i][3] - pun[0][1]) == 2) { pun[1][0] = mag[i][2]; pun[1][1] = mag[i][3]; } else { //printf("%d\n", i); pun[1][0] = mag[i][0]; pun[1][1] = mag[i][1]; } if (sorwek(-500, 0, pun[1][0] - pun[0][0], pun[1][1] - pun[0][1], pun[2][0] - pun[0][0], pun[2][1] - pun[0][1]) == 2) { pun[2][0] = pun[1][0]; pun[2][1] = pun[1][1]; nr2 = i; } } if (sorwek(-1, 0, pun[3][0] - mag[nr1][0], pun[3][1] - mag[nr1][1], pun[2][0] - mag[nr1][2], pun[2][1] - mag[nr1][3]) == 2) { nr2 = nr3; pun[2][0] = pun[3][0]; pun[2][1] = pun[3][1]; pun[0][0] = mag[nr1][0]; pun[0][1] = mag[nr1][1]; } else { pun[0][0] = mag[nr1][2]; pun[0][1] = mag[nr1][3]; } prost[0].push_back(pun[0][0]); prost[1].push_back(pun[0][1]); prost[2].push_back(pun[2][0]); prost[3].push_back(pun[2][1]); kom.push_back(nr1); kom.push_back(nr2); for (int j = 0; nr2 != nrp; j++) { nr1 = nr2; to[nr1] = 1; pun[0][0] = mag[nr1][0]; pun[0][1] = mag[nr1][1]; pun[2][0] = pun[0][0]; pun[2][1] = pun[0][1]; for (int i = 0; i < n; i++) { if (to[i] == 1)continue; if (sorwek(prost[2][j] - prost[0][j], prost[1][j] - prost[1][j], mag[i][0] - pun[0][0], mag[i][1] - pun[0][1], mag[i][2] - pun[0][0], mag[i][3] - pun[0][1]) == 2) { pun[1][0] = mag[i][2]; pun[1][1] = mag[i][3]; } else { //printf("%d\n", i); pun[1][0] = mag[i][0]; pun[1][1] = mag[i][1]; } if (sorwek(prost[2][j] - prost[0][j], prost[1][j] - prost[1][j], pun[1][0] - pun[0][0], pun[1][1] - pun[0][1], pun[2][0] - pun[0][0], pun[2][1] - pun[0][1]) == 2) { pun[2][0] = pun[1][0]; pun[2][1] = pun[1][1]; nr2 = i; } } nr3 = nr2; pun[3][0] = pun[2][0]; pun[3][1] = pun[2][1]; pun[0][0] = mag[nr1][2]; pun[0][1] = mag[nr1][3]; pun[2][0] = pun[0][0]; pun[2][1] = pun[0][1]; for (int i = 0; i < n; i++) { if (to[i] == 1)continue; if (sorwek(prost[2][j] - prost[0][j], prost[1][j] - prost[1][j], mag[i][0] - pun[0][0], mag[i][1] - pun[0][1], mag[i][2] - pun[0][0], mag[i][3] - pun[0][1]) == 2) { pun[1][0] = mag[i][2]; pun[1][1] = mag[i][3]; } else { //printf("%d\n", i); pun[1][0] = mag[i][0]; pun[1][1] = mag[i][1]; } if (sorwek(prost[2][j] - prost[0][j], prost[1][j] - prost[1][j], pun[1][0] - pun[0][0], pun[1][1] - pun[0][1], pun[2][0] - pun[0][0], pun[2][1] - pun[0][1]) == 2) { pun[2][0] = pun[1][0]; pun[2][1] = pun[1][1]; nr2 = i; } } if (sorwek(prost[2][j] - prost[0][j], prost[1][j] - prost[1][j], pun[3][0] - mag[nr1][0], pun[3][1] - mag[nr1][1], pun[2][0] - mag[nr1][2], pun[2][1] - mag[nr1][3]) == 2) { //printf("."); nr2 = nr3; pun[2][0] = pun[3][0]; pun[2][1] = pun[3][1]; pun[0][0] = mag[nr1][0]; pun[0][1] = mag[nr1][1]; } else { pun[0][0] = mag[nr1][2]; pun[0][1] = mag[nr1][3]; } prost[0].push_back(pun[0][0]); prost[1].push_back(pun[0][1]); prost[2].push_back(pun[2][0]); //printf("%d",pun[2][1]); prost[3].push_back(pun[2][1]); kom.push_back(nr2); if (j > n + 2) { printf("0.000000000"); return 0; } } si = prost[0].size(); for (int j = 1; j < n; j++) { if (prost[0][j] == prost[2][j - 1] && prost[1][j] == prost[3][j - 1])continue; dob1 = polet(prost[0][j - 1], prost[1][j - 1], prost[0][j], prost[1][j], prost[2][j], prost[3][j]); dob2 = polet(prost[2][j - 1], prost[3][j - 1], prost[0][j], prost[1][j], prost[2][j], prost[3][j]); dob3 = dob1 / (dob1 + dob2); dob1 = (prost[2][j - 1] - prost[0][j - 1])*dob3 + prost[0][j - 1]; dob2 = (prost[3][j - 1] - prost[1][j - 1])*dob3 + prost[1][j - 1]; prost[2][j - 1] = dob1; prost[3][j - 1] = dob2; prost[0][j] = dob1; prost[1][j] = dob2; } if (prost[0][0] != prost[2][si - 1] || prost[1][0] != prost[3][si - 1]) { dob1 = polet(prost[0][si - 1], prost[1][si - 1], prost[0][0], prost[1][0], prost[2][0], prost[3][0]); dob2 = polet(prost[2][si - 1], prost[3][si - 1], prost[0][0], prost[1][0], prost[2][0], prost[3][0]); dob3 = dob1 / (dob1 + dob2); dob1 = (prost[2][si - 1] - prost[0][si - 1])*dob3 + prost[0][si - 1]; dob2 = (prost[3][si - 1] - prost[1][si - 1])*dob3 + prost[1][si - 1]; prost[2][si - 1] = dob1; prost[3][si - 1] = dob2; prost[0][0] = dob1; prost[1][0] = dob2; } for (int i = 2; i < si; i++) { //printf("%Lf %Lf\n", prost[0][i], prost[1][i]); wyn += polet(prost[0][0], prost[1][0], prost[0][i - 1], prost[1][i - 1], prost[0][i], prost[1][i]); } printf("%.10Lf\n", wyn); //printf("%Lf",dob); /*for (int i = 0; i < prost[0].size(); i++) { printf("%d %d %d %d %d\n", prost[0][i], prost[1][i], prost[2][i], prost[3][i], kom[i +1]); }*/ //printf("%d %d %d %d %d %d ",nr1, pun[0][0], pun[0][1] , nr2,pun[2][0],pun[2][1]); //printf("\n%d %d %d", pun[0][0], pun[0][1], nr1); //system("PAUSE"); } |