# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1084870 | serpent_121 | Bank (IZhO14_bank) | C++17 | 147 ms | 8788 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 <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <numeric>
#include <cmath>
#include <cstring>
#include <climits>
#include <stack>
#include <bitset>
typedef long long ll;
using namespace std;
#define fst first
#define snd second
// kazakh oly
// https://oj.uz/problem/view/IZhO14_bank
int main() {
ll n, m; cin >> n>> m;
ll a[n]; ll b[m]; ll pref[n];
for (int i = 0 ; i<n; i++) {
cin >> a[i];
if (i==0) pref[0] = a[0];
else pref[i] = pref[i-1] + a[i];
}
for (int i = 0; i<m; i++) cin >> b[i];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |