#include using namespace std; struct line { int xi, yi, xe, ye, w; }; const int MX = 3e5, BUK = 550; vector buk_x[BUK], buk_y[BUK]; line arr[MX]; pair qry[MX]; bool deleted[MX]; int n, k, l; void init() { cin >> n >> k >> l; map x, y; for(int i=0; i> arr[i].xi >> arr[i].yi >> arr[i].xe >> arr[i].ye >> arr[i].w; x[arr[i].xi] = 0; x[arr[i].xe] = 0; y[arr[i].yi] = 0; y[arr[i].ye] = 0; deleted[i] = 0; } for(int i=0; i> qry[i].first >> qry[i].second; if(qry[i].second) { x[qry[i].first] = 0; } else { y[qry[i].first] = 0; } } int p = 0; for(auto& pr: x) pr.second = p++; p = 0; for(auto& pr: y) pr.second = p++; for(int i=0; i arr[i].xe) swap(arr[i].xi, arr[i].xe); if(arr[i].yi > arr[i].ye) swap(arr[i].yi, arr[i].ye); } for(int i=0; i arr[b].xe; }); sort(buk_y[i].begin(), buk_y[i].end(), [&](int a, int b){ return arr[a].ye > arr[b].ye; }); } } int rmcnt; void solve() { init(); build(); rmcnt = 0; for(int t=0; t BUK) { build(); rmcnt = 0; } } } int main() { ios::sync_with_stdio(0);cin.tie(0); int t; cin >> t; while(t--) solve(); }

코드 #3618