oj.uz

답안 #77073

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
77073 2018-09-20T16:09:18 Z SpeedOfMagic Sterilizing Spray (JOI15_sterilizing) C++17
0 / 100
 5000 ms 12416 KB 
/** MIT License Copyright (c) 2018 Vasilyev Daniil **/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#pragma GCC optimize("Ofast")
template<typename T> using v = vector<T>;
template<typename T, typename U>  using hmap = __gnu_pbds::gp_hash_table<T, U>;
#define int long long
typedef long double ld;
typedef string str;
typedef vector<int> vint;
#define rep(a, l, r) for(int a = (l); a < (r); a++)
#define pb push_back
#define fs first
#define sc second
#define sz(a) ((int) a.size())
const long long inf = 4611686018427387903; //2^62 - 1
#if 0  //FileIO
const string fileName = "";
ifstream fin ((fileName == "" ? "input.txt"  : fileName + ".in" ));
ofstream fout((fileName == "" ? "output.txt" : fileName + ".out"));
#define get fin>>
#define put fout<<
#else
#define get cin>>
#define put cout<<
#endif
#define eol put endl
#define check(a) put #a << ": " << a << endl;
void read() {}     template<typename Arg,typename... Args> void read (Arg& arg,Args&... args){get (arg)     ;read(args...) ;}
void print(){}     template<typename Arg,typename... Args> void print(Arg  arg,Args...  args){put (arg)<<" ";print(args...);}
void debug(){eol;} template<typename Arg,typename... Args> void debug(Arg  arg,Args...  args){put (arg)<<" ";debug(args...);}
int getInt(){int a; get a; return a;}
//code goes here
struct node {
    int val = 0;
    int rem = 0;
    int lazy = 0;
    node() {}
};

const int N = 131072;
node segTree[N * 2];
int k;

void processLazy(int cur) {
    if (cur < N) {
        segTree[cur * 2].lazy += segTree[cur].lazy;
        segTree[cur * 2 + 1].lazy += segTree[cur].lazy;
    }

    for (; segTree[cur].lazy; segTree[cur].lazy--) {
        segTree[cur].val -= segTree[cur].rem;
        segTree[cur].rem = 0;
        segTree[cur].val /= k;
    }
}

void updatePos(int p, int val, int cur = 1, int ll = 1, int rr = N) {
    processLazy(cur);
    if (ll == rr){
        segTree[cur].val = val;
        segTree[cur].rem = val % k;
        return;
    }

    int mid = (ll + rr) / 2;
    if (p <= mid) {
        updatePos(p, val, cur * 2, ll, mid);
        processLazy(cur * 2 + 1);
    } else {
        processLazy(cur * 2);
        updatePos(p, val, cur * 2 + 1, mid + 1, rr);
    }

    segTree[cur].val = segTree[cur * 2].val + segTree[cur * 2 + 1].val;
    segTree[cur].rem = segTree[cur * 2].rem + segTree[cur * 2 + 1].rem;
}

void spray(int l, int r, int cur = 1, int ll = 1, int rr = N) {
    //debug(l, r, cur, ll, rr);
    if (l == ll && r == rr)
        segTree[cur].lazy++;

    processLazy(cur);
    if (l > r || (l == ll && r == rr))
        return;

    int mid = (ll + rr) / 2;
    spray(l, min(r, mid), cur * 2, ll, mid);
    spray(max(l, mid + 1), r, cur * 2 + 1, mid + 1, rr);
    segTree[cur].val = segTree[cur * 2].val + segTree[cur * 2 + 1].val;
    segTree[cur].rem = segTree[cur * 2].rem + segTree[cur * 2 + 1].rem;
}

int query(int l, int r, int cur = 1, int ll = 1, int rr = N) {
    processLazy(cur);
    if (l > r)
        return 0;
    if (l == ll && r == rr)
        return segTree[cur].val;
    int mid = (ll + rr) / 2;
    return query(l, min(r, mid), cur * 2, ll, mid) + query(max(l, mid + 1), r, cur * 2 + 1, mid + 1, rr);
}

void run() {
    int n, q;
    read(n, q, k);
    rep(i, 0, n)
        updatePos(i + 1, getInt());
    for (; q; q--) {
        int s, t, u;
        read(s, t, u);
        if (s == 1)
            updatePos(t, u);
        else if (s == 2)
            spray(t, u);
        else
            put query(t, u), eol;
    }
}
int32_t main() {srand(time(0)); ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); put fixed; put setprecision(15); run(); return 0;}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 11 ms 6520 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5019 ms 8668 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 835 ms 8816 KB Output is correct
2 Correct 1068 ms 9116 KB Output is correct
3 Correct 2005 ms 9620 KB Output is correct
4 Execution timed out 5018 ms 11068 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5033 ms 12416 KB Time limit exceeded
2 Halted 0 ms 0 KB -