oj.uz

답안 #239617

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
239617 2020-06-16T21:06:13 Z rqi Sterilizing Spray (JOI15_sterilizing) C++14
100 / 100
 1688 ms 9208 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 

typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

template<class T> bool ckmin(T& a, const T& b) { 
    return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
    return a < b ? a = b, 1 : 0; } 
int pct(int x) { return __builtin_popcount(x); } 
int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 
int fstTrue(function<bool(int)> f, int lo, int hi) {
    hi ++; assert(lo <= hi); // assuming f is increasing
    while (lo < hi) { // find first index such that f is true 
        int mid = (lo+hi)/2; 
        f(mid) ? hi = mid : lo = mid+1; 
    } 
    return lo;
}

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
template<class A> str ts(complex<A> c) { 
    stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) { 
    str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
    res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
    str res = ""; F0R(i,SZ) res += char('0'+b[i]);
    return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
    bool fst = 1; str res = "{";
    for (const auto& x: v) {
        if (!fst) res += ", ";
        fst = 0; res += ts(x);
    }
    res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
    return "("+ts(p.f)+", "+ts(p.s)+")"; }

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
    pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
    pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << ts(h); if (sizeof...(t)) cerr << ", ";
    DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif

// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
    unsyncIO();
    // cin.exceptions(cin.failbit); 
    // throws exception when do smth illegal
    // ex. try to read letter into int
    if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

/**
 * Description: range sum queries and point updates for $D$ dimensions
 * Source: https://codeforces.com/blog/entry/64914
 * Verification: SPOJ matsum
 * Usage: \texttt{BIT<int,10,10>} gives 2D BIT
 * Time: O((\log N)^D)
 */

template <class T, int ...Ns> struct BIT {
    T val = 0; void upd(T v) { val += v; }
    T query() { return val; }
};
template <class T, int N, int... Ns> struct BIT<T, N, Ns...> {
    BIT<T,Ns...> bit[N+1];
    template<typename... Args> void upd(int pos, Args... args) {
        for (; pos<=N; pos+=pos&-pos) bit[pos].upd(args...); }
    template<typename... Args> T sum(int r, Args... args) {
        T res=0; for (;r;r-=r&-r) res += bit[r].query(args...); 
        return res; }
    template<typename... Args> T query(int l, int r, Args... 
        args) { return sum(r,args...)-sum(l-1,args...); }
}; 

set<int> nonz;
BIT<ll, 100005> bit;
int C[100005];

void UPD(int T, int U){
    if(nonz.count(T)) nonz.erase(T);
    bit.upd(T, -C[T]);
    C[T] = U;
    if(C[T] != 0) nonz.ins(T);
    bit.upd(T, C[T]);
}

int main() {
    setIO();
    int N, Q, K;
    cin >> N >> Q >> K;
    for(int i = 1; i <= N; i++){
        int C;
        cin >> C;
        UPD(i, C);
    }

    for(int i = 1; i <= Q; i++){
        int S, T, U;
        cin >> S >> T >> U;
        if(S == 1){
            if(K == 1){
                bit.upd(T, U-bit.query(T, T));
                continue;
            }
            UPD(T, U);
        }
        else if(S == 2){
            if(K == 1){
                continue;
            }
            auto it = nonz.lb(T);
            vpi upds;
            while(it != nonz.end()){
                int pos = *it;
                if(pos > U) break;
                upds.pb(mp(pos, C[pos]/K));
                it = next(it);
            }
            for(auto u: upds){
                UPD(u.f, u.s);
            }
        }
        else if(S == 3){
            ps(bit.query(T, U));
        }

        // dbg(i);
        // for(int i = 1; i <= N; i++){
        //     dbg(bit.query(i, i));
        // }
    }
    // you should actually read the stuff at the bottom
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?)
    * do smth instead of nothing and stay organized
    * WRITE STUFF DOWN
*/

Compilation message

sterilizing.cpp: In function 'void setIn(std::__cxx11::string)':
sterilizing.cpp:128:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
sterilizing.cpp: In function 'void setOut(std::__cxx11::string)':
sterilizing.cpp:129:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 11 ms 512 KB Output is correct
4 Correct 23 ms 512 KB Output is correct
5 Correct 22 ms 640 KB Output is correct
6 Correct 16 ms 640 KB Output is correct
7 Correct 20 ms 640 KB Output is correct
8 Correct 20 ms 640 KB Output is correct
9 Correct 26 ms 640 KB Output is correct
10 Correct 20 ms 640 KB Output is correct
11 Correct 19 ms 640 KB Output is correct
12 Correct 23 ms 640 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 4856 KB Output is correct
2 Correct 60 ms 4392 KB Output is correct
3 Correct 66 ms 6904 KB Output is correct
4 Correct 90 ms 8600 KB Output is correct
5 Correct 93 ms 9208 KB Output is correct
6 Correct 93 ms 9208 KB Output is correct
7 Correct 92 ms 9208 KB Output is correct
8 Correct 92 ms 9208 KB Output is correct
9 Correct 93 ms 9080 KB Output is correct
10 Correct 89 ms 9080 KB Output is correct
11 Correct 103 ms 9080 KB Output is correct
12 Correct 94 ms 9080 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 640 KB Output is correct
2 Correct 25 ms 2048 KB Output is correct
3 Correct 30 ms 2176 KB Output is correct
4 Correct 50 ms 1408 KB Output is correct
5 Correct 90 ms 4100 KB Output is correct
6 Correct 87 ms 4088 KB Output is correct
7 Correct 68 ms 4984 KB Output is correct
8 Correct 85 ms 4956 KB Output is correct
9 Correct 76 ms 4860 KB Output is correct
10 Correct 75 ms 5340 KB Output is correct
11 Correct 75 ms 4852 KB Output is correct
12 Correct 74 ms 5340 KB Output is correct

Subtask #4
75.0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 332 ms 4136 KB Output is correct
2 Correct 302 ms 4156 KB Output is correct
3 Correct 670 ms 3824 KB Output is correct
4 Correct 375 ms 2732 KB Output is correct
5 Correct 565 ms 7164 KB Output is correct
6 Correct 713 ms 7164 KB Output is correct
7 Correct 531 ms 7872 KB Output is correct
8 Correct 1014 ms 8028 KB Output is correct
9 Correct 885 ms 8128 KB Output is correct
10 Correct 1076 ms 8152 KB Output is correct
11 Correct 632 ms 8252 KB Output is correct
12 Correct 1688 ms 8244 KB Output is correct