oj.uz

답안 #825582

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
825582 2023-08-15T04:51:42 Z andecaandeci Addk (eJOI21_addk) C++17
92 / 100
 1109 ms 3376 KB 
#include<bits/stdc++.h>
using namespace std;
#define ioss ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define int long long
#define tup tuple<int, int, int>
#define pii pair<int, int>
#define fi first
#define se second
#define pub push_back
#define pob pop_back
int n, k, q;
vector<int> arr;
signed main() {
    ioss;
    cin >> n >> k;
    arr.resize(n+2);
    int pref[n+2] = {};
    for(int i = 1; i <= n; i++) cin >> arr[i], pref[i] = pref[i-1]+arr[i];

    if(k == 1) {
        cin >> q;
        for(int i = 0; i < q; i++) {
            int idx; cin >> idx;
            if(idx == 1) {
                int num; cin >> num;
            }
            else {
                int l, r, m;
                cin >> l >> r >> m;
                int ans = 0;
                if(m > (r-l+1)/2) m = (r-l+1)-m+1;
                for(int j = 0; j < m; j++) ans += pref[r-j]-pref[l+j-1];
                cout << ans << endl;
            }
        }
    }
}

Subtask #1
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 7 ms 400 KB Output is correct
6 Correct 12 ms 436 KB Output is correct
7 Correct 12 ms 480 KB Output is correct
8 Correct 15 ms 468 KB Output is correct
9 Correct 24 ms 568 KB Output is correct

Subtask #2
56.0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 80 ms 840 KB Output is correct
2 Correct 146 ms 1116 KB Output is correct
3 Correct 234 ms 1440 KB Output is correct
4 Correct 708 ms 2452 KB Output is correct
5 Correct 1109 ms 3376 KB Output is correct
6 Correct 1018 ms 3120 KB Output is correct
7 Correct 889 ms 3224 KB Output is correct

Subtask #3
0 / 8.0

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