結果
問題 | No.674 n連勤 |
ユーザー | ttsuki2 |
提出日時 | 2019-12-09 01:47:52 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 57 ms / 2,000 ms |
コード長 | 6,172 bytes |
コンパイル時間 | 1,705 ms |
コンパイル使用メモリ | 175,612 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-06-11 00:29:13 |
合計ジャッジ時間 | 2,970 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 1 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 6 ms
5,376 KB |
testcase_12 | AC | 6 ms
5,376 KB |
testcase_13 | AC | 45 ms
5,376 KB |
testcase_14 | AC | 45 ms
5,376 KB |
testcase_15 | AC | 43 ms
5,376 KB |
testcase_16 | AC | 55 ms
5,376 KB |
testcase_17 | AC | 57 ms
5,376 KB |
testcase_18 | AC | 51 ms
5,376 KB |
testcase_19 | AC | 45 ms
5,376 KB |
ソースコード
//////////////////////////////////////// /// tu3 pro-con template /// //////////////////////////////////////// #include "bits/stdc++.h" using namespace std; // -- typedefs -- // #define EPS 1e-9 typedef long long llong; // -- loop macros -- // #define LOOP_TYPE(s,n) std::remove_reference_t<std::remove_cv_t<decltype((n)-(s))>> #define FOR(i,s,n) for (auto i = LOOP_TYPE(s,n)(s); i < LOOP_TYPE(s,n)(n); i++) #define FORR(i,s,n) for (auto i = LOOP_TYPE(s,n)(n)-1; i != LOOP_TYPE(s,n)(s)-1; i--) #define REP(i,n) FOR(i,0,n) #define RREP(i,n) FORR(i,0,n) #define FORE(exp) for (auto && exp) #define allof(c) c.begin(), c.end() #define partof(c,s,e) c.begin() + (s), c.begin() + (e) // -- functors -- // #define PREDICATE(t,a,...) [&](const t & a) -> bool { return __VA_ARGS__; } #define PRED(a,...) PREDICATE(auto,a,__VA_ARGS__) #define COMPARISON(t,a,b,...) [&](const t & a, const t & b) -> bool { return __VA_ARGS__; } #define COMP(a,b,...) COMPARISON(auto,a,b,__VA_ARGS__) #define CONV1(a,...) [&](const auto & a) -> auto { return __VA_ARGS__; } #define CONV2(a,b,...) [&](const auto & a, const auto & b) -> auto { return __VA_ARGS__; } #define CONV3(a,b,c,...) [&](const auto & a, const auto & b, const auto & c) -> auto { return __VA_ARGS__; } #define TIE(...) auto tie() const { return std::tie(__VA_ARGS__); } #define LESS(t) bool operator <(const t &rhs) const { return tie() < rhs.tie(); } #define GREATER(t) bool operator >(const t &rhs) const { return tie() > rhs.tie(); } // -- I/O Helper -- // struct _Reader { istream& cin; template <class T> _Reader operator ,(T& rhs) { cin >> rhs; return *this; } }; struct _Writer { ostream& cout; const char* d{ " " }; bool f{}; template <class T> _Writer operator ,(const T& rhs) { cout << (f ? d : "") << rhs; f = 1; return *this; } }; #define READ(t,...) t __VA_ARGS__; (_Reader{cin}), __VA_ARGS__ #define WRITE(...) do { (_Writer{cout}), __VA_ARGS__; cout << endl; } while (false) #define WRITELN(...) do { (_Writer{cout, "\n"}), __VA_ARGS__; cout << endl; } while (false) #define WRITE2D(vevector) FORE(row : vevector) WRITE(row) #ifdef _DEBUG #define DEBUG(...) (_Writer{cerr}), "DEBUG -> ", __VA_ARGS__, "\n" #else #define DEBUG(...) #endif // -- vevector -- // template <class T> struct vevector : vector<vector<T>> { vevector(size_t n = 0, size_t m = 0, const T& initial = T()) : vector<vector<T>>(n, vector<T>(m, initial)) { } }; template <class T> struct vevevector : vector<vevector<T>> { vevevector(size_t n = 0, size_t m = 0, size_t l = 0, const T& initial = T()) : vector<vevector<T>>(n, vevector<T>(m, l, initial)) { } }; template <class T> struct vevevevector : vector<vevevector<T>> { vevevevector(size_t n = 0, size_t m = 0, size_t l = 0, size_t k = 0, const T& initial = T()) : vector<vevevector<T>>(n, vevevector<T>(m, l, k, initial)) { } }; namespace std { template <class T1, class T2> istream& operator >> (istream& in, pair<T1, T2>& p) { in >> p.first >> p.second; return in; } template <class T1, class T2> ostream& operator << (ostream& out, const pair<T1, T2>& p) { out << p.first << " " << p.second; return out; } } template <class T> T read() { T t; cin >> t; return t; } template <class T> vector<T> read(int n) { vector<T> v; REP(i, n) { v.push_back(read<T>()); } return v; } template <class T> vevector<T> read(int n, int m) { vevector<T> v; REP(i, n) v.push_back(read<T>(m)); return v; } template <class T> vector<T> readjag() { return read<T>(read<int>()); } template <class T> vevector<T> readjag(int n) { vevector<T> v; REP(i, n) v.push_back(readjag<T>()); return v; } template <class T> struct iter_range_t { T beg, end; }; template <class T> iter_range_t<T> iter_range(T beg, T end) { return iter_range_t<T>{beg, end}; } template <class T> ostream& operator << (ostream& out, iter_range_t<T> v) { if (v.beg != v.end) { out << *v.beg++; while (v.beg != v.end) { out << " " << *v.beg++; } } return out; } template <class T> ostream& operator << (ostream& out, const vector<T>& v) { return out << iter_range(allof(v)); } // -- etc -- // template <class T> T infinity_value(); template <> int infinity_value<int>() { return int(1) << 30; } template <> llong infinity_value<llong>() { return llong(1) << 60; } template <> double infinity_value<double>() { return 1e+300 * 1e+300; } #define INF(T) infinity_value<T>() inline int sign_of(double x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); } template <class TInt> bool in_range(TInt val, TInt min, TInt max) { return val >= min && val < max; } template <> bool in_range<double>(double val, double min, double max) { return val - min > -EPS && val - max < EPS; } template <class TInt> bool in_range2d(TInt x, TInt y, TInt w, TInt h) { return x >= 0 && x < w && y >= 0 && y < h; } vector<int> iotavn(int start, int count) { vector<int> r(count); iota(allof(r), start); return r; } //// start up //// void solve(); int32_t main() { cin.tie(nullptr); ios_base::sync_with_stdio(false); cout << fixed; cout << setprecision(std::numeric_limits<double>::max_digits10); solve(); return 0; } //////////////////// //// template end //////////////////// struct RangeMerge : std::map<llong, llong> { pair<iterator, iterator> find(llong l, llong r, bool merge) { auto lit = lower_bound(l); if (lit != begin()) { auto llit = lit; if (!merge ? l < (--llit)->second : l <= (--llit)->second) { lit = llit; } } auto rit = lower_bound(r); if (rit != end()) { if (merge && rit->first == r) { ++rit; } } return { lit, rit }; } void add(llong l, llong r, bool merge = false) { auto p = find(l, r, merge); auto lit = p.first; auto rit = p.second; if (lit != end()) { l = min(l, lit->first); } if (rit != begin()) { auto rr = rit; r = max(r, (--rr)->second); } erase(lit, rit); if (l != r) { insert({ l, r }); maxs = max(maxs, r - l); } } llong maxs{}; bool test(llong x) { auto p = find(x, x, false); auto lit = p.first; return lit != end() && x >= lit->first && x < lit->second; } }; void solve() { READ(llong, D, Q); RangeMerge m; REP(i, Q) { READ(llong, a, b); m.add(a, b + 1, true); WRITE(m.maxs); } }