fork download
  1. #include <stdio.h>
  2. #include <math.h>
  3.  
  4. typedef struct {
  5. int x, y;
  6. } Point;
  7.  
  8. int main() {
  9. int err, n;
  10. scanf("%d", &err);
  11. scanf("%d", &n);
  12.  
  13. Point target, hide_sites[n];
  14. scanf("%d %d", &target.x, &target.y);
  15.  
  16. for (int i = 0; i < n; ++i) {
  17. scanf("%d %d", &hide_sites[i].x, &hide_sites[i].y);
  18. }
  19.  
  20. int min_head_error = 99999;
  21. int head_index = -1;
  22. int min_torso_error = 99999;
  23. int torso_index1 = -1, torso_index2 = -1;
  24.  
  25. for (int i = 0; i < n; ++i) {
  26. int distance_square = (hide_sites[i].x - target.x) * (hide_sites[i].x - target.x) +
  27. (hide_sites[i].y - target.y) * (hide_sites[i].y - target.y);
  28. int error = sqrt(distance_square);
  29.  
  30. if (error <= min_head_error) {
  31. min_head_error = error;
  32. head_index = i;
  33. }
  34.  
  35. if (error <= min_torso_error) {
  36. min_torso_error = error;
  37. torso_index2 = torso_index1;
  38. torso_index1 = i;
  39. }
  40. }
  41.  
  42. int error = 0;
  43. int target_width = 0;
  44.  
  45. if (min_head_error <= 1000) {
  46. target_width = 15;
  47. } else if (min_torso_error <= 2000) {
  48. target_width = 35;
  49. }
  50.  
  51. if (target_width > 0) {
  52. error = (target_width * 100) / min_head_error;
  53. }
  54.  
  55. if (target_width == 15) {
  56. printf("%d\n", head_index);
  57. } else if (target_width == 35) {
  58. printf("%d %d\n", torso_index1, torso_index2);
  59. } else {
  60. printf("abort\n");
  61. }
  62.  
  63. return 0;
  64. }
Success #stdin #stdout 0.01s 5440KB
stdin
20
3
0 0
-500 1500
1000 200
3000 1000
stdout
1 0