結果
問題 | No.1982 [Cherry 4th Tune B] 絶険 |
ユーザー | ebi_fly |
提出日時 | 2022-06-17 22:03:01 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 353 ms / 3,000 ms |
コード長 | 5,854 bytes |
コンパイル時間 | 1,789 ms |
コンパイル使用メモリ | 152,516 KB |
実行使用メモリ | 38,780 KB |
最終ジャッジ日時 | 2024-04-17 13:58:01 |
合計ジャッジ時間 | 10,657 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 12 ms
17,280 KB |
testcase_03 | AC | 118 ms
20,164 KB |
testcase_04 | AC | 143 ms
16,548 KB |
testcase_05 | AC | 128 ms
16,584 KB |
testcase_06 | AC | 193 ms
25,784 KB |
testcase_07 | AC | 222 ms
27,444 KB |
testcase_08 | AC | 148 ms
18,964 KB |
testcase_09 | AC | 192 ms
27,560 KB |
testcase_10 | AC | 181 ms
20,592 KB |
testcase_11 | AC | 100 ms
12,484 KB |
testcase_12 | AC | 183 ms
19,580 KB |
testcase_13 | AC | 95 ms
10,956 KB |
testcase_14 | AC | 119 ms
14,592 KB |
testcase_15 | AC | 100 ms
11,548 KB |
testcase_16 | AC | 169 ms
24,788 KB |
testcase_17 | AC | 301 ms
31,944 KB |
testcase_18 | AC | 258 ms
31,288 KB |
testcase_19 | AC | 306 ms
33,032 KB |
testcase_20 | AC | 52 ms
15,744 KB |
testcase_21 | AC | 77 ms
22,476 KB |
testcase_22 | AC | 119 ms
12,416 KB |
testcase_23 | AC | 67 ms
15,032 KB |
testcase_24 | AC | 95 ms
11,060 KB |
testcase_25 | AC | 256 ms
24,312 KB |
testcase_26 | AC | 269 ms
29,548 KB |
testcase_27 | AC | 46 ms
7,880 KB |
testcase_28 | AC | 111 ms
23,436 KB |
testcase_29 | AC | 245 ms
32,292 KB |
testcase_30 | AC | 186 ms
32,440 KB |
testcase_31 | AC | 112 ms
23,424 KB |
testcase_32 | AC | 353 ms
37,912 KB |
testcase_33 | AC | 319 ms
38,776 KB |
testcase_34 | AC | 322 ms
38,780 KB |
ソースコード
#include <algorithm> #include <bitset> #include <cassert> #include <chrono> #include <climits> #include <cmath> #include <cstddef> #include <cstdint> #include <cstdlib> #include <functional> #include <iomanip> #include <iostream> #include <limits> #include <map> #include <memory> #include <numeric> #include <optional> #include <queue> #include <random> #include <set> #include <stack> #include <string> #include <tuple> #include <type_traits> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> /* macro */ #define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++) #define rrep(i, a, n) for (int i = ((int)(n - 1)); i >= (int)(a); i--) #define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++) #define RRep(i, a, n) for (i64 i = ((i64)(n - i64(1))); i >= (i64)(a); i--) #define all(v) (v).begin(), (v).end() #define rall(v) (v).rbegin(), (v).rend() #define Bit(n) (1LL << (n)) /* macro end */ /* template */ namespace ebi { #ifdef LOCAL #define debug(...) \ std::cerr << "LINE: " << __LINE__ << " [" << #__VA_ARGS__ << "]:", \ debug_out(__VA_ARGS__) #else #define debug(...) #endif void debug_out() { std::cerr << std::endl; } template <typename Head, typename... Tail> void debug_out(Head h, Tail... t) { std::cerr << " " << h; if (sizeof...(t) > 0) std::cout << " :"; debug_out(t...); } template <typename T1, typename T2> std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) { return os << pa.first << " " << pa.second; } template <typename T1, typename T2> std::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) { return os >> pa.first >> pa.second; } template <typename T> std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) { for (std::size_t i = 0; i < vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : " "); return os; } template <typename T> std::istream &operator>>(std::istream &os, std::vector<T> &vec) { for (T &e : vec) std::cin >> e; return os; } template <typename T> std::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) { if (opt) { os << opt.value(); } else { os << "invalid value"; } return os; } using std::size_t; using i32 = std::int32_t; using u32 = std::uint32_t; using i64 = std::int64_t; using u64 = std::uint64_t; template <class T, T init> auto make_vector(int n) { return std::vector<T>(n, init); } template <class T, T init, typename Head, typename... Tail> auto make_vector(Head n, Tail... ts) { return std::vector(n, make_vector<T, init>(ts...)); } template <class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template <class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } template <class T> T pow(T x, i64 n) { T res = 1; while (n > 0) { if (n & 1) res = res * x; x = x * x; n >>= 1; } return res; } template <class T> T mod_pow(T x, i64 n, i64 mod) { T res = 1; while (n > 0) { if (n & 1) res = (res * x) % mod; x = (x * x) % mod; n >>= 1; } return res; } template <class T> T scan() { T val; std::cin >> val; return val; } template <class T> struct Edge { int to; T cost; Edge(int _to, T _cost = 1) : to(_to), cost(_cost) {} }; template <class T> struct Graph : std::vector<std::vector<Edge<T>>> { using std::vector<std::vector<Edge<T>>>::vector; void add_edge(int u, int v, T w, bool directed = false) { (*this)[u].emplace_back(v, w); if (directed) return; (*this)[v].emplace_back(u, w); } }; struct graph : std::vector<std::vector<int>> { using std::vector<std::vector<int>>::vector; void add_edge(int u, int v, bool directed = false) { (*this)[u].emplace_back(v); if (directed) return; (*this)[v].emplace_back(u); } }; constexpr i64 LNF = std::numeric_limits<i64>::max() / 4; constexpr int INF = std::numeric_limits<int>::max() / 2; const std::vector<int> dy = {1, 0, -1, 0, 1, 1, -1, -1}; const std::vector<int> dx = {0, 1, 0, -1, 1, -1, 1, -1}; } // namespace ebi #include <atcoder/segtree> namespace ebi { i64 op(i64 a, i64 b) { return a + b; } i64 e() { return 0; } i64 target; bool f(i64 v) { return v < target; } void main_() { int n,k,q; std::cin >> n >> k >> q; std::vector starts(n, std::vector<int>()), ends(n+1, std::vector<int>()); std::vector<std::pair<int, i64>> ops(k); rep(i,0,k) { int l, r; std::cin >> l >> r >> ops[i]; l--; starts[l].emplace_back(i); ends[r].emplace_back(i); } atcoder::segtree<i64, op, e> seg(k); std::vector table(n, std::vector<std::pair<int,i64>>()); rep(i,0,q) { int I; i64 x; std::cin >> I >> x; I--; table[I].emplace_back(i, x); } std::vector<int> ans(q); rep(i,0,n) { for(auto idx: starts[i]) { seg.set(idx, ops[idx].second); } for(auto idx: ends[i]) { seg.set(idx, 0); } for(auto [idx, x]: table[i]) { target = x; int r = seg.max_right<f>(0); if(r == k) { ans[idx] = -1; } else { ans[idx] = ops[r].first; } } } for(auto val: ans) { std::cout << val << '\n'; } } } // namespace ebi int main() { std::cout << std::fixed << std::setprecision(15); std::cin.tie(nullptr); std::ios::sync_with_stdio(false); int t = 1; // std::cin >> t; while (t--) { ebi::main_(); } return 0; }