# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
745319 | rainboy | Exam (eJOI20_exam) | C11 | 28 ms | 3072 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 100000
int max(int a, int b) { return a > b ? a : b; }
int main() {
static int aa[N], bb[N];
int n, same, i, j, b, k, good;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &aa[i]);
for (i = 0; i < n; i++)
scanf("%d", &bb[i]);
same = 1;
for (i = 1; i < n; i++)
if (bb[i] != bb[i - 1]) {
same = 0;
break;
}
if (same) {
b = bb[0], k = 0;
for (i = 0; i < n; i++)
if (aa[i] <= b) {
j = i;
good = 0;
while (j < n && aa[j] <= b)
if (aa[j++] == b)
good = 1;
if (good)
k += j - i;
i = j;
}
printf("%d\n", k);
}
return 0;
}
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... |