#530278 (C++14) No.1170 Never Want to Walk

提出ソース

結果

問題	No.1170 Never Want to Walk
ユーザー	masayoshi361
提出日時	2020-08-14 21:57:39
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	496 ms / 2,000 ms
コード長	6,905 bytes
コンパイル時間	2,263 ms
コンパイル使用メモリ	199,168 KB
実行使用メモリ	29,700 KB
最終ジャッジ日時	2024-10-10 15:10:20
合計ジャッジ時間	9,534 ms
ジャッジサーバーID （参考情報）	judge5 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,820 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	AC	2 ms 6,816 KB
testcase_03	AC	2 ms 6,816 KB
testcase_04	AC	2 ms 6,816 KB
testcase_05	AC	1 ms 6,820 KB
testcase_06	AC	1 ms 6,816 KB
testcase_07	AC	2 ms 6,816 KB
testcase_08	AC	1 ms 6,816 KB
testcase_09	AC	1 ms 6,816 KB
testcase_10	AC	2 ms 6,816 KB
testcase_11	AC	2 ms 6,816 KB
testcase_12	AC	4 ms 6,820 KB
testcase_13	AC	4 ms 6,816 KB
testcase_14	AC	4 ms 6,816 KB
testcase_15	AC	4 ms 6,816 KB
testcase_16	AC	4 ms 6,816 KB
testcase_17	AC	4 ms 6,816 KB
testcase_18	AC	4 ms 6,816 KB
testcase_19	AC	3 ms 6,816 KB
testcase_20	AC	4 ms 6,820 KB
testcase_21	AC	4 ms 6,816 KB
testcase_22	AC	4 ms 6,816 KB
testcase_23	AC	4 ms 6,816 KB
testcase_24	AC	3 ms 6,816 KB
testcase_25	AC	3 ms 6,820 KB
testcase_26	AC	3 ms 6,816 KB
testcase_27	AC	464 ms 26,880 KB
testcase_28	AC	456 ms 26,240 KB
testcase_29	AC	496 ms 27,136 KB
testcase_30	AC	472 ms 27,008 KB
testcase_31	AC	492 ms 26,240 KB
testcase_32	AC	425 ms 28,824 KB
testcase_33	AC	419 ms 27,284 KB
testcase_34	AC	434 ms 29,136 KB
testcase_35	AC	431 ms 29,016 KB
testcase_36	AC	417 ms 28,616 KB
testcase_37	AC	419 ms 28,632 KB
testcase_38	AC	437 ms 29,700 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

/* #region header */
#ifdef LOCAL
    #include "/Users/takakurashokichi/Desktop/atcoder/cxx-prettyprint-master/prettyprint.hpp"
    #define debug(x) cout << x << endl
#else
    #define debug(...) 42
#endif

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
//types
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
typedef pair < ll , ll > Pl;        
typedef pair < int, int > Pi;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vc;
template< typename T >
using mat = vector< vector< T > >;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef vector<vector<char>> vvc;

template< int mod >
struct modint {
    int x;

    modint() : x(0) {}

    modint(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    modint &operator+=(const modint &p) {
        if((x += p.x) >= mod) x -= mod;
        return *this;
    }

    modint &operator-=(const modint &p) {
        if((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }

    modint &operator*=(const modint &p) {
        x = (int) (1LL * x * p.x % mod);
        return *this;
    }

    modint &operator/=(const modint &p) {
        *this *= p.inverse();
        return *this;
    }

    modint operator-() const { return modint(-x); }

    modint operator+(const modint &p) const { return modint(*this) += p; }

    modint operator-(const modint &p) const { return modint(*this) -= p; }

    modint operator*(const modint &p) const { return modint(*this) *= p; }

    modint operator/(const modint &p) const { return modint(*this) /= p; }

    bool operator==(const modint &p) const { return x == p.x; }

    bool operator!=(const modint &p) const { return x != p.x; }

    modint inverse() const {
        int a = x, b = mod, u = 1, v = 0, t;
        while(b > 0) {
        t = a / b;
        swap(a -= t * b, b);
        swap(u -= t * v, v);
        }
        return modint(u);
    }

    modint pow(int64_t n) const {
        modint ret(1), mul(x);
        while(n > 0) {
        if(n & 1) ret *= mul;
        mul *= mul;
        n >>= 1;
        }
        return ret;
    }

    friend ostream &operator<<(ostream &os, const modint &p) {
        return os << p.x;
    }

    friend istream &operator>>(istream &is, modint &a) {
        int64_t t;
        is >> t;
        a = modint< mod >(t);
        return (is);
    }

    static int get_mod() { return mod; }
};
//abreviations
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep_(i, a_, b_, a, b, ...) for (ll i = (a), max_i = (b); i < max_i; i++)
#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define rrep_(i, a_, b_, a, b, ...) for (ll i = (b-1), min_i = (a); i >= min_i; i--)
#define rrep(i, ...) rrep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define SZ(x) ((int)(x).size())
#define pb(x) push_back(x)
#define eb(x) emplace_back(x)
#define mp make_pair
#define print(x) cout << x << endl
#define vprint(x) rep(i, x.size())cout << x[i] << ' '; cout << endl
#define vsum(x) accumulate(all(x), 0LL)
#define vmax(a) *max_element(all(a))
#define vmin(a) *min_element(all(a))
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
//functions
//gcd(0, x) fails.
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { return a/gcd(a, b)*b;}
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 (b<a) { a=b; return 1; } return 0; }
template< typename T >
T mypow(T x, ll n) {
    T ret = 1;
    while(n > 0) {
        if(n & 1) (ret *= x);
        (x *= x);
        n >>= 1;
    }
    return ret;
}
ll modpow(ll x, ll n, const ll mod) {
    ll ret = 1;
    while(n > 0) {
        if(n & 1) (ret *= x);
        (x *= x);
        n >>= 1;
        x%=mod;
        ret%=mod;
    }
    return ret;
}
template< typename T >
uint64_t my_rand(void) {
    static uint64_t x = 88172645463325252ULL;
    x = x ^ (x << 13); x = x ^ (x >> 7);
    return x = x ^ (x << 17);
}
int popcnt(ull x) { return __builtin_popcountll(x); } 
//graph template
template< typename T >
struct edge {
    int src, to;
    T cost;

    edge(int to, T cost) : src(-1), to(to), cost(cost) {}

    edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

    edge &operator=(const int &x) {
        to = x;
        return *this;
    }

    bool operator<(const edge<T> &r) const { return cost < r.cost; }
    
    operator int() const { return to; }
};
template< typename T >
using Edges = vector< edge< T > >;
template< typename T >
using WeightedGraph = vector< Edges< T > >;
using UnWeightedGraph = vector< vector< int > >;
struct Timer { 
    clock_t start_time; 
    void start() {
        start_time = clock(); 
    }
    int lap() { 
        //return x ms.
        return (clock()-start_time)*1000 / CLOCKS_PER_SEC; 
    }
};
/* #endregion*/
//constant
#define inf 1000000005
#define INF 4000000004000000000LL
#define mod 998244353LL
//#define endl '\n'
typedef modint<mod> mint;
const long double eps = 0.00000001;
const long double PI  = 3.141592653589793;
//library
struct UnionFind {
        vector< int > data;

        UnionFind(int sz) {
                data.assign(sz, -1);
        }

        bool unite(int x, int y) {
                x = find(x), y = find(y);
                if(x == y) return (false);
                if(data[x] > data[y]) swap(x, y);
                data[x] += data[y];
                data[y] = x;
                return (true);
        }

        int find(int k) {
                if(data[k] < 0) return (k);
                return (data[k] = find(data[k]));
        }

        int size(int k) {
                return (-data[find(k)]);
        }
        bool same(int x, int y){
                return find(x)==find(y);
        }
};
int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << setprecision(20);
    ll n, a, b; cin>>n>>a>>b; b++;
    vl x(n);
    rep(i, n)cin>>x[i];
    set<ll> xs;
    rep(i, n)xs.insert(x[i]);
    map<ll, ll> inv;
    rep(i, n)inv[x[i]] = i;

    UnionFind uf(n);
    rep(i, n){
        vl que = {x[i]};
        while(que.size()){
            ll v = que.back();
            vl tmp;
            que.pop_back();
            auto liter = xs.lower_bound(v+a);
            while(liter!=xs.end()&&(*liter)<v+b){
                uf.unite(i, inv[*liter]);
                tmp.pb(*liter);
                liter++;
            }
            liter = xs.lower_bound(v-b+1);
            while(liter!=xs.end()&&(*liter)<v-a+1){
                uf.unite(i, inv[*liter]);
                tmp.pb(*liter);
                liter++;
            }
            for(ll t:tmp)xs.erase(xs.lower_bound(t));
            que.insert(que.end(), all(tmp));
        }
        print(uf.size(i));
    }
}

yukicoder

結果

テストケース

ソースコード