oj.uz

Submission #648317

# Submission time Handle Problem Language Result Execution time Memory
648317 2022-10-06T01:36:27 Z ghostwriter Sterilizing Spray (JOI15_sterilizing) C++14
100 / 100
 242 ms 9112 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#else
#define debug(...)
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define FRN(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
    END OF TEMPLATE
----------------------------------------------------------------
    Tran The Bao - ghostwriter
    Training for VOI23 gold medal
----------------------------------------------------------------
    DIT ME CHUYEN BAO LOC
----------------------------------------------------------------
*/
const int N = 1e5 + 1;
int n, q, k, c[N];
ll f[N];
multiset<int> s;
void upd(int pos, int v) { for (int i = pos; i <= n; i += (i & -i)) f[i] += v; }
ll get(int pos) { ll rs = 0; for (int i = pos; i > 0; i -= (i & -i)) rs += f[i]; return rs; }
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
    cin >> n >> q >> k;
    FOR(i, 1, n) {
    	cin >> c[i];
    	if (c[i]) {
    		upd(i, c[i]);
    		s.ins(i);
    	}
    }
    WHILE(q--) {
    	int s1, t, u;
    	cin >> s1 >> t >> u;
    	if (s1 == 1) {
    		if (c[t]) {
    			upd(t, -c[t]);
    			s.ers(t);
    		}
    		c[t] = u;
    		if (c[t]) {
    			upd(t, c[t]);
    			s.ins(t);
    		}
    		continue;
    	}
    	if (s1 == 2) {
    		if (k == 1 || s.empty() || *--s.ed() < t || *s.bg() > u) continue;
    		auto cur = s.lb(t);
    		vi a;
    		WHILE(cur != s.ed() && *cur <= u) {
    			upd(*cur, -c[*cur]);
    			c[*cur] /= k;
    			if (!c[*cur]) a.pb(*cur);
    			else upd(*cur, c[*cur]);
    			++cur;
    		}
    		EACH(i, a) s.ers(i);
    		continue;
    	}
    	cout << get(u) - get(t - 1) << '\n';
    }
    return 0;
}
/*
5 10 3
1
2
8
1
3
1 2 5
2 3 5
3 2 5
2 1 4
1 3 2
3 3 5
1 2 4
2 1 2
1 1 4
3 1 5
----------------------------------------------------------------
From Benq:
    stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/

Compilation message

sterilizing.cpp: In function 'int main()':
sterilizing.cpp:32:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
sterilizing.cpp:62:5: note: in expansion of macro 'FOR'
   62 |     FOR(i, 1, n) {
      |     ^~~
sterilizing.cpp:36:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   36 | #define EACH(i, x) for (auto &(i) : (x))
      |                               ^
sterilizing.cpp:95:7: note: in expansion of macro 'EACH'
   95 |       EACH(i, a) s.ers(i);
      |       ^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 4 ms 468 KB Output is correct
5 Correct 5 ms 596 KB Output is correct
6 Correct 5 ms 468 KB Output is correct
7 Correct 4 ms 468 KB Output is correct
8 Correct 4 ms 468 KB Output is correct
9 Correct 5 ms 476 KB Output is correct
10 Correct 5 ms 468 KB Output is correct
11 Correct 5 ms 588 KB Output is correct
12 Correct 5 ms 468 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 3568 KB Output is correct
2 Correct 49 ms 4260 KB Output is correct
3 Correct 52 ms 6700 KB Output is correct
4 Correct 91 ms 8536 KB Output is correct
5 Correct 81 ms 9012 KB Output is correct
6 Correct 103 ms 9036 KB Output is correct
7 Correct 78 ms 9112 KB Output is correct
8 Correct 85 ms 9048 KB Output is correct
9 Correct 83 ms 8908 KB Output is correct
10 Correct 83 ms 8972 KB Output is correct
11 Correct 88 ms 8932 KB Output is correct
12 Correct 80 ms 8932 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 572 KB Output is correct
2 Correct 12 ms 1876 KB Output is correct
3 Correct 17 ms 1996 KB Output is correct
4 Correct 34 ms 1276 KB Output is correct
5 Correct 54 ms 3924 KB Output is correct
6 Correct 50 ms 3940 KB Output is correct
7 Correct 52 ms 3968 KB Output is correct
8 Correct 47 ms 3912 KB Output is correct
9 Correct 48 ms 4180 KB Output is correct
10 Correct 48 ms 4152 KB Output is correct
11 Correct 62 ms 4236 KB Output is correct
12 Correct 44 ms 4140 KB Output is correct

Subtask #4
75.0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 3440 KB Output is correct
2 Correct 84 ms 5296 KB Output is correct
3 Correct 111 ms 4260 KB Output is correct
4 Correct 89 ms 4080 KB Output is correct
5 Correct 131 ms 8972 KB Output is correct
6 Correct 142 ms 8908 KB Output is correct
7 Correct 149 ms 8844 KB Output is correct
8 Correct 189 ms 8912 KB Output is correct
9 Correct 154 ms 8840 KB Output is correct
10 Correct 193 ms 8880 KB Output is correct
11 Correct 137 ms 8836 KB Output is correct
12 Correct 242 ms 8892 KB Output is correct