# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
788152 | rainboy | Fruits (NOI22_fruits) | C11 | 1079 ms | 17868 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 <stdio.h>
#define N 400000
long long max(long long a, long long b) { return a > b ? a : b; }
int main() {
static int aa[N], cc[N];
static long long ss[N + 1];
static char used[N];
static int kk[N + 1], xx[N], yy[N], dd[N];
static long long dp[N];
int n, k, i, j, l, a, x, y, d;
long long z;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &aa[i]), aa[i]--;
if (aa[i] >= 0)
used[aa[i]] = 1;
}
for (a = 0; a < n; a++)
scanf("%d", &cc[a]);
k = 0;
for (a = 0; a < n; a++) {
kk[a] = k;
if (!used[a])
ss[k + 1] = ss[k] + cc[a], k++;
}
kk[n] = k;
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |