oj.uz

Submission #889296

# Submission time Handle Problem Language Result Execution time Memory
889296 2023-12-19T09:58:42 Z Nelt Addk (eJOI21_addk) C++17
100 / 100
 93 ms 9552 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

/* DEFINES */
#define S second
#define F first
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define ANDROID                   \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
struct SegTree
{
    ll n;
    vv(ll) st;
    SegTree(ll sz = 0, bool input = false)
    {
        n = sz;
        st.resize((n + 1) << 1, 0);
    }
    void set(ll i, ll val)
    {
        st[i + n - 1] = val;
    }
    void build()
    {
        for (ll i = n - 1; i >= 1; i--)
            st[i] = st[i << 1] + st[i << 1 | 1];
    }
    void modify(ll p, ll val)
    {
        for (st[p += n - 1] = val; p > 1; p >>= 1)
            st[p >> 1] = st[p] + st[p ^ 1];
    }
    ll query(ll l, ll r)
    {
        ll ans = 0;
        for (l += n - 1, r += n; l < r; l >>= 1, r >>= 1)
        {
            if (l & 1)
                ans += st[l++];
            if (r & 1)
                ans += st[--r];
        }
        return ans;
    }
};
void solve()
{
    ll n, k;
    cin >> n >> k;
    ll a[n + 1];
    SegTree st(n), st1(n);
    for (ll i = 1; i <= n; i++)
        cin >> a[i], st.set(i, a[i]), st1.set(i, a[i] * i);
    st.build();
    st1.build();
    ll q;
    cin >> q;
    ll subseq[k], tmp[k];
    while (q--)
    {
        ll t;
        cin >> t;
        if (t == 1)
        {
            for (ll i = 0; i < k; i++)
                cin >> subseq[i], tmp[i] = a[subseq[i]];
            for (ll i = 0; i < k; i++)
                a[subseq[i]] = tmp[(i + 1) % k], st.modify(subseq[i], a[subseq[i]]), st1.modify(subseq[i], a[subseq[i]] * subseq[i]);
        }
        else
        {
            ll l, r, m, ans = 0;
            cin >> l >> r >> m;
            ans += st.query(l + m - 1, r - m + 1) * m;
            ans += st.query(max(r - m + 2, l + m - 1), r) * (r + 1) - st1.query(max(r - m + 2, l + m - 1), r);
            ans += st1.query(l, min(l + m - 2, r - m + 1)) - st.query(l, min(l + m - 2, r - m + 1)) * (l - 1);
            ans += st.query(r - m + 2, l + m - 2) * (r - m + 1 - l + 1);
            cout << ans << endl;
        }
    }
}
/*

*/
int main()
{
    ANDROID
    // precomp();
    ll t = 1;
    // cin >> t;
    for (ll i = 1; i <= t; i++)
        // cout << "Case #" << i << ": ",
        solve();
    cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}

Subtask #1
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 568 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 4 ms 604 KB Output is correct
7 Correct 5 ms 604 KB Output is correct
8 Correct 5 ms 604 KB Output is correct
9 Correct 8 ms 860 KB Output is correct

Subtask #2
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 1372 KB Output is correct
2 Correct 25 ms 2028 KB Output is correct
3 Correct 40 ms 2388 KB Output is correct
4 Correct 65 ms 4044 KB Output is correct
5 Correct 88 ms 8272 KB Output is correct
6 Correct 84 ms 8060 KB Output is correct
7 Correct 88 ms 8108 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 3088 KB Output is correct
2 Correct 74 ms 4948 KB Output is correct
3 Correct 92 ms 9552 KB Output is correct
4 Correct 93 ms 8592 KB Output is correct