#include <bits/stdc++.h> using namespace std; struct punkt { int x, y, id, odgory, odlewej, oddolu, bok; }; bool compxy(punkt a, punkt b) { if(a.x==b.x) return a.y<b.y; return a.x<b.x; } bool compid(punkt a, punkt b) { return a.id<b.id; } long long odleglosc(punkt a, punkt b) { return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y); } int n; int t; vector<punkt> p; const int I=1500000000; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> t; for(int T=0; T<t; T++) { cin >> n; for(int i=1; i<=n; i++) { int a, b; cin >> a >> b; p.push_back(punkt{a, b, i, I, I, I}); } if(n==1) { cout << "TAK 69\n"; continue; } sort(p.begin(), p.end(), compxy); int poczx = p[0].x; int poczy = p[0].y; for(int i=0; i<n-1; i++) { // cout << p[i].x << " " << p[i].y << " " << p[i].id << "\n"; p[i].odlewej=p[i].x-poczx; p[i].oddolu=p[i].y-poczy; long long miniodl = I; int miniid = -1; int minix, miniy; for(int j=i+1; j<n; j++) { if(p[j].y>=p[i].y && p[j].x>=p[i].x) { long long odl = odleglosc(p[i], p[j]); if(odl<miniodl) { miniodl = odl; miniid = p[j].id; minix=p[j].x; miniy=p[j].y; } } } if(miniid!=-1) p[i].bok = max(minix-p[i].x, miniy-p[i].y); else p[i].bok = I; // cout << "punkt " << p[i].id << " najblizej ma do punktu " << miniid << " o wspolrzednych " << minix << " " << miniy << " dlugos boku = " << p[i].bok << "\n"; } p[n-1].odlewej=p[n-1].x-poczx; p[n-1].oddolu=p[n-1].y-poczy; p[n-1].odgory=I; p[n-1].bok = I; for(int i=0; i<n-1; i++) { //tworze kwadrat o boku p[i].bok, taki musze stworzyc i bede zaznczal punktom ktore do //niego przylegaja, ze przylegaja if(p[i].bok!=I) { for(int j=i+1; j<n; j++) { if(p[j].x<p[i].x+p[i].bok && p[j].y==p[i].y+p[i].bok) p[j].oddolu=0; if(p[j].y<p[i].y+p[i].bok && p[j].y>=p[i].y && p[j].x==p[i].x+p[i].bok) p[j].odlewej=0; if(p[j].x>p[i].x && p[j].x<p[i].x+p[i].bok && p[j].y<p[i].y) { p[j].odgory=min(p[j].odgory, p[i].y-p[j].y); p[j].bok = min(p[j].bok, p[j].odgory); } } } //a jesli to jest punkt wysuniety w gorny lewy to ustawiam nieskonczona kreche na jego y //iii dzieki temu on bedzie jak gdyby dachem dla wszystkiego else { for(int j=i+1; j<n; j++) { if(p[j].x>p[i].x && p[j].y<p[i].y) { p[j].odgory=min(p[j].odgory, p[i].y-p[j].y); p[j].bok = min(p[j].bok, p[j].odgory); } } } } // for(int i=0; i<n; i++) { // cout << p[i].id << " - (" << p[i].x << "," << p[i].y << ") odlewej - " << p[i].odlewej; // cout << " oddolu - " << p[i].oddolu << " odgory - " << p[i].odgory << " bok - " << p[i].bok << "\n"; // } long long pole=0; long long maxszer=-1; long long maxwys=-1; int wyz = -1; for(int i=0; i<n; i++) { // if(p[i].y<p[0].y) { // cout << "NIE\n"; // return 0; // } if(p[i].bok!=I) { maxwys = max((long long)(p[i].y+p[i].bok), maxwys); maxszer = max(maxszer, (long long)(p[i].x+p[i].bok)); } else wyz = i; } // cout << maxwys << " " << maxszer << "\n"; // cout << wyz << "\n"; p[wyz].bok = max(maxwys-p[wyz].y, maxszer-p[wyz].x); // pole+=(long long)(p[wyz].bok*p[wyz].bok); maxwys = max(maxwys, (long long)(p[wyz].y+p[wyz].bok)); maxszer = max(maxszer, (long long)(p[wyz].x+p[wyz].bok)); bool dasie = true; for(int i=0; i<n; i++) { // if(p[i].odlewej!=0 || p[i].oddolu!=0) { // dasie = false; // break; // } pole+=p[i].bok*p[i].bok; } // cout << pole << "\n"; // if(pole == (long long)((maxwys-p[0].y)*(maxszer-p[0].x))) { if(dasie && pole == (maxwys-poczy)*(maxszer-poczx)) { cout << "TAK "; sort(p.begin(), p.end(), compid); for(int i=0; i<n; i++) { cout << p[i].bok << " "; } cout << "\n"; } else { for(int i=0; i<n; i++) { int pom = p[i].x; p[i].x=p[i].y; p[i].y=pom; p[i].odgory=I; p[i].bok=I; } sort(p.begin(), p.end(), compxy); int poczx = p[0].x; int poczy = p[0].y; for(int i=0; i<n-1; i++) { // cout << p[i].x << " " << p[i].y << " " << p[i].id << "\n"; p[i].odlewej=p[i].x-poczx; p[i].oddolu=p[i].y-poczy; long long miniodl = I; int miniid = -1; int minix, miniy; for(int j=i+1; j<n; j++) { if(p[j].y>=p[i].y && p[j].x>=p[i].x) { long long odl = odleglosc(p[i], p[j]); if(odl<miniodl) { miniodl = odl; miniid = p[j].id; minix=p[j].x; miniy=p[j].y; } } } if(miniid!=-1) p[i].bok = max(minix-p[i].x, miniy-p[i].y); else p[i].bok = I; // cout << "punkt " << p[i].id << " najblizej ma do punktu " << miniid << " o wspolrzednych " << minix << " " << miniy << " dlugos boku = " << p[i].bok << "\n"; } p[n-1].odlewej=p[n-1].x-poczx; p[n-1].oddolu=p[n-1].y-poczy; p[n-1].odgory=I; p[n-1].bok = I; for(int i=0; i<n-1; i++) { //tworze kwadrat o boku p[i].bok, taki musze stworzyc i bede zaznczal punktom ktore do //niego przylegaja, ze przylegaja if(p[i].bok!=I) { for(int j=i+1; j<n; j++) { if(p[j].x<p[i].x+p[i].bok && p[j].y==p[i].y+p[i].bok) p[j].oddolu=0; if(p[j].y<p[i].y+p[i].bok && p[j].y>=p[i].y && p[j].x==p[i].x+p[i].bok) p[j].odlewej=0; if(p[j].x>p[i].x && p[j].x<p[i].x+p[i].bok && p[j].y<p[i].y) { p[j].odgory=min(p[j].odgory, p[i].y-p[j].y); p[j].bok = min(p[j].bok, p[j].odgory); } } } //a jesli to jest punkt wysuniety w gorny lewy to ustawiam nieskonczona kreche na jego y //iii dzieki temu on bedzie jak gdyby dachem dla wszystkiego else { for(int j=i+1; j<n; j++) { if(p[j].x>p[i].x && p[j].y<p[i].y) { p[j].odgory=min(p[j].odgory, p[i].y-p[j].y); p[j].bok = min(p[j].bok, p[j].odgory); } } } } // for(int i=0; i<n; i++) { // cout << p[i].id << " - (" << p[i].x << "," << p[i].y << ") odlewej - " << p[i].odlewej; // cout << " oddolu - " << p[i].oddolu << " odgory - " << p[i].odgory << " bok - " << p[i].bok << "\n"; // } long long pole=0; long long maxszer=-1; long long maxwys=-1; int wyz = -1; for(int i=0; i<n; i++) { if(p[i].bok!=I) { // pole+=p[i].bok*p[i].bok; maxwys = max((long long)(p[i].y+p[i].bok), maxwys); maxszer = max(maxszer, (long long)(p[i].x+p[i].bok)); } else wyz = i; } // cout << maxwys << " " << maxszer << "\n"; // cout << wyz << "\n"; p[wyz].bok = max(maxwys-p[wyz].y, maxszer-p[wyz].x); // pole+=(long long)(p[wyz].bok*p[wyz].bok); maxwys = max(maxwys, (long long)(p[wyz].y+p[wyz].bok)); maxszer = max(maxszer, (long long)(p[wyz].x+p[wyz].bok)); bool dasie = true; for(int i=0; i<n; i++) { // if(p[i].odlewej!=0 || p[i].oddolu!=0) { // dasie = false; // break; // } pole+=p[i].bok*p[i].bok; } // cout << pole << "\n"; // if(pole == (long long)((maxwys-p[0].y)*(maxszer-p[0].x))) { if(dasie && pole == (maxwys-poczy)*(maxszer-poczx)) { cout << "TAK "; sort(p.begin(), p.end(), compid); for(int i=0; i<n; i++) { cout << p[i].bok << " "; } cout << "\n"; } else { cout << "NIE\n"; } } p.clear(); } }
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 | #include <bits/stdc++.h> using namespace std; struct punkt { int x, y, id, odgory, odlewej, oddolu, bok; }; bool compxy(punkt a, punkt b) { if(a.x==b.x) return a.y<b.y; return a.x<b.x; } bool compid(punkt a, punkt b) { return a.id<b.id; } long long odleglosc(punkt a, punkt b) { return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y); } int n; int t; vector<punkt> p; const int I=1500000000; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> t; for(int T=0; T<t; T++) { cin >> n; for(int i=1; i<=n; i++) { int a, b; cin >> a >> b; p.push_back(punkt{a, b, i, I, I, I}); } if(n==1) { cout << "TAK 69\n"; continue; } sort(p.begin(), p.end(), compxy); int poczx = p[0].x; int poczy = p[0].y; for(int i=0; i<n-1; i++) { // cout << p[i].x << " " << p[i].y << " " << p[i].id << "\n"; p[i].odlewej=p[i].x-poczx; p[i].oddolu=p[i].y-poczy; long long miniodl = I; int miniid = -1; int minix, miniy; for(int j=i+1; j<n; j++) { if(p[j].y>=p[i].y && p[j].x>=p[i].x) { long long odl = odleglosc(p[i], p[j]); if(odl<miniodl) { miniodl = odl; miniid = p[j].id; minix=p[j].x; miniy=p[j].y; } } } if(miniid!=-1) p[i].bok = max(minix-p[i].x, miniy-p[i].y); else p[i].bok = I; // cout << "punkt " << p[i].id << " najblizej ma do punktu " << miniid << " o wspolrzednych " << minix << " " << miniy << " dlugos boku = " << p[i].bok << "\n"; } p[n-1].odlewej=p[n-1].x-poczx; p[n-1].oddolu=p[n-1].y-poczy; p[n-1].odgory=I; p[n-1].bok = I; for(int i=0; i<n-1; i++) { //tworze kwadrat o boku p[i].bok, taki musze stworzyc i bede zaznczal punktom ktore do //niego przylegaja, ze przylegaja if(p[i].bok!=I) { for(int j=i+1; j<n; j++) { if(p[j].x<p[i].x+p[i].bok && p[j].y==p[i].y+p[i].bok) p[j].oddolu=0; if(p[j].y<p[i].y+p[i].bok && p[j].y>=p[i].y && p[j].x==p[i].x+p[i].bok) p[j].odlewej=0; if(p[j].x>p[i].x && p[j].x<p[i].x+p[i].bok && p[j].y<p[i].y) { p[j].odgory=min(p[j].odgory, p[i].y-p[j].y); p[j].bok = min(p[j].bok, p[j].odgory); } } } //a jesli to jest punkt wysuniety w gorny lewy to ustawiam nieskonczona kreche na jego y //iii dzieki temu on bedzie jak gdyby dachem dla wszystkiego else { for(int j=i+1; j<n; j++) { if(p[j].x>p[i].x && p[j].y<p[i].y) { p[j].odgory=min(p[j].odgory, p[i].y-p[j].y); p[j].bok = min(p[j].bok, p[j].odgory); } } } } // for(int i=0; i<n; i++) { // cout << p[i].id << " - (" << p[i].x << "," << p[i].y << ") odlewej - " << p[i].odlewej; // cout << " oddolu - " << p[i].oddolu << " odgory - " << p[i].odgory << " bok - " << p[i].bok << "\n"; // } long long pole=0; long long maxszer=-1; long long maxwys=-1; int wyz = -1; for(int i=0; i<n; i++) { // if(p[i].y<p[0].y) { // cout << "NIE\n"; // return 0; // } if(p[i].bok!=I) { maxwys = max((long long)(p[i].y+p[i].bok), maxwys); maxszer = max(maxszer, (long long)(p[i].x+p[i].bok)); } else wyz = i; } // cout << maxwys << " " << maxszer << "\n"; // cout << wyz << "\n"; p[wyz].bok = max(maxwys-p[wyz].y, maxszer-p[wyz].x); // pole+=(long long)(p[wyz].bok*p[wyz].bok); maxwys = max(maxwys, (long long)(p[wyz].y+p[wyz].bok)); maxszer = max(maxszer, (long long)(p[wyz].x+p[wyz].bok)); bool dasie = true; for(int i=0; i<n; i++) { // if(p[i].odlewej!=0 || p[i].oddolu!=0) { // dasie = false; // break; // } pole+=p[i].bok*p[i].bok; } // cout << pole << "\n"; // if(pole == (long long)((maxwys-p[0].y)*(maxszer-p[0].x))) { if(dasie && pole == (maxwys-poczy)*(maxszer-poczx)) { cout << "TAK "; sort(p.begin(), p.end(), compid); for(int i=0; i<n; i++) { cout << p[i].bok << " "; } cout << "\n"; } else { for(int i=0; i<n; i++) { int pom = p[i].x; p[i].x=p[i].y; p[i].y=pom; p[i].odgory=I; p[i].bok=I; } sort(p.begin(), p.end(), compxy); int poczx = p[0].x; int poczy = p[0].y; for(int i=0; i<n-1; i++) { // cout << p[i].x << " " << p[i].y << " " << p[i].id << "\n"; p[i].odlewej=p[i].x-poczx; p[i].oddolu=p[i].y-poczy; long long miniodl = I; int miniid = -1; int minix, miniy; for(int j=i+1; j<n; j++) { if(p[j].y>=p[i].y && p[j].x>=p[i].x) { long long odl = odleglosc(p[i], p[j]); if(odl<miniodl) { miniodl = odl; miniid = p[j].id; minix=p[j].x; miniy=p[j].y; } } } if(miniid!=-1) p[i].bok = max(minix-p[i].x, miniy-p[i].y); else p[i].bok = I; // cout << "punkt " << p[i].id << " najblizej ma do punktu " << miniid << " o wspolrzednych " << minix << " " << miniy << " dlugos boku = " << p[i].bok << "\n"; } p[n-1].odlewej=p[n-1].x-poczx; p[n-1].oddolu=p[n-1].y-poczy; p[n-1].odgory=I; p[n-1].bok = I; for(int i=0; i<n-1; i++) { //tworze kwadrat o boku p[i].bok, taki musze stworzyc i bede zaznczal punktom ktore do //niego przylegaja, ze przylegaja if(p[i].bok!=I) { for(int j=i+1; j<n; j++) { if(p[j].x<p[i].x+p[i].bok && p[j].y==p[i].y+p[i].bok) p[j].oddolu=0; if(p[j].y<p[i].y+p[i].bok && p[j].y>=p[i].y && p[j].x==p[i].x+p[i].bok) p[j].odlewej=0; if(p[j].x>p[i].x && p[j].x<p[i].x+p[i].bok && p[j].y<p[i].y) { p[j].odgory=min(p[j].odgory, p[i].y-p[j].y); p[j].bok = min(p[j].bok, p[j].odgory); } } } //a jesli to jest punkt wysuniety w gorny lewy to ustawiam nieskonczona kreche na jego y //iii dzieki temu on bedzie jak gdyby dachem dla wszystkiego else { for(int j=i+1; j<n; j++) { if(p[j].x>p[i].x && p[j].y<p[i].y) { p[j].odgory=min(p[j].odgory, p[i].y-p[j].y); p[j].bok = min(p[j].bok, p[j].odgory); } } } } // for(int i=0; i<n; i++) { // cout << p[i].id << " - (" << p[i].x << "," << p[i].y << ") odlewej - " << p[i].odlewej; // cout << " oddolu - " << p[i].oddolu << " odgory - " << p[i].odgory << " bok - " << p[i].bok << "\n"; // } long long pole=0; long long maxszer=-1; long long maxwys=-1; int wyz = -1; for(int i=0; i<n; i++) { if(p[i].bok!=I) { // pole+=p[i].bok*p[i].bok; maxwys = max((long long)(p[i].y+p[i].bok), maxwys); maxszer = max(maxszer, (long long)(p[i].x+p[i].bok)); } else wyz = i; } // cout << maxwys << " " << maxszer << "\n"; // cout << wyz << "\n"; p[wyz].bok = max(maxwys-p[wyz].y, maxszer-p[wyz].x); // pole+=(long long)(p[wyz].bok*p[wyz].bok); maxwys = max(maxwys, (long long)(p[wyz].y+p[wyz].bok)); maxszer = max(maxszer, (long long)(p[wyz].x+p[wyz].bok)); bool dasie = true; for(int i=0; i<n; i++) { // if(p[i].odlewej!=0 || p[i].oddolu!=0) { // dasie = false; // break; // } pole+=p[i].bok*p[i].bok; } // cout << pole << "\n"; // if(pole == (long long)((maxwys-p[0].y)*(maxszer-p[0].x))) { if(dasie && pole == (maxwys-poczy)*(maxszer-poczx)) { cout << "TAK "; sort(p.begin(), p.end(), compid); for(int i=0; i<n; i++) { cout << p[i].bok << " "; } cout << "\n"; } else { cout << "NIE\n"; } } p.clear(); } } |