oj.uz

Submission #1036007

# Submission time Handle Problem Language Result Execution time Memory
1036007 2024-07-27T01:30:34 Z makanhulia Addk (eJOI21_addk) C++17
0 / 100
 700 ms 1228 KB 
#include <bits/stdc++.h>
#define nikah ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
const ll maxn = 1e5+7;
using namespace std;

ll n,q,k;
ll a[maxn], pref[maxn];

int main() {
  nikah
  cin>>n>>k;
  for (ll i=1; i<=n; i++) {
    cin>>a[i];
    pref[i] = a[i] + pref[i-1];
  }
  cin>>q;
  ll maks = 0;
  while (q--) {
    ll mode,l,r,m; cin>>mode>>l>>r>>m;
    if (mode == 1) continue;
    m = min(m, r-l+2 - m);
    ll ans = 0, re = l + m - 1;
    while (re <= r) {
      ans += (pref[re] - pref[l-1]);
      l++;
      re++;
    }
    maks = max(ans, maks);
  }
  cout<<maks<<endl;
}

Subtask #1
0 / 36.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 56.0

# Verdict Execution time Memory Grader output
1 Incorrect 93 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 700 ms 1228 KB Output isn't correct
2 Halted 0 ms 0 KB -