oj.uz

답안 #1057343

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1057343 2024-08-13T17:43:30 Z LilPluton Addk (eJOI21_addk) C++14
92 / 100
 26 ms 6748 KB 
#include <bits/stdc++.h>
/// author: LilPluton auuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuu
using namespace std;
#define ll long long
#define ld long double
#define ar array
#define int ll
#define vt vector
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)(x).size()
#define endll   '\n'

#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, 1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)
#define FOR(...) F_ORC(__VA_ARGS__)(__VA_ARGS__)
#define EACH(x, a) for (auto& x: a)
     
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int d4i[4]={-1, 0, 1, 0}, d4j[4]={0, 1, 0, -1};
const int d8i[8]={-1, -1, 0, 1, 1, 1, 0, -1}, d8j[8]={0, 1, 1, 1, 0, -1, -1, -1};
const int N = 1e5 + 5;
struct BIT
{
    long long n;
    vector<long long> ft;
    BIT(long long N)
    {
        n = N;
        ft.assign(n + 5, 0);
    }
    void upd(long long pos, long long val)
    {
        while(pos <= n)
        {
            ft[pos] += val;
            pos += (pos & (-pos));
        }
        
    }
    long long sum(long long l, long long r)
    {
        if(l != 1)  return sum(1, r) - sum(1, l - 1);
        long long res = 0;
        while(r >= 1)
        {
            res +=  ft[r];
            r += (r | (-r));
        }
        return res;
    }
} ft(N);

struct DSU
{
    vector<int>par, size;
    int n;
    DSU(int N)
    {
        n = N + 5;
        par.resize(n + 1, 0);
        size.assign(n + 1, 1);
        for(int i = 0; i <= n; ++i)
            par[i] = i;
    }
    int _find(int v)
    {
        if(par[v] == v)
            return v;
        return par[v] = _find(par[v]);
    }
    bool unite(int a, int b)
    {
        a = _find(a);
        b = _find(b);
        if(a != b)
        {
            if(size[a] < size[b])
                swap(a, b);
            size[a] += size[b];
            par[b] = a;
            return 1;
        }
        return 0;
    }
};
vector<int>prs(N, 0), so(N, 0);

void solve(int test_case) {
    int n, k;
    cin >> n >> k;
    for(int i = 1, x; i <= n; ++i)
        cin >> x, prs[i] += prs[i - 1] + x, so[i] = so[i - 1] + prs[i];

    int q;
    cin >> q;
    FOR(q)
    {
        int t;
        cin >> t;
        if(t == 1)
        {
            int x;
            FOR(k)
                cin >> x;
        }
        else
        {
            int l, r, m, sum = 0;
            cin >> l >> r >> m;
            sum = so[r] - so[l + m - 2] - so[r - m];
            if(l > 1)
                sum += so[l - 2];
            cout << sum << endll;
        }
    }
}


main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    
    int t = 1;
    for(int i = 1; i <= t; ++i)
        solve(i);
    return 0;
}

Compilation message

Main.cpp:125:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  125 | main() {
      | ^~~~

Subtask #1
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2908 KB Output is correct
5 Correct 2 ms 2908 KB Output is correct
6 Correct 2 ms 2908 KB Output is correct
7 Correct 3 ms 2908 KB Output is correct
8 Correct 2 ms 2908 KB Output is correct
9 Correct 3 ms 3164 KB Output is correct

Subtask #2
56.0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 3420 KB Output is correct
2 Correct 8 ms 3928 KB Output is correct
3 Correct 11 ms 4184 KB Output is correct
4 Correct 19 ms 5456 KB Output is correct
5 Correct 26 ms 6748 KB Output is correct
6 Correct 24 ms 6484 KB Output is correct
7 Correct 26 ms 6480 KB Output is correct

Subtask #3
0 / 8.0

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