# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1106640 | Canuc80k | Potatoes and fertilizers (LMIO19_bulves) | C++17 | 99 ms | 23240 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;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
const ll N = 1e6 + 1;
ll n;
ll a[N], b[N];
namespace sub1 {
const ll N = 1e6 + 1;
ll f[N];
void solve() {
ll res = 0;
for (int i = 1; i <= n; i ++) f[i] = f[i - 1] + (a[i] - b[i]);
for (int i = 1; i <= n; i ++) res += abs(f[i]);
cout << res;
}
}
namespace sub3 {
const ll N = 3e3 + 1;
ll d[N];
ll f[(ll)3e4 + 1], of[(ll)3e4 + 1];
void solve() {
for (int i = 1; i <= n; i ++) d[i] = d[i - 1] + a[i] - 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |