| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 619578 | bigo | Addk (eJOI21_addk) | C++14 | 58 ms | 2120 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define fori(i,sta,fin) for(ll i=sta;i<fin;i++)
#define all(a) a.begin(),a.end()
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> pii;
#define MOD 1000000007
int main() {
int n, k;
cin >> n >> k;
vector<int>vec(n);
for (int i = 0; i < n; i++)
cin >> vec[i];
vector<ll>pre(n);
pre[0] = vec[0];
for (int i = 1; i < n; i++)
pre[i] = pre[i - 1] + vec[i];
vector<ll>ppre(n);
ppre[0] = pre[0];
for (int i = 1; i < n; i++)
ppre[i] = ppre[i - 1] + pre[i];
vector<ll>suf(n);
suf[0] = vec[n-1];
for (int i = 1; i < n; i++)
suf[i] = suf[i - 1] + vec[n-i-1];
vector<ll>ssuf(n);
ssuf[0] = suf[0];
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||