結果
問題 | No.961 Vibrant Fillumination |
ユーザー | kopricky |
提出日時 | 2019-12-08 02:12:17 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 757 ms / 5,000 ms |
コード長 | 5,129 bytes |
コンパイル時間 | 1,020 ms |
コンパイル使用メモリ | 87,332 KB |
実行使用メモリ | 119,792 KB |
最終ジャッジ日時 | 2023-08-30 21:00:35 |
合計ジャッジ時間 | 30,517 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
8,080 KB |
testcase_01 | AC | 2 ms
8,032 KB |
testcase_02 | AC | 381 ms
58,768 KB |
testcase_03 | AC | 390 ms
58,888 KB |
testcase_04 | AC | 396 ms
58,880 KB |
testcase_05 | AC | 404 ms
58,852 KB |
testcase_06 | AC | 386 ms
58,892 KB |
testcase_07 | AC | 392 ms
58,848 KB |
testcase_08 | AC | 389 ms
58,856 KB |
testcase_09 | AC | 391 ms
58,856 KB |
testcase_10 | AC | 754 ms
114,320 KB |
testcase_11 | AC | 754 ms
116,780 KB |
testcase_12 | AC | 754 ms
114,328 KB |
testcase_13 | AC | 743 ms
114,680 KB |
testcase_14 | AC | 752 ms
113,404 KB |
testcase_15 | AC | 725 ms
114,412 KB |
testcase_16 | AC | 743 ms
115,704 KB |
testcase_17 | AC | 722 ms
115,660 KB |
testcase_18 | AC | 757 ms
114,728 KB |
testcase_19 | AC | 750 ms
113,152 KB |
testcase_20 | AC | 749 ms
113,936 KB |
testcase_21 | AC | 725 ms
115,236 KB |
testcase_22 | AC | 732 ms
113,316 KB |
testcase_23 | AC | 719 ms
113,804 KB |
testcase_24 | AC | 727 ms
112,604 KB |
testcase_25 | AC | 753 ms
114,604 KB |
testcase_26 | AC | 239 ms
58,908 KB |
testcase_27 | AC | 441 ms
111,292 KB |
testcase_28 | AC | 238 ms
58,716 KB |
testcase_29 | AC | 519 ms
119,244 KB |
testcase_30 | AC | 523 ms
119,712 KB |
testcase_31 | AC | 419 ms
119,720 KB |
testcase_32 | AC | 421 ms
119,792 KB |
testcase_33 | AC | 3 ms
8,076 KB |
testcase_34 | AC | 566 ms
88,788 KB |
testcase_35 | AC | 458 ms
73,232 KB |
testcase_36 | AC | 452 ms
65,408 KB |
testcase_37 | AC | 450 ms
65,368 KB |
testcase_38 | AC | 429 ms
65,372 KB |
testcase_39 | AC | 438 ms
64,660 KB |
testcase_40 | AC | 419 ms
61,728 KB |
testcase_41 | AC | 432 ms
61,476 KB |
testcase_42 | AC | 425 ms
61,512 KB |
testcase_43 | AC | 431 ms
61,512 KB |
testcase_44 | AC | 441 ms
61,500 KB |
testcase_45 | AC | 434 ms
61,544 KB |
testcase_46 | AC | 448 ms
61,500 KB |
testcase_47 | AC | 435 ms
60,128 KB |
testcase_48 | AC | 438 ms
61,512 KB |
testcase_49 | AC | 446 ms
61,508 KB |
ソースコード
#include <iostream> #include <vector> #include <algorithm> #include <numeric> #include <cmath> #include <cstring> const int MAX_N = 50003; const int MAX_Q = 50003; const int WIDTH = 800; const int LEN = 2 * MAX_N / WIDTH + 1; struct info { int lower, upper, color; info(){} info(const int _lower, const int _upper, const int _color) : lower(_lower), upper(_upper), color(_color){} }; info xborder[2 * MAX_N], yborder[2 * MAX_N]; unsigned long long h[MAX_N], memo[LEN][LEN]; unsigned short cnt[LEN][LEN][2 * WIDTH], kp[2 * WIDTH], trans[MAX_N]; std::vector<unsigned short> color_table[LEN][LEN]; int X[2 * MAX_N], Y[2 * MAX_N], C[MAX_N]; bool used[MAX_N]; int N, Q; void transform_rectangle(){ std::vector<std::vector<int> > tmp(N); std::vector<int> idX(2 * N, 0), idY(2 * N, 0); for(int i = 0; i < N; ++i){ int a, b, c, d, e; std::cin >> a >> b >> c >> d >> e; X[2 * i] = a, X[2 * i + 1] = c, Y[2 * i] = b, Y[2 * i + 1] = d; tmp[i] = {a, b, c, d, e}; } std::sort(X, X + 2 * N), std::sort(Y, Y + 2 * N); for(const std::vector<int>& in : tmp){ const int a = std::lower_bound(X, X + 2 * N, in[0]) - X + idX[in[0]]++; const int b = std::lower_bound(Y, Y + 2 * N, in[1]) - Y + idY[in[1]]++; const int c = std::lower_bound(X, X + 2 * N, in[2]) - X + idX[in[2]]++; const int d = std::lower_bound(Y, Y + 2 * N, in[3]) - Y + idY[in[3]]++; const int e = in[4]; xborder[a] = {b, d, e}, xborder[c] = {b, d, -e}, yborder[b] = {a, c, e}, yborder[d] = {a, c, -e}; } } void pre_calc(){ unsigned long long cur_hash = 0; int curx = -1, cury = -1; const int length = (2 * N - 2) / WIDTH + 1; for(int i = 0; i < length; ++i){ for(int j = 0; j < length; ++j){ std::vector<int> color; auto& ct = color_table[i][j]; const int stx = i * WIDTH + 1, sty = j * WIDTH + 1; for(int curx = stx; curx < std::min((i + 1) * WIDTH, 2 * N - 1); ++curx){ const int c = xborder[curx].color; if(c > 0){ if(!used[c]) ct.push_back(c), used[c] = true; }else{ if(!used[-c]) ct.push_back(-c), used[-c] = true; } } for(int cury = sty; cury < std::min((j + 1) * WIDTH, 2 * N - 1); ++cury){ const int c = yborder[cury].color; if(c > 0){ if(!used[c]) ct.push_back(c), used[c] = true; }else{ if(!used[-c]) ct.push_back(-c), used[-c] = true; } } for(const int c : ct) used[c] = false; } } for(int i = 0; i < length; ++i){ memset(C, 0, sizeof(C)), cur_hash = 0, curx = i * WIDTH, cury = -1; for(int j = 0; j < length; ++j){ while(cury < j * WIDTH){ ++cury; if(yborder[cury].lower <= curx && curx < yborder[cury].upper){ const int c = yborder[cury].color; if(c > 0){ if(++C[c] == 1) cur_hash ^= h[c]; }else{ if(--C[-c] == 0) cur_hash ^= h[-c]; } } } memo[i][j] = cur_hash; for(int k = 0; k < (int)color_table[i][j].size(); ++k){ cnt[i][j][k] = C[color_table[i][j][k]]; } } } } unsigned long long query(const int p, const int q){ const int x = std::upper_bound(X, X + 2 * N, p) - X - 1; const int y = std::upper_bound(Y, Y + 2 * N, q) - Y - 1; if(x < 0 || x >= 2 * N - 1 || y < 0 || y >= 2 * N - 1) return 0ULL; const int zx = x / WIDTH, zy = y / WIDTH; unsigned long long cur_hash = memo[zx][zy]; auto ct = color_table[zx][zy]; for(int i = 0; i < (int)ct.size(); ++i){ kp[trans[ct[i]] = i] = cnt[zx][zy][i]; } const int stx = zx * WIDTH + 1, sty = zy * WIDTH + 1; int curx = stx - 1, cury = sty - 1; while(curx < x){ ++curx; if(xborder[curx].lower <= cury && cury < xborder[curx].upper){ const int c = xborder[curx].color; if(c > 0){ if(++kp[trans[c]] == 1) cur_hash ^= h[c]; }else{ if(--kp[trans[-c]] == 0) cur_hash ^= h[-c]; } } } while(cury < y){ ++cury; if(yborder[cury].lower <= curx && curx < yborder[cury].upper){ const int c = yborder[cury].color; if(c > 0){ if(++kp[trans[c]] == 1) cur_hash ^= h[c]; }else{ if(--kp[trans[-c]] == 0) cur_hash ^= h[-c]; } } } return cur_hash; } int main() { std::cin.tie(0); std::ios::sync_with_stdio(false); std::cin >> N; for(int i = 1; i <= N; ++i){ std::cin >> h[i]; } transform_rectangle(); std::cin >> Q; pre_calc(); for(int i = 0; i < Q; ++i){ int p, q; std::cin >> p >> q; std::cout << query(p, q) << "\n"; } return 0; }