結果
問題 | No.674 n連勤 |
ユーザー |
![]() |
提出日時 | 2024-06-30 18:53:05 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 84 ms / 2,000 ms |
コード長 | 3,181 bytes |
コンパイル時間 | 1,074 ms |
コンパイル使用メモリ | 107,024 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-30 18:53:07 |
合計ジャッジ時間 | 2,552 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 17 |
ソースコード
#line 1 "test/yukicoder/1601_2.test.cpp"#define PROBLEM "https://yukicoder.me/problems/1601"#include <iostream>#line 2 "datastructure/range_map.hpp"#include <map>#include <vector>template <typename T, typename S>struct range_map {public:range_map(bool merge_adjacent = true) : _merge_adjacent(merge_adjacent) {}typename std::map<T, std::pair<T, S>>::const_iterator get(T p) const {auto it = values.upper_bound(p);if (it == values.begin()) return values.end();if (std::prev(it)->second.first < p) return values.end();return std::prev(it);}typename std::map<T, std::pair<T, S>>::const_iterator get(std::pair<T, T> range) const {auto [l, r] = range;auto it = get(l);if (it == values.end()) return values.end();if (it->second.first < r) return values.end();return it;}void set(std::pair<T, T> range, S x) {set(range, x, [](T, T, S) {}, [](T, T, S) {});}template <class op_insert, class op_erase>void set(std::pair<T, T> range, S x, const op_insert &f,const op_erase &g) {auto [l, r] = range;auto it_l = values.upper_bound(l);if (it_l != values.begin() &&l - T(_merge_adjacent) <= std::prev(it_l)->second.first) {it_l--;}auto it_r = values.upper_bound(r + T(_merge_adjacent));std::vector<std::tuple<T, T, S>> restore;restore.reserve(3);if (it_l != values.end() && it_l->first < l) {if (it_l->second.second != x) {restore.emplace_back(it_l->first, l - 1, it_l->second.second);} else {l = it_l->first;}}if (it_l != it_r && r < std::prev(it_r)->second.first) {if (std::prev(it_r)->second.second != x) {restore.emplace_back(r + 1, std::prev(it_r)->second.first,std::prev(it_r)->second.second);} else {r = std::prev(it_r)->second.first;}}restore.emplace_back(l, r, x);for (auto it = it_l; it != it_r; it = values.erase(it)) {g(it->first, it->second.first, it->second.second);}for (auto [l, r, x] : restore) {values[l] = {r, x};f(l, r, x);}}typename std::map<std::pair<T, T>, S>::const_iterator begin() const {return values.begin();}typename std::map<std::pair<T, T>, S>::const_iterator end() const {return values.end();}protected:std::map<T, std::pair<T, S>> values;bool _merge_adjacent;};#line 6 "test/yukicoder/1601_2.test.cpp"int main() {long long d;int q;std::cin >> d >> q;range_map<long long, bool> mp;long long ans = 0;while (q--) {long long a, b;std::cin >> a >> b;mp.set({a, b}, true,[&](long long l, long long r, bool) {ans = std::max(ans, r - l + 1);},[](long long, long long, bool) {});std::cout << ans << '\n';}}