Submission #1236771

#	Time	Username	Problem	Language	Result	Execution time	Memory
1236771		fauntleroy	Sterilizing Spray (JOI15_sterilizing)	C++20	5 / 100	5094 ms	1700 KiB

sterilizing

#include <iostream>
#include <cstdio>
#include <vector>
#include <array>
#include <string>
#include <algorithm>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <limits>
#include <tuple>
#include <stack>
#include <bitset>
#include <cstring>
#include <sstream>
#include <functional>
#include <random>
#define int long long
using namespace std;

void solve() {
    int n, q, k;
    cin >> n >> q >> k;
    vector<int>a(n + 1);
    for (int i = 1; i <= n; ++i)
        cin >> a[i];
    while (q--) {
        int s, t, u;
        cin >> s >> t >> u;
        if (s == 1)
            a[t] = u;
        else if (s == 2) {
            for (int i = t; i <= u; ++i)
                a[i] = a[i] / k;
        }
        else {
            int s = 0;
            for (int i = t; i <= u; ++i)
               s += a[i];
            cout << s << '\n';
        }
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 75