結果
問題 | No.1675 Strange Minimum Query |
ユーザー | keijak |
提出日時 | 2021-09-10 21:57:32 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 272 ms / 2,000 ms |
コード長 | 3,207 bytes |
コンパイル時間 | 3,458 ms |
コンパイル使用メモリ | 217,320 KB |
実行使用メモリ | 35,788 KB |
最終ジャッジ日時 | 2023-09-02 17:19:48 |
合計ジャッジ時間 | 11,653 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,372 KB |
testcase_01 | AC | 2 ms
4,372 KB |
testcase_02 | AC | 1 ms
4,368 KB |
testcase_03 | AC | 215 ms
22,920 KB |
testcase_04 | AC | 188 ms
22,852 KB |
testcase_05 | AC | 44 ms
10,400 KB |
testcase_06 | AC | 258 ms
26,284 KB |
testcase_07 | AC | 272 ms
28,472 KB |
testcase_08 | AC | 2 ms
4,368 KB |
testcase_09 | AC | 3 ms
4,368 KB |
testcase_10 | AC | 191 ms
18,808 KB |
testcase_11 | AC | 58 ms
10,980 KB |
testcase_12 | AC | 214 ms
20,764 KB |
testcase_13 | AC | 145 ms
15,432 KB |
testcase_14 | AC | 232 ms
35,788 KB |
testcase_15 | AC | 217 ms
35,748 KB |
testcase_16 | AC | 2 ms
4,372 KB |
testcase_17 | AC | 29 ms
6,232 KB |
testcase_18 | AC | 35 ms
6,652 KB |
testcase_19 | AC | 83 ms
13,364 KB |
testcase_20 | AC | 95 ms
11,892 KB |
testcase_21 | AC | 106 ms
14,188 KB |
testcase_22 | AC | 123 ms
15,148 KB |
testcase_23 | AC | 68 ms
7,912 KB |
testcase_24 | AC | 80 ms
10,796 KB |
testcase_25 | AC | 49 ms
7,128 KB |
testcase_26 | AC | 43 ms
8,024 KB |
testcase_27 | AC | 106 ms
14,912 KB |
testcase_28 | AC | 69 ms
11,420 KB |
testcase_29 | AC | 74 ms
12,828 KB |
testcase_30 | AC | 43 ms
8,292 KB |
testcase_31 | AC | 83 ms
8,844 KB |
testcase_32 | AC | 143 ms
15,704 KB |
testcase_33 | AC | 142 ms
15,776 KB |
testcase_34 | AC | 143 ms
15,952 KB |
testcase_35 | AC | 189 ms
16,988 KB |
testcase_36 | AC | 188 ms
16,952 KB |
ソースコード
#include <bits/stdc++.h> #define REP_(i, a_, b_, a, b, ...) \ for (int i = (a), END_##i = (b); i < END_##i; ++i) #define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__) #define ALL(x) std::begin(x), std::end(x) using i64 = long long; template<typename T, typename U> inline bool chmax(T &a, U b) { return a < b and ((a = std::move(b)), true); } template<typename T, typename U> inline bool chmin(T &a, U b) { return a > b and ((a = std::move(b)), true); } template<typename T> inline int ssize(const T &a) { return (int) std::size(a); } template<typename T> std::istream &operator>>(std::istream &is, std::vector<T> &a) { for (auto &x: a) is >> x; return is; } template<typename T, typename U> std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &a) { return os << "(" << a.first << ", " << a.second << ")"; } template<typename Container> std::ostream &print_seq(const Container &a, std::string_view sep = " ", std::string_view ends = "\n", std::ostream &os = std::cout) { auto b = std::begin(a), e = std::end(a); for (auto it = std::begin(a); it != e; ++it) { if (it != b) os << sep; os << *it; } return os << ends; } template<typename T, typename = void> struct is_iterable : std::false_type {}; template<typename T> struct is_iterable<T, std::void_t<decltype(std::begin(std::declval<T>())), decltype(std::end(std::declval<T>()))>> : std::true_type { }; template<typename T, typename = std::enable_if_t< is_iterable<T>::value && !std::is_same<T, std::string_view>::value && !std::is_same<T, std::string>::value>> std::ostream &operator<<(std::ostream &os, const T &a) { return print_seq(a, ", ", "", (os << "{")) << "}"; } void print() { std::cout << "\n"; } template<class T> void print(const T &x) { std::cout << x << "\n"; } template<typename Head, typename... Tail> void print(const Head &head, Tail... tail) { std::cout << head << " "; print(tail...); } struct Input { template<typename T> operator T() const { T x; std::cin >> x; return x; } } in; #ifdef MY_DEBUG #include "debug_dump.hpp" #else #define DUMP(...) #endif using namespace std; const i64 kBig = 1'000'000'000; auto solve() -> optional<vector<i64>> { int n = in, Q = in; map<i64, vector<pair<int, int>>> qs; REP(qi, Q) { i64 l = in, r = in, b = in; --l; qs[b].push_back({l, r}); } set<i64> as; REP(i, n) as.insert(i); vector<i64> ans(n, kBig); for (auto it = qs.rbegin(); it != qs.rend(); ++it) { i64 b = it->first; for (auto[l, r]: it->second) { auto it = as.lower_bound(l); if (it == as.end() or *it >= r) return nullopt; } for (auto[l, r]: it->second) { auto it = as.lower_bound(l); while (it != as.end() and *it < r) { ans[*it] = b; it = as.erase(it); } } } return ans; } int main() { ios_base::sync_with_stdio(false), cin.tie(nullptr); cout << std::fixed << std::setprecision(18); const int t = 1; REP(test_case, t) { auto ans = solve(); if (not ans) { print(-1); } else { print_seq(*ans); } } }