#include <bits/stdc++.h> using namespace std; #define REP(i,a,b) for (int i = (a); i <= (b); ++i) #define REPD(i,a,b) for (int i = (a); i >= (b); --i) #define FORI(i,n) REP(i,1,n) #define FOR(i,n) REP(i,0,int(n)-1) #define mp make_pair #define pb push_back #define pii pair<int,int> #define vi vector<int> #define ll long long #define SZ(x) int((x).size()) #define DBG(v) cerr << #v << " = " << (v) << endl; #define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++) #define fi first #define se second const int N = 2020; int n; int x[N], y[N], siz[N]; pair<pii, int> t[N]; set<pii> tr; void tr_add(int lo, int hi) { //printf("adding %d %d\n", lo, hi); tr.insert(mp(lo, hi)); } void tr_remove(int lo, int hi) { //printf("removing %d %d\n", lo, hi); tr.erase(tr.find(mp(lo,hi))); } int max_up(int pos) { //for (set<pii>::iterator it=tr.begin(); it!=tr.end(); it++) printf("[%d %d] ", it->fi, it->se);printf("\n"); set<pii> :: iterator it = tr.lower_bound(mp(pos,2e9)); if (it == tr.end()) return -1; int ret = it->fi; if (it != tr.begin()) { it--; if (it->se > pos) return -2; } return ret; } int xmax; bool solve(int ymax) { //printf("solve %d\n", ymax); xmax = 0; int j=0; tr.clear(); tr_add(ymax, ymax); priority_queue<pair<int,pii>> rmv; FOR(i,n) { int cx=t[i].fi.fi, cy=t[i].fi.se, ci = t[i].se; if (i>0 && t[i-1].fi.fi != cx) { while (!rmv.empty() && -rmv.top().fi <= cx) { pii tmp = rmv.top().se; rmv.pop(); tr_remove(tmp.fi, tmp.se); j++; } } int up = max_up(cy); //printf("%d (%d %d) getting size %d-%d=%d\n", t[i].se, t[i].fi.fi, t[i].fi.se, up, cy, up-cy); if (up<0) return false; siz[ci] = up-cy; xmax = max(xmax, cx+siz[ci]); tr_add(cy, up); //printf("add to remove %d %d at time %d\n", cy, up, cx+siz[ci]); rmv.push(mp(-(cx+siz[ci]), mp(cy, up))); } ll area = 1LL * xmax * ymax; //printf("area=%d*%d=%lld\n", xmax, ymax, area); FOR(i,n) area -= 1LL * siz[t[i].se] * siz[t[i].se]; //printf("area new = %lld\n", area); if (area != 0) return false; FOR(ii,n) FOR(jj,ii) { int i = t[ii].se, j = t[jj].se; if ( ((x[i] <= x[j] && x[j] < x[i]+siz[i]) || (x[j] <= x[i] && x[i] < x[j]+siz[j])) && ((y[i] <= y[j] && y[j] < y[i]+siz[i]) || (y[j] <= y[i] && y[i] < y[j]+siz[j]))) return false; } return true; } bool solve_st(int ymax, int stpt) { //printf("solve %d %d\n", ymax, stpt); if (stpt==1) { t[n] = t[0]; for (int i=1; i<n; i++) t[i-1] = t[i]; t[n-1] = t[n]; n--; } bool ret = solve(ymax); if (stpt==1) { n++; siz[t[n-1].se] = xmax; for (int i=1; i<n; i++) t[i] = t[i-1]; t[0] = t[n]; } return ret; } void test() { scanf("%d", &n); int minx = 2e9, miny = 2e9; FOR(i,n) { scanf("%d%d", &x[i], &y[i]); minx = min(minx, x[i]); miny = min(miny, y[i]); } bool fnd = false; FOR(i,n) { x[i] -= minx; y[i] -= miny; t[i] = mp(mp(x[i], -y[i]), i); if (x[i] == 0 && y[i] == 0) fnd = true; } if (!fnd) { printf("NIE\n"); return; } sort(t,t+n); FOR(i,n) t[i].fi.se *= -1; //FOR(i,n) printf("%d %d\n", t[i].fi.fi, t[i].fi.se); bool bnd = false; for (int i = 1; i < n; i++) { if (t[i].fi.fi != t[i-1].fi.fi) { if (solve_st(t[0].fi.se+t[i].fi.fi, 0)) { printf("TAK"); FOR(i,n) printf(" %d", siz[i]); printf("\n"); return; } } if (t[i].fi.se >= t[0].fi.se) { bnd = true; break; } } if (!bnd) { if (solve_st(t[0].fi.se, 1)) { printf("TAK"); FOR(i,n) printf(" %d", siz[i]); printf("\n"); return; } } printf("NIE\n"); } int main() { int tt; scanf("%d", &tt); while (tt--) test(); return 0; }
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 | #include <bits/stdc++.h> using namespace std; #define REP(i,a,b) for (int i = (a); i <= (b); ++i) #define REPD(i,a,b) for (int i = (a); i >= (b); --i) #define FORI(i,n) REP(i,1,n) #define FOR(i,n) REP(i,0,int(n)-1) #define mp make_pair #define pb push_back #define pii pair<int,int> #define vi vector<int> #define ll long long #define SZ(x) int((x).size()) #define DBG(v) cerr << #v << " = " << (v) << endl; #define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++) #define fi first #define se second const int N = 2020; int n; int x[N], y[N], siz[N]; pair<pii, int> t[N]; set<pii> tr; void tr_add(int lo, int hi) { //printf("adding %d %d\n", lo, hi); tr.insert(mp(lo, hi)); } void tr_remove(int lo, int hi) { //printf("removing %d %d\n", lo, hi); tr.erase(tr.find(mp(lo,hi))); } int max_up(int pos) { //for (set<pii>::iterator it=tr.begin(); it!=tr.end(); it++) printf("[%d %d] ", it->fi, it->se);printf("\n"); set<pii> :: iterator it = tr.lower_bound(mp(pos,2e9)); if (it == tr.end()) return -1; int ret = it->fi; if (it != tr.begin()) { it--; if (it->se > pos) return -2; } return ret; } int xmax; bool solve(int ymax) { //printf("solve %d\n", ymax); xmax = 0; int j=0; tr.clear(); tr_add(ymax, ymax); priority_queue<pair<int,pii>> rmv; FOR(i,n) { int cx=t[i].fi.fi, cy=t[i].fi.se, ci = t[i].se; if (i>0 && t[i-1].fi.fi != cx) { while (!rmv.empty() && -rmv.top().fi <= cx) { pii tmp = rmv.top().se; rmv.pop(); tr_remove(tmp.fi, tmp.se); j++; } } int up = max_up(cy); //printf("%d (%d %d) getting size %d-%d=%d\n", t[i].se, t[i].fi.fi, t[i].fi.se, up, cy, up-cy); if (up<0) return false; siz[ci] = up-cy; xmax = max(xmax, cx+siz[ci]); tr_add(cy, up); //printf("add to remove %d %d at time %d\n", cy, up, cx+siz[ci]); rmv.push(mp(-(cx+siz[ci]), mp(cy, up))); } ll area = 1LL * xmax * ymax; //printf("area=%d*%d=%lld\n", xmax, ymax, area); FOR(i,n) area -= 1LL * siz[t[i].se] * siz[t[i].se]; //printf("area new = %lld\n", area); if (area != 0) return false; FOR(ii,n) FOR(jj,ii) { int i = t[ii].se, j = t[jj].se; if ( ((x[i] <= x[j] && x[j] < x[i]+siz[i]) || (x[j] <= x[i] && x[i] < x[j]+siz[j])) && ((y[i] <= y[j] && y[j] < y[i]+siz[i]) || (y[j] <= y[i] && y[i] < y[j]+siz[j]))) return false; } return true; } bool solve_st(int ymax, int stpt) { //printf("solve %d %d\n", ymax, stpt); if (stpt==1) { t[n] = t[0]; for (int i=1; i<n; i++) t[i-1] = t[i]; t[n-1] = t[n]; n--; } bool ret = solve(ymax); if (stpt==1) { n++; siz[t[n-1].se] = xmax; for (int i=1; i<n; i++) t[i] = t[i-1]; t[0] = t[n]; } return ret; } void test() { scanf("%d", &n); int minx = 2e9, miny = 2e9; FOR(i,n) { scanf("%d%d", &x[i], &y[i]); minx = min(minx, x[i]); miny = min(miny, y[i]); } bool fnd = false; FOR(i,n) { x[i] -= minx; y[i] -= miny; t[i] = mp(mp(x[i], -y[i]), i); if (x[i] == 0 && y[i] == 0) fnd = true; } if (!fnd) { printf("NIE\n"); return; } sort(t,t+n); FOR(i,n) t[i].fi.se *= -1; //FOR(i,n) printf("%d %d\n", t[i].fi.fi, t[i].fi.se); bool bnd = false; for (int i = 1; i < n; i++) { if (t[i].fi.fi != t[i-1].fi.fi) { if (solve_st(t[0].fi.se+t[i].fi.fi, 0)) { printf("TAK"); FOR(i,n) printf(" %d", siz[i]); printf("\n"); return; } } if (t[i].fi.se >= t[0].fi.se) { bnd = true; break; } } if (!bnd) { if (solve_st(t[0].fi.se, 1)) { printf("TAK"); FOR(i,n) printf(" %d", siz[i]); printf("\n"); return; } } printf("NIE\n"); } int main() { int tt; scanf("%d", &tt); while (tt--) test(); return 0; } |