結果

問題 No.1170 Never Want to Walk
ユーザー Ogtsn99Ogtsn99
提出日時 2020-08-14 22:28:48
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 293 ms / 2,000 ms
コード長 5,485 bytes
コンパイル時間 2,182 ms
コンパイル使用メモリ 206,988 KB
実行使用メモリ 9,480 KB
最終ジャッジ日時 2024-10-10 15:49:14
合計ジャッジ時間 7,323 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,820 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 2 ms
6,816 KB
testcase_04 AC 2 ms
6,820 KB
testcase_05 AC 1 ms
6,820 KB
testcase_06 AC 2 ms
6,816 KB
testcase_07 AC 2 ms
6,820 KB
testcase_08 AC 2 ms
6,816 KB
testcase_09 AC 1 ms
6,816 KB
testcase_10 AC 2 ms
6,820 KB
testcase_11 AC 2 ms
6,816 KB
testcase_12 AC 4 ms
6,816 KB
testcase_13 AC 4 ms
6,820 KB
testcase_14 AC 3 ms
6,816 KB
testcase_15 AC 3 ms
6,816 KB
testcase_16 AC 3 ms
6,820 KB
testcase_17 AC 3 ms
6,816 KB
testcase_18 AC 3 ms
6,820 KB
testcase_19 AC 3 ms
6,816 KB
testcase_20 AC 3 ms
6,816 KB
testcase_21 AC 3 ms
6,820 KB
testcase_22 AC 3 ms
6,816 KB
testcase_23 AC 3 ms
6,816 KB
testcase_24 AC 3 ms
6,816 KB
testcase_25 AC 3 ms
6,816 KB
testcase_26 AC 3 ms
6,820 KB
testcase_27 AC 293 ms
8,424 KB
testcase_28 AC 278 ms
7,728 KB
testcase_29 AC 288 ms
8,648 KB
testcase_30 AC 293 ms
7,904 KB
testcase_31 AC 292 ms
8,652 KB
testcase_32 AC 269 ms
8,456 KB
testcase_33 AC 283 ms
7,732 KB
testcase_34 AC 267 ms
7,788 KB
testcase_35 AC 269 ms
7,772 KB
testcase_36 AC 266 ms
7,732 KB
testcase_37 AC 258 ms
7,748 KB
testcase_38 AC 272 ms
9,480 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define SUM(v) accumulate(v.begin(), v.end(), 0LL)
#define lb(a, key) lower_bound(a.begin(),a.end(),key)
#define ub(a, key) upper_bound(a.begin(),a.end(),key)
#define COUNT(a, key) count(a.begin(), a.end(), key) 
#define BITCOUNT(x) __builtin_popcount(x)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
using P = pair <int,int>;
using WeightedGraph = vector<vector <P>>;
using UnWeightedGraph = vector<vector<int>>;
using Real = long double;
using Point = complex<Real>; //Point and Vector2d is the same!
using Vector2d = complex<Real>;
const long long INF = 1LL << 60;
const int MOD = 1000000007;
const double EPS = 1e-15;
const double PI=3.14159265358979323846;
template <typename T> 
int getIndexOfLowerBound(vector <T> &v, T x){
    return lower_bound(v.begin(),v.end(),x)-v.begin();
}
template <typename T> 
int getIndexOfUpperBound(vector <T> &v, T x){
    return upper_bound(v.begin(),v.end(),x)-v.begin();
}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
#define DUMPOUT cerr
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
istream &operator>>(istream &is, Point &p) {
    Real a, b; is >> a >> b; p = Point(a, b); return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T,U> &p_var) {
    is >> p_var.first >> p_var.second;
    return is;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
    for (T &x : vec) is >> x;
    return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
    DUMPOUT<<'{';
    os << pair_var.first;
    DUMPOUT<<',';
    os << " "<< pair_var.second;
    DUMPOUT<<'}';
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &vec) {
    DUMPOUT<<'[';
    for (int i = 0; i < vec.size(); i++) 
    os << vec[i] << (i + 1 == vec.size() ? "" : " ");
    DUMPOUT<<']';
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &df) {
  for (auto& vec : df) os<<vec;
  return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
    DUMPOUT << "{";
    repi(itr, map_var) {
        os << *itr;
        itr++;
        if (itr != map_var.end()) DUMPOUT << ", ";
        itr--;
    }
    DUMPOUT << "}";
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, set<T> &set_var) {
    DUMPOUT << "{";
    repi(itr, set_var) {
        os << *itr;
        itr++;
        if (itr != set_var.end()) DUMPOUT << ", ";
        itr--;
    }
    DUMPOUT << "}";
    return os;
}
void print() {cout << endl;}
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
  cout << head;
  if (sizeof...(tail) != 0) cout << " ";
  print(forward<Tail>(tail)...);
}
void dump_func() {DUMPOUT << '#'<<endl;}
template <typename Head, typename... Tail>
void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define dump(...)                                                              \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                            \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]"        \
            << endl                                                            \
            << "    ",                                                         \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

struct UnionFind {
    vector <int> par; 
    vector <int> siz; 
    UnionFind(int sz): par(sz), siz(sz, 1LL) {
        rep(i, sz) par[i] = i; 
    }
    int root(int x) { 
        while (par[x] != x) x = par[x] = par[par[x]]; 
        return x;
    }
    bool merge(int x, int y) {
        x = root(x);
        y = root(y);
        if (x == y) return false;
        if (siz[x] < siz[y]) swap(x, y);
        siz[x] += siz[y];
        par[y] = x;
        return true;
    }
    bool issame(int x, int y) { 
        return root(x) == root(y);
    }
    int size(int x) { 
        return siz[root(x)];
    }
};

signed main(void) { cin.tie(0); ios::sync_with_stdio(false);
    int n; cin>>n;
    int a, b; cin>>a>>b;
    
    vector <int> x(n+1);
    x[0] = -INF;
    rep(i, n) cin>>x[i+1];
    x.pb(INF);
    UnionFind uf(n);
    for(int i=1;i<n;i++){
        int agiri = getIndexOfUpperBound(x, x[i] + b);
        //dump(x[i], x[agiri-1]);
        if(x[agiri-1] >= x[i]+a) {
            //dump("merge", agiri-1);
            uf.merge(i-1, agiri-1-1);
        }
        if(x[agiri-1] >= a + x[i+1]) {
            //dump(x[i], x[i+1], x[agiri-1]);
            //if(x[agiri-1] >= a + x[i+1]) print("true");
            uf.merge(i, i-1);
        }
    }
    for(int i=n;i>1;i--){
        int shitab = getIndexOfLowerBound(x, x[i] - b);
        //dump(x[i], x[shitab]);
        if(x[shitab] <= x[i] - a) uf.merge(i-1, shitab-1);
        if(x[shitab] <= x[i-1] - a) uf.merge(i-1, i-2);
    }

    rep(i, n) print(uf.size(i));
}
0