답안 #363627

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
363627	2021-02-06T17:15:08 Z	ACmachine	A Huge Tower (CEOI10_tower)	C++17	100 / 100	685 ms	43500 KB

tower

#include <bits/stdc++.h>
using namespace std;
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;
 
#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
	
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};
 
#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif
 
#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}
 
 
const int mod = (int)1e9+9;
struct Mint{
    int val;
    Mint(){ val = 0; }
    Mint(long long v){
        val = (-mod <= v && v < mod) ? v : v%mod;
        if(val < 0) val+= mod;
    }
    // operators
    Mint operator-(){return Mint(-val);}
    Mint& operator+=(const Mint& other){ val+=other.val; if(val >= mod) val-=mod; return *this;}
    Mint& operator-=(const Mint& other){ val-=other.val; if(val < 0) val+=mod; return *this;}
    Mint& operator*=(const Mint& other){ val=((long long)val*other.val)%mod; return *this;}
    friend Mint binpow(Mint a, long long p){
        Mint res(1);
        while(p > 0){
            if(p&1) res*=a; a*=a; p>>=1;
        }
        return res;
    }
    friend Mint inv(Mint a){ return binpow(a, mod-2); }
    Mint& operator/=(const Mint &other){ return (*this)*=inv(other);}
    
    friend Mint operator+(Mint a, const Mint& b){ return a+=b; }
    friend Mint operator-(Mint a, const Mint& b){ return a-=b; }
    friend Mint operator*(Mint a, const Mint& b){ return a*=b; }
    friend Mint operator/(Mint a, const Mint& b){ return a/=b; }
    
    bool operator==(const Mint &other){return val == other.val;}
    bool operator!=(const Mint &other){return val != other.val;}
    bool operator<(const Mint &other){return val < other.val;}
    // io
    friend ostream& operator<<(ostream &out, Mint &a){ return out << a.val; }
};

struct node{
    ll ans = 0, lazy = 0;
    void apply(int l, int r, ll val){
        ans += (r - l) * val;
        lazy += val;
    }
};
struct segtree{
    node comb(node const &a, node const &b){
        node res;
        res.ans = a.ans + b.ans;
        return res;
    } 
    void push(int l, int r, int v){
        tree[v<<1].lazy += tree[v].lazy;
        tree[v<<1|1].lazy += tree[v].lazy;
        int mid = (l + r) >> 1;
        tree[v<<1].ans += (mid - l) * tree[v].lazy;
        tree[v<<1|1].ans += (r - mid)* tree[v].lazy;
        tree[v].lazy = 0;
    }
    int sz;
    vector<node> tree; 
    segtree(int _sz){ // tree is resized to default values set in node
        sz = 1; while(sz < _sz) sz<<=1;
        tree.resize(2*sz); 
    } 
    void build(vector<node> &init){
        for(int i = 0; i < sz; ++i) 
            if(i < init.size())
                tree[i+sz] = init[i];
        for(int i = sz-1; i > 0; --i)
            tree[i] = comb(tree[i<<1], tree[i<<1|1]);
    } 
    node query(int l, int r){return query0(l, r, 0, sz, 1);} 
    node query0(int l, int r, int beg, int end, int v){ 
        if(beg >= l && end <= r)
            return tree[v];
        push(beg, end, v);
        int mid = (beg + end) >> 1;
        node res;
        if(beg >= r || mid <= l) res = query0(l, r, mid, end, v<<1|1); //[beg, mid]
        else if(mid >= r || end <= l) res = query0(l, r, beg, mid, v<<1);
        else res = comb(query0(l, r, beg, mid, v<<1), query0(l, r, mid, end, v<<1|1));
        return res;
    } 
    template<typename... T>
    void upd(int l, int r, T ...args){upd0(l, r, 0, sz, 1, args...);}
    template<typename... T>
    void upd0(int l, int r, int beg, int end, int v, T ...args){
        if(beg >= r || end <= l)
            return;
        if(beg >= l && end <= r){
            tree[v].apply(beg, end, args...);
            return;
        }
        push(beg, end, v);
        int mid = (beg + end) >> 1;
        upd0(l, r, beg, mid, v<<1, args...);
        upd0(l, r, mid, end, v<<1|1, args...);
        tree[v] = comb(tree[v<<1], tree[v<<1|1]);
    } 
};

int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
	int n, d;
    cin >> n >> d;
    vi a(n); cin >> a;
    sort(all(a));
    vi cm = a; 
    cm.erase(unique(all(cm)), cm.end());
    segtree st(n + 5);
    st.upd(0, n + 5, 1);
    Mint w(1);
    REP(i, n){
        int L = lower_bound(all(cm), a[i] - d) - cm.begin();
        int R = upper_bound(all(cm), a[i] + d) - cm.begin(); 
        int id = lower_bound(all(cm), a[i]) - cm.begin();
        int cn = st.query(id, id + 1).ans;
        w *= Mint(cn);
        st.upd(L, R, 1); 
    }
    cout << w << "\n";
	
    return 0;
}

Compilation message

tower.cpp: In function 'Mint binpow(Mint, long long int)':
tower.cpp:100:13: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  100 |             if(p&1) res*=a; a*=a; p>>=1;
      |             ^~
tower.cpp:100:29: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  100 |             if(p&1) res*=a; a*=a; p>>=1;
      |                             ^
tower.cpp: In member function 'void segtree::build(std::vector<node>&)':
tower.cpp:148:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<node>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  148 |             if(i < init.size())
      |                ~~^~~~~~~~~~~~~

Subtask #1

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct

Subtask #2

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct

Subtask #3

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	364 KB	Output is correct

Subtask #4

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct

Subtask #5

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	364 KB	Output is correct

Subtask #6

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct

Subtask #7

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	364 KB	Output is correct

Subtask #8

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct

Subtask #9

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct

Subtask #10

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct

Subtask #11

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct

Subtask #12

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct

Subtask #13

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct

Subtask #14

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct

Subtask #15

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct

Subtask #16

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	364 KB	Output is correct

Subtask #17

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	876 KB	Output is correct

Subtask #18

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	48 ms	2768 KB	Output is correct
2	Correct	36 ms	3308 KB	Output is correct

Subtask #19

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	279 ms	10604 KB	Output is correct
2	Correct	206 ms	12912 KB	Output is correct

Subtask #20

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	419 ms	37996 KB	Output is correct
2	Correct	685 ms	43500 KB	Output is correct