結果
問題 | No.674 n連勤 |
ユーザー | keijak |
提出日時 | 2021-09-05 03:14:32 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 25 ms / 2,000 ms |
コード長 | 4,282 bytes |
コンパイル時間 | 2,132 ms |
コンパイル使用メモリ | 208,984 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-01 11:29:01 |
合計ジャッジ時間 | 3,515 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | AC | 2 ms
6,944 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,940 KB |
testcase_07 | AC | 1 ms
6,944 KB |
testcase_08 | AC | 2 ms
6,944 KB |
testcase_09 | AC | 2 ms
6,944 KB |
testcase_10 | AC | 2 ms
6,940 KB |
testcase_11 | AC | 3 ms
6,940 KB |
testcase_12 | AC | 3 ms
6,940 KB |
testcase_13 | AC | 14 ms
6,940 KB |
testcase_14 | AC | 15 ms
6,940 KB |
testcase_15 | AC | 13 ms
6,940 KB |
testcase_16 | AC | 25 ms
6,940 KB |
testcase_17 | AC | 25 ms
6,940 KB |
testcase_18 | AC | 22 ms
6,940 KB |
testcase_19 | AC | 14 ms
6,944 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; // Disjoint half-open intervals [l, r) (mapping l to r). class HalfOpenIntervalSet : public std::map<i64, i64> { public: // If true, automatically merges [l, c) and [c, r). bool merge_adjacent; i64 max_len; HalfOpenIntervalSet(bool merge_adjacent = true) : merge_adjacent(merge_adjacent), max_len(0) {} // Returns the interval [l, r) which contains p if available. // Otherwise returns this->end(). std::map<i64, i64>::iterator find_interval(i64 p) { auto it = upper_bound(p); if (it != begin()) { --it; if (it->second > p) return it; } return end(); } // Inserts interval [l, r) void add_interval(i64 l, i64 r) { auto itl = upper_bound(l), itr = upper_bound(r - 1 + merge_adjacent); if (itl != begin()) { --itl; if (itl->second <= l - merge_adjacent) ++itl; } if (itl != itr) { l = std::min(l, itl->first); r = std::max(r, std::prev(itr)->second); erase(itl, itr); } (*this)[l] = r; chmax(max_len, r - l); } // Removes interval [l, r) void remove_interval(i64 l, i64 r) { auto itl = upper_bound(l), itr = upper_bound(r - 1); if (itl != begin()) { --itl; if (itl->second <= l) ++itl; } if (itl == itr) return; i64 tl = std::min(l, itl->first); i64 tr = std::max(r, std::prev(itr)->second); erase(itl, itr); if (tl < l) (*this)[tl] = l; if (r < tr) (*this)[r] = tr; } // Are p and q in the same interval? bool same(i64 p, i64 q) { const auto it = find_interval(p); return it != end() and it->first <= q and q < it->second; } // Minimum excluded value greater than or equal to X. i64 mex(int bottom = 0) { const auto it = find_interval(bottom); if (it == end()) return bottom; return it->second; } }; auto main() -> int { ios_base::sync_with_stdio(false), cin.tie(nullptr); i64 D = in, Q = in; HalfOpenIntervalSet ivs; REP(qi, Q) { i64 a = in, b = in; ivs.add_interval(a, b + 1); print(ivs.max_len); } }