結果
問題 | No.1170 Never Want to Walk |
ユーザー | ningenMe |
提出日時 | 2020-08-14 21:52:51 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 416 ms / 2,000 ms |
コード長 | 7,624 bytes |
コンパイル時間 | 2,202 ms |
コンパイル使用メモリ | 205,296 KB |
実行使用メモリ | 13,156 KB |
最終ジャッジ日時 | 2024-04-18 21:37:33 |
合計ジャッジ時間 | 8,608 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 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 | 1 ms
5,376 KB |
testcase_05 | AC | 1 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 1 ms
5,376 KB |
testcase_09 | AC | 1 ms
5,376 KB |
testcase_10 | AC | 1 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 3 ms
5,376 KB |
testcase_13 | AC | 3 ms
5,376 KB |
testcase_14 | AC | 4 ms
5,376 KB |
testcase_15 | AC | 4 ms
5,376 KB |
testcase_16 | AC | 3 ms
5,376 KB |
testcase_17 | AC | 3 ms
5,376 KB |
testcase_18 | AC | 3 ms
5,376 KB |
testcase_19 | AC | 3 ms
5,376 KB |
testcase_20 | AC | 3 ms
5,376 KB |
testcase_21 | AC | 3 ms
5,376 KB |
testcase_22 | AC | 4 ms
5,376 KB |
testcase_23 | AC | 3 ms
5,376 KB |
testcase_24 | AC | 4 ms
5,376 KB |
testcase_25 | AC | 3 ms
5,376 KB |
testcase_26 | AC | 3 ms
5,376 KB |
testcase_27 | AC | 358 ms
12,968 KB |
testcase_28 | AC | 340 ms
13,080 KB |
testcase_29 | AC | 370 ms
13,004 KB |
testcase_30 | AC | 381 ms
12,992 KB |
testcase_31 | AC | 342 ms
13,084 KB |
testcase_32 | AC | 396 ms
12,972 KB |
testcase_33 | AC | 389 ms
13,080 KB |
testcase_34 | AC | 399 ms
13,012 KB |
testcase_35 | AC | 410 ms
12,992 KB |
testcase_36 | AC | 388 ms
13,088 KB |
testcase_37 | AC | 416 ms
13,092 KB |
testcase_38 | AC | 410 ms
13,156 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; #define ALL(obj) (obj).begin(),(obj).end() #define SPEED cin.tie(0);ios::sync_with_stdio(false); template<class T> using PQ = priority_queue<T>; template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>; constexpr long long MOD = (long long)1e9 + 7; constexpr long long MOD2 = 998244353; constexpr long long HIGHINF = (long long)1e18; constexpr long long LOWINF = (long long)1e15; constexpr long double PI = 3.1415926535897932384626433L; template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);} template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));} template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}} template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;} template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;} template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;} template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;} template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;} template <template <class tmp> class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;} void print(void) {cout << endl;} template <class Head> void print(Head&& head) {cout << head;print();} template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);} template <class T> void chmax(T& a, const T b){a=max(a,b);} template <class T> void chmin(T& a, const T b){a=min(a,b);} void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;} void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;} void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;} /* * @title SegmentTree */ template<class Operator> class SegmentTree { using TypeNode = typename Operator::TypeNode; size_t length; size_t num; vector<TypeNode> node; vector<pair<size_t,size_t>> range; public: //unitで初期化 SegmentTree(const size_t num): num(num) { for (length = 1; length <= num; length *= 2); node.resize(2 * length, Operator::unit_node); range.resize(2 * length); for (int i = 0; i < length; ++i) range[i+length] = make_pair(i,i+1); for (int i = length - 1; i >= 0; --i) range[i] = make_pair(range[(i<<1)+0].first,range[(i<<1)+1].second); } //vectorで初期化 SegmentTree(const vector<TypeNode> & vec) : num(vec.size()) { for (length = 1; length <= vec.size(); length *= 2); node.resize(2 * length, Operator::unit_node); for (int i = 0; i < vec.size(); ++i) node[i + length] = vec[i]; for (int i = length - 1; i >= 0; --i) node[i] = Operator::func_node(node[(i<<1)+0],node[(i<<1)+1]); range.resize(2 * length); for (int i = 0; i < length; ++i) range[i+length] = make_pair(i,i+1); for (int i = length - 1; i >= 0; --i) range[i] = make_pair(range[(i<<1)+0].first,range[(i<<1)+1].second); } //同じinitで初期化 SegmentTree(const size_t num, const TypeNode init) : num(num) { for (length = 1; length <= num; length *= 2); node.resize(2 * length, Operator::unit_node); range.resize(2 * length); for (int i = 0; i < length; ++i) node[i+length] = init; for (int i = 0; i < length; ++i) range[i+length] = make_pair(i,i+1); for (int i = length - 1; i >= 0; --i) range[i] = make_pair(range[(i<<1)+0].first,range[(i<<1)+1].second); } //[idx,idx+1) void update(size_t idx, const TypeNode var) { if(idx < 0 || length <= idx) return; idx += length; node[idx] = Operator::func_merge(node[idx],var); while(idx >>= 1) node[idx] = Operator::func_node(node[(idx<<1)+0],node[(idx<<1)+1]); } //[l,r) TypeNode get(int l, int r) { if (l < 0 || length <= l || r < 0 || length < r) return Operator::unit_node; TypeNode vl = Operator::unit_node, vr = Operator::unit_node; for(l += length, r += length; l < r; l >>=1, r >>=1) { if(l&1) vl = Operator::func_node(vl,node[l++]); if(r&1) vr = Operator::func_node(node[--r],vr); } return Operator::func_node(vl,vr); } //return [0,length] int prefix_binary_search(TypeNode var) { if(!Operator::func_check(node[1],var)) return num; TypeNode ret = Operator::unit_node; size_t idx = 2; for(; idx < 2*length; idx<<=1){ if(!Operator::func_check(Operator::func_node(ret,node[idx]),var)) { ret = Operator::func_node(ret,node[idx]); idx++; } } return min((idx>>1) - length,num); } //range[l,r) return [l,r] int binary_search(size_t l, size_t r, TypeNode var) { if (l < 0 || length <= l || r < 0 || length < r) return -1; TypeNode ret = Operator::unit_node; size_t off = l; for(size_t idx = l+length; idx < 2*length && off < r; ){ if(range[idx].second<=r && !Operator::func_check(Operator::func_node(ret,node[idx]),var)) { ret = Operator::func_node(ret,node[idx]); off = range[idx++].second; if(!(idx&1)) idx >>= 1; } else{ idx <<=1; } } return off; } void print(){ // cout << "node" << endl; // for(int i = 1,j = 1; i < 2*length; ++i) { // cout << node[i] << " "; // if(i==((1<<j)-1) && ++j) cout << endl; // } cout << "vector" << endl; cout << "{ " << get(0,1); for(int i = 1; i < length; ++i) cout << ", " << get(i,i+1); cout << " }" << endl; } }; /* * @title UnionFindTree */ class UnionFindTree { public: vector<int> parent; vector<int> rank; UnionFindTree(int N) : parent(N), rank(N,0){ iota(parent.begin(),parent.end(),0); } int root(int n) { return (parent[n] == n ? n : parent[n] = root(parent[n])); } inline int same(int n, int m) { return root(n) == root(m); } inline void unite(int n, int m) { n = root(n); m = root(m); if (n == m) return; if (rank[n]<rank[m]) { parent[n] = m; } else{ parent[m] = n; if(rank[n] == rank[m]) rank[n]++; } } }; //[l,r) vector<int> idx(int l,int r,const int length) { vector<int> v; for(l += length, r += length; l < r; l >>=1, r >>=1) { if(l&1) v.push_back(l++); if(r&1) v.push_back(--r); } return v; } int main() { ll N,A,B; cin >> N >> A >> B; vector<ll> X(N); for(int i = 0; i < N; ++i) cin >> X[i]; X.push_back(LOWINF); int length; for (length = 1; length <= N; length *= 2); UnionFindTree uf(2*length); vector<int> st(2*length,0); for(int i = 0; i < N; ++i) { int l = lower_bound(ALL(X),X[i]+A)-X.begin(); int r = upper_bound(ALL(X),X[i]+B)-X.begin(); auto v = idx(l,r,length); for(auto& e:v) { st[e]=1; uf.unite(i+length,e); } } for(int i = 0; i < N; ++i) { int l=i+length; while(l >>= 1) if(st[l]) uf.unite(i+length,l); } vector<int> cnt(2*length,0); for(int i = 0; i < N; ++i) { cnt[uf.root(i+length)]++; } for(int i = 0; i < N; ++i) { cout << cnt[uf.root(i+length)] << endl; } return 0; }