結果

問題 No.33 アメーバがたくさん
コンテスト
ユーザー fumiphys
提出日時 2019-08-19 22:43:20
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 5,000 ms
コード長 4,426 bytes
コンパイル時間 1,825 ms
コンパイル使用メモリ 184,320 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-10-05 08:02:20
合計ジャッジ時間 2,324 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 11
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>

// macros
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#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 vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define bit(n) (1LL<<(n))
#define INT(n) int n; cin >> n;
#define LL(n) ll n; cin >> n;
#define DOUBLE(n) double n; cin >> n;
using namespace std;

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>;
using Pli = pair<ll, int>;
using Pil = pair<int, ll>;
using Pll = pair<ll, ll>;
using Pdd = pair<double, double>;
using cd = complex<double>;

// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};

// solve
template <typename T>
struct MergableRangeSet{
  using PT = pair<T, T>;
  set<PT> st;
  MergableRangeSet(){}
  // [l, r)
  void add(T l, T r){
    st.insert(make_pair(l, r));
    merge();
  }
  void merge(){
    auto itr = st.begin();
    while(itr != st.end()){
      T l1 = itr->first;
      T r1 = itr->second;
      ++itr;
      if(itr == st.end())break;
      T l2 = itr->first;
      T r2 = itr->second;
      if(l2 <= r1){
        auto prev = itr;
        --prev;
        st.erase(itr);
        st.erase(prev);
        st.insert(make_pair(l1, max(r1, r2)));
        itr = st.lower_bound(make_pair(l1, max(r1, r2)));
      }
    }
  }
  auto begin() noexcept{
    return st.begin();
  }
  auto end() noexcept{
    return st.end();
  }
  size_t size(){
    return st.size();
  }
};


int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(20);
  INT(n); LL(d); LL(t);
  vector<ll> x(n); cin >> x;
  map<ll, vector<int>> mp;
  rep(i, n){
    mp[(x[i] % d + d) % d].pb(i);
  }
  ll res = 0;
  irep(itr, mp){
    auto &vec = itr->second;
    MergableRangeSet<ll> mr;
    for(auto e: vec){
      mr.add(x[e] - d * t, x[e] + d * t + d);
    }
    irep(it, mr){
      Pll p = *it;
      res += (p.SE - p.FI) / d;
    }
  }
  cout << res << endl;
  return 0;
}
0