結果
問題 | No.1982 [Cherry 4th Tune B] 絶険 |
ユーザー |
|
提出日時 | 2022-06-17 22:42:24 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 338 ms / 3,000 ms |
コード長 | 4,834 bytes |
コンパイル時間 | 2,423 ms |
コンパイル使用メモリ | 207,256 KB |
最終ジャッジ日時 | 2025-01-29 22:27:06 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 35 |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; template<class T> using V = vector<T>; using VI = V<int>; using VL = V<ll>; using VS = V<string>; template<class T> using PQ = priority_queue<T, V<T>, greater<T>>; using graph = V<VI>; template<class T> using w_graph = V<V<pair<int, T>>>; #define FOR(i,a,n) for(int i=(a);i<(n);++i) #define eFOR(i,a,n) for(int i=(a);i<=(n);++i) #define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i) #define erFOR(i,a,n) for(int i=(n);i>=(a);--i) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define inside(h,w,y,x) (unsigned(y)<h&&unsigned(x)<w) #ifdef _DEBUG #define line cout << "-----------------------------\n" #define stop system("pause") #endif constexpr ll INF = 1000000000; constexpr ll LLINF = 1LL << 61; constexpr ll mod = 1000000007; constexpr ll MOD = 998244353; constexpr ld eps = 1e-10; constexpr int dy[]{ -1,0,1,0 }, dx[]{ 0,1,0,-1 }; template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; } template<class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; } inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } template<class T> inline istream& operator>>(istream& is, V<T>& v) { for (auto& a : v)is >> a; return is; } template<class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; } template<class T> inline V<T> vec(size_t a) { return V<T>(a); } template<class T> inline V<T> defvec(T def, size_t a) { return V<T>(a, def); } template<class T, class... Ts> inline auto vec(size_t a, Ts... ts) { return V<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); } template<class T, class... Ts> inline auto defvec(T def, size_t a, Ts... ts) { return V<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); } template<class T> inline void print(const T& a) { cout << a << "\n"; } template<class T, class... Ts> inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); } template<class T> inline void print(const V<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); } template<class T> inline void print(const V<V<T>>& v) { for (auto& a : v)print(a); } template<class T> inline constexpr const T cumsum(const V<T>& a, int l, int r) { return 0 <= l && l <= r && r < a.size() ? a[r] - (l == 0 ? 0 : a[l - 1]) : 0; }//[l,r] template<class T> inline constexpr const T min(const V<T>& v) { return *min_element(all(v)); } template<class T> inline constexpr const T max(const V<T>& v) { return *max_element(all(v)); } template<class T> inline V<T>& operator++(V<T>& v) { for (T& a : v)++a; return v; } template<class T> inline V<T>& operator--(V<T>& v) { for (T& a : v)--a; return v; } template <class T> class BinaryIndexedTree { int n; vector<T> dat; public: BinaryIndexedTree() {} BinaryIndexedTree(int n) : n(n), dat(n + 1) {}; BinaryIndexedTree(int n, T a) : n(n), dat(n + 1) { eFOR(i, 1, n) { dat[i] += a; if (i + (i & -i) <= n) dat[i + (i & -i)] += dat[i]; } } BinaryIndexedTree(V<T> v) : n(v.size()), dat(n + 1) { eFOR(i, 1, n) { dat[i] += v[i - 1]; if (i + (i & -i) <= n) dat[i + (i & -i)] += dat[i]; } } void add(int i, T a) { for (++i; i <= n; i += i & -i) dat[i] += a; } T sum(int r) { // sum of [0,r) T res = 0; for (; r; r -= r & -r) res += dat[r]; return res; } T sum(int l, int r) { // sum of [l,r) if (l < 0 || n < r || l > r) return 0; return sum(r) - sum(l); } int lower_bound(T a) { int res = 0, k = 1; for (; k * 2 <= n; k *= 2); for (; k; k /= 2) { if (res + k <= n && a > dat[res + k]) { a -= dat[res + k]; res += k; } } return res; } }; int main() { init(); int n, k, q; cin >> n >> k >> q; VI col(k); V<V<pair<int, int>>> task(n); FOR(i, 0, k) { int l, r, c, h; cin >> l >> r >> c >> h; --l; col[i] = c; task[l].emplace_back(i, h); task[r].emplace_back(i, -h); } VI ans(q); V<V<pair<int, ll>>> query(n); FOR(i, 0, q) { int l; ll x; cin >> l >> x; --l; query[l].emplace_back(i, x); } BinaryIndexedTree<ll> bit(k); FOR(j, 0, n) { for (auto [i, h] : task[j]) { bit.add(i, h); } for (auto [i, x] : query[j]) { int idx = bit.lower_bound(x); if (idx == k)ans[i] = -1; else ans[i] = col[idx]; } } for (int x : ans)print(x); return 0; }