結果

問題 No.33 アメーバがたくさん
ユーザー fumiphysfumiphys
提出日時 2020-04-10 01:39:07
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 2 ms / 5,000 ms
コード長 4,531 bytes
コンパイル時間 1,791 ms
コンパイル使用メモリ 179,116 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-09-14 04:44:33
合計ジャッジ時間 2,238 ms
ジャッジサーバーID
（参考情報） 		judge2 / 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 2 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
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL<<(n))
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20);}
} fast_io_;

template <typename T>
struct MergableRangeSet{
  using PT = pair<T, T>;
  set<PT> st;
  T mini = numeric_limits<T>::min();
  MergableRangeSet(){}
  // [l, r)
  void add(T l, T r){
    if(r <= l)return;
    auto itr = st.lower_bound(make_pair(l, mini));
    if(itr != st.begin()){
      auto litr = itr;
      --litr;
      if(litr->second >= l){
        if(litr->second >= r){
          return;
        }else{
          l = litr->first;
          st.erase(litr);
        }
      }
    }
    while(true){
      if(itr != st.end()){
        if(r < itr->first){
          st.insert(make_pair(l, r));
          return;
        }else {
          if(r <= itr->second){
            r = itr->second;
            st.erase(itr);
            st.insert(make_pair(l, r));
            return;
          }
          itr = st.erase(itr);
        }
      }else{
        st.insert(make_pair(l, r));
        return;
      }
    }
  }
  typename set<PT>::iterator begin() noexcept{
    return st.begin();
  }
  typename set<PT>::iterator end() noexcept{
    return st.end();
  }
  size_t size(){
    return st.size();
  }
};


int main(int argc, char const* argv[])
{
  int n; cin >> n;
  ll d, t; cin >> d >> t;
  map<ll, MergableRangeSet<ll>> mp;
  rep(i, n){
    ll x; cin >> x;
    ll key = x % d;
    if(key < 0)key += d;
    ll v = (x - key) / d;
    mp[key].add(v - t, v + t + 1);
  }
  ll res = 0;
  irep(itr, mp){
    auto &mrs = itr->second;
    for(auto mtr = mrs.begin(); mtr != mrs.end(); ++mtr){
      res += mtr->second - mtr->first;
    }
  }
  cout << res << endl;
  return 0;
}
0