#include <cstdio> #include <algorithm> #include <vector> const int INF = 2000000000; class Quad{ public: Quad(): i(-1), x(), y(), w(INF) {} Quad(int i, int x, int y): i(i), x(x), y(y), w(INF) {} int i; int x; int y; int w; int score() const { return x + y; } long long int area() const { return static_cast<long long int>(w) * static_cast<long long int>(w); } bool operator< (const Quad &b) const { int as = score(); int bs = b.score(); if (as != bs) { return as > bs; } else { return x > b.x; } } void shrink_width(int x2, int y2, int w2) { int best_w = w; if (x2 + w2 <= x || y2 + w2 <= y) { return; } int deltax = std::abs(x - x2); int deltay = std::abs(y - y2); if (deltax > 0) { best_w = std::min(best_w, deltax); } if (deltay > 0) { best_w = std::min(best_w, deltay); } w = best_w; } }; void load_and_solve_quads() { fprintf(stderr, "start\n"); int n, x, y; std::vector<Quad> quads; std::vector<int> widths; scanf("%d", &n); if (n == 1) { printf("TAK 1\n"); return; } quads.resize(n); widths.resize(n); for (int i = 0; i < n; ++i) { scanf("%d", &x); scanf("%d", &y); quads[i] = Quad(i, x, y); } int min_x = INF; int min_y = INF; std::sort(quads.begin(), quads.end()); for (int i = 0; i < n; ++i) { Quad &q = quads[i]; min_x = std::min(min_x, q.x); min_y = std::min(min_y, q.y); fprintf(stderr, "processing %d %d\n", q.x, q.y); q.w = INF; for (int j = 0; j < i; ++j) { Quad &q2 = quads[j]; q.shrink_width(q2.x, q2.y, q2.w); } fprintf(stderr, "assigned %d\n", q.w); } int max_x = 0; int max_y = 0; for (int i = 1; i < n; ++i) { Quad &q = quads[i]; max_x = std::max(max_x, q.x + q.w); max_y = std::max(max_y, q.y + q.w); } fprintf(stderr, "%d %d %d %d\n", min_x, min_y, max_x, max_y); Quad &first_q = quads[0]; first_q.shrink_width(max_x, max_y, INF); max_x = std::max(max_x, first_q.x + first_q.w); max_y = std::max(max_y, first_q.y + first_q.w); fprintf(stderr, "%d %d %d %d\n", min_x, min_y, max_x, max_y); fprintf(stderr, "assigned %d to first\n", first_q.w); long long int total_area = static_cast<long long int>(max_x - min_x) * static_cast<long long int>(max_y - min_y); long long int summed_area = 0; for (int i = 0; i < n; ++i) { summed_area += quads[i].area(); } fprintf(stderr, "areas %d %d\n", total_area, summed_area); fprintf(stderr, "n %d\n", n); for (int i = 0; i < n; ++i) { Quad &q = quads[i]; widths[q.i] = q.w; } fprintf(stderr, "widths"); for (int i = 0; i < n; ++i) { fprintf(stderr, " %d", widths[i]); } fprintf(stderr, "\n"); if (summed_area != total_area) { printf("NIE\n"); return; } printf("TAK"); for (int i = 0; i < n; ++i) { printf(" %d", widths[i]); } printf("\n"); } int main() { int t; scanf("%d", &t); for (int j = 0; j < t; ++j) { load_and_solve_quads(); } }
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 | #include <cstdio> #include <algorithm> #include <vector> const int INF = 2000000000; class Quad{ public: Quad(): i(-1), x(), y(), w(INF) {} Quad(int i, int x, int y): i(i), x(x), y(y), w(INF) {} int i; int x; int y; int w; int score() const { return x + y; } long long int area() const { return static_cast<long long int>(w) * static_cast<long long int>(w); } bool operator< (const Quad &b) const { int as = score(); int bs = b.score(); if (as != bs) { return as > bs; } else { return x > b.x; } } void shrink_width(int x2, int y2, int w2) { int best_w = w; if (x2 + w2 <= x || y2 + w2 <= y) { return; } int deltax = std::abs(x - x2); int deltay = std::abs(y - y2); if (deltax > 0) { best_w = std::min(best_w, deltax); } if (deltay > 0) { best_w = std::min(best_w, deltay); } w = best_w; } }; void load_and_solve_quads() { fprintf(stderr, "start\n"); int n, x, y; std::vector<Quad> quads; std::vector<int> widths; scanf("%d", &n); if (n == 1) { printf("TAK 1\n"); return; } quads.resize(n); widths.resize(n); for (int i = 0; i < n; ++i) { scanf("%d", &x); scanf("%d", &y); quads[i] = Quad(i, x, y); } int min_x = INF; int min_y = INF; std::sort(quads.begin(), quads.end()); for (int i = 0; i < n; ++i) { Quad &q = quads[i]; min_x = std::min(min_x, q.x); min_y = std::min(min_y, q.y); fprintf(stderr, "processing %d %d\n", q.x, q.y); q.w = INF; for (int j = 0; j < i; ++j) { Quad &q2 = quads[j]; q.shrink_width(q2.x, q2.y, q2.w); } fprintf(stderr, "assigned %d\n", q.w); } int max_x = 0; int max_y = 0; for (int i = 1; i < n; ++i) { Quad &q = quads[i]; max_x = std::max(max_x, q.x + q.w); max_y = std::max(max_y, q.y + q.w); } fprintf(stderr, "%d %d %d %d\n", min_x, min_y, max_x, max_y); Quad &first_q = quads[0]; first_q.shrink_width(max_x, max_y, INF); max_x = std::max(max_x, first_q.x + first_q.w); max_y = std::max(max_y, first_q.y + first_q.w); fprintf(stderr, "%d %d %d %d\n", min_x, min_y, max_x, max_y); fprintf(stderr, "assigned %d to first\n", first_q.w); long long int total_area = static_cast<long long int>(max_x - min_x) * static_cast<long long int>(max_y - min_y); long long int summed_area = 0; for (int i = 0; i < n; ++i) { summed_area += quads[i].area(); } fprintf(stderr, "areas %d %d\n", total_area, summed_area); fprintf(stderr, "n %d\n", n); for (int i = 0; i < n; ++i) { Quad &q = quads[i]; widths[q.i] = q.w; } fprintf(stderr, "widths"); for (int i = 0; i < n; ++i) { fprintf(stderr, " %d", widths[i]); } fprintf(stderr, "\n"); if (summed_area != total_area) { printf("NIE\n"); return; } printf("TAK"); for (int i = 0; i < n; ++i) { printf(" %d", widths[i]); } printf("\n"); } int main() { int t; scanf("%d", &t); for (int j = 0; j < t; ++j) { load_and_solve_quads(); } } |