제출 #758597

#제출 시각아이디문제언어결과실행 시간메모리
758597scanhexSegments (IZhO18_segments)C++17
75 / 100
4051 ms41620 KiB
#include <bits/stdc++.h> using namespace std; using nagai = long long; struct dss { vector<pair<int,int>> segs; void insert(int l, int r) { segs.push_back({l, r}); } int get(int l, int r, int k) { if (k == 0) return segs.size(); int res = 0; for (auto& x : segs) { int ll = max(x.first, l), rr = min(x.second, r); if (rr - ll + 1 >= k) ++res; } return res; } }; const int oo = 0x3f3f3f3f; struct static1d { vector<int> coords; void clear() { vector<int>{}.swap(coords); } void add(int c) { coords.push_back(c); } void finalize() { } int get(int l, int r) { if (l > r) return 0; auto itr = upper_bound(coords.begin(), coords.end(), r); auto itl = lower_bound(coords.begin(), coords.end(), l); //cerr << "coords\n"; //for(auto& x : coords) //cerr << x << ' '; //cerr << '\n'; //cerr << l << ' ' << r << ' ' << itr - itl << '\n'; return itr - itl; } }; bool ycmp(pair<int, int> a, pair<int, int> b) { if (a.second != b.second) return a.second < b.second; return a.first < b.first; } struct static2d { vector<static1d> v; vector<int> xs; void add(int x, int y) { for (++x; x < v.size(); x = (x | x - 1) + 1) v[x].add(y); } void build(vector<pair<int,int>> pts) { xs.clear(); for (auto& x : v) x.clear(); for (auto& p : pts) xs.push_back(p.first); sort(xs.begin(), xs.end()); xs.erase(unique(xs.begin(), xs.end()), xs.end()); v.resize(xs.size() + 1); for (auto p : pts) { add(lower_bound(xs.begin(), xs.end(), p.first) - xs.begin(), p.second); } for (int i = 0; i < v.size(); ++i) v[i].finalize(); } int get(int xr, int y1, int y2) { ++xr; int xrr = xr; xr = lower_bound(xs.begin(), xs.end(), xr) - xs.begin(); int res = 0; for (; xr; xr &= xr - 1) res += v[xr].get(y1, y2); //cerr << xrr << ' ' << y1 << ' ' << y2 << ' ' << res << '\n'; return res; } // all inclusive int get(int x1, int x2, int y1, int y2) { if (x1 > x2) return 0; return get(x2, y1, y2) - get(x1 - 1, y1, y2); } }; const int BL = 3000; struct rofl2d { vector<pair<int,int>> all; vector<pair<int,int>> block; vector<pair<int,int>> erblock; vector<pair<int, int>> newall; static2d st; void check_rebuild() { if (block.size() + erblock.size() >= BL) { sort(block.begin(), block.end(), ycmp); newall.resize(all.size() + block.size()); merge(all.begin(), all.end(), block.begin(), block.end(), newall.begin(), ycmp); sort(erblock.begin(), erblock.end(), ycmp); all.clear(); int ptr = 0; for (auto x : erblock) { while (ptr < newall.size() && ycmp(newall[ptr], x)) all.push_back(newall[ptr++]); // always true? ++ptr; } while (ptr < newall.size()) all.push_back(newall[ptr++]); block.clear(); erblock.clear(); st.build(all); } } void insert(int x, int y) { block.push_back({x, y}); check_rebuild(); } void erase(int x, int y) { erblock.push_back({x, y}); check_rebuild(); } int get(int x1, int x2, int y1, int y2) { int res = st.get(x1, x2, y1, y2); for (auto p : block) if (x1 <= p.first && p.first <= x2 && y1 <= p.second && p.second <= y2) ++res; for (auto p : erblock) if (x1 <= p.first && p.first <= x2 && y1 <= p.second && p.second <= y2) --res; return res; } }; struct ds { int tot = 0; rofl2d rofl_l, rofl_r; rofl2d rofl_len; void insert(int l, int r) { ++tot; rofl_l.insert(l, r - l); rofl_r.insert(r, r - l); rofl_len.insert(0, r - l); } void erase(int l, int r) { --tot; rofl_l.erase(l, r - l); rofl_r.erase(r, r - l); rofl_len.erase(0, r - l); } int get(int l, int r, int k) { if (r - l + 1 < k) return 0; if (k == 0) return tot; int res = tot; //cerr << "rofl_l" << '\n'; res -= rofl_l.get(r - k + 2, oo, k - 1, oo); //cerr << "rofl_r" << '\n'; res -= rofl_r.get(0, l + k - 2, k - 1, oo); //cerr << "rofl_len" << '\n'; res -= rofl_len.get(0, 0, 0, k - 2); return res; } }; void stress() { int C = 5; for (int i = 0; i < 10000; ++i) { ds smart; dss stupid; stringstream ss; for (int i = 0; i < 10; ++i) { int x = rand() % C, y = rand() % C; if (x > y) swap(x, y); ss << "1 " << x << ' ' << y << '\n'; smart.insert(x, y); stupid.insert(x, y); int a = rand() % C, b = rand() % C, k = rand() % C; if (a > b) swap(a, b); if (smart.get(a, b, k) != stupid.get(a, b, k)) { ss << smart.get(a, b, k) << ' ' << stupid.get(a, b, k) << '\n'; ss << "3 " << a << ' ' << b << ' ' << k << '\n'; cerr << ss.str(); exit(1); } } } exit(0); } int main() { //stress(); ios::sync_with_stdio(false); cin.tie(0); int n, t; cin >> n >> t; int lastans = 0; vector<pair<int, int>> segs; ds add; while (n--) { int tt; cin >> tt; if (tt == 1) { int a, b; cin >> a >> b; a ^= t * lastans; b ^= t * lastans; if (a > b) swap(a, b); segs.push_back({a, b}); add.insert(a, b); } else if (tt == 2) { int id; cin >> id; --id; add.erase(segs[id].first, segs[id].second); } else { int a, b, k; cin >> a >> b >> k; a ^= t * lastans; b ^= t * lastans; if (a > b) swap(a, b); lastans = add.get(a, b, k); cout << lastans << '\n'; } } }

컴파일 시 표준 에러 (stderr) 메시지

segments.cpp: In member function 'void static2d::add(int, int)':
segments.cpp:62:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<static1d>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |   for (++x; x < v.size(); x = (x | x - 1) + 1)
      |             ~~^~~~~~~~~~
segments.cpp:62:38: warning: suggest parentheses around arithmetic in operand of '|' [-Wparentheses]
   62 |   for (++x; x < v.size(); x = (x | x - 1) + 1)
      |                                    ~~^~~
segments.cpp: In member function 'void static2d::build(std::vector<std::pair<int, int> >)':
segments.cpp:78:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<static1d>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |   for (int i = 0; i < v.size(); ++i)
      |                   ~~^~~~~~~~~~
segments.cpp: In member function 'int static2d::get(int, int, int)':
segments.cpp:84:7: warning: unused variable 'xrr' [-Wunused-variable]
   84 |   int xrr = xr;
      |       ^~~
segments.cpp: In member function 'void rofl2d::check_rebuild()':
segments.cpp:118:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  118 |      while (ptr < newall.size() && ycmp(newall[ptr], x))
      |             ~~~~^~~~~~~~~~~~~~~
segments.cpp:123:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |    while (ptr < newall.size())
      |           ~~~~^~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...