oj.uz

답안 #889277

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
889277 2023-12-19T09:34:29 Z Nelt Addk (eJOI21_addk) C++17
36 / 100
 2000 ms 4136 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());

void solve()
{
    ll n, k;
    cin >> n >> k;
    ll a[n + 1];
    for (ll i = 1; i <= n; i++)
        cin >> a[i];
    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];
        }
        else
        {
            ll l, r, m, ans = 0;
            cin >> l >> r >> m;
            for (ll i = l; i <= r; i++)
                ans += (min(r - m + 1, i) - max(i - m + 1, l) + 1) * a[i];
            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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 3 ms 536 KB Output is correct
4 Correct 7 ms 600 KB Output is correct
5 Correct 9 ms 604 KB Output is correct
6 Correct 14 ms 604 KB Output is correct
7 Correct 20 ms 604 KB Output is correct
8 Correct 27 ms 712 KB Output is correct
9 Correct 52 ms 836 KB Output is correct

Subtask #2
0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 200 ms 1180 KB Output is correct
2 Correct 451 ms 1728 KB Output is correct
3 Correct 780 ms 2284 KB Output is correct
4 Execution timed out 2028 ms 3584 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 878 ms 3152 KB Output is correct
2 Execution timed out 2071 ms 4136 KB Time limit exceeded
3 Halted 0 ms 0 KB -