# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1026862 | Shadxwed | Pilot (NOI19_pilot) | C11 | 1076 ms | 1932 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>
#include <stdlib.h>
int main() {
int n, q;
scanf("%d %d", &n, &q);
int *arr = malloc(n*sizeof(int));
for(int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
int p, counter = 0, res;
for(int i = 0; i < q; i++) {
res = 0;
scanf("%d", &p);
for(int j = 0; j < n; j++) {
if(p >= arr[j]) {
counter++;
} else {
res += counter*(counter+1)/2;
counter = 0;
}
}
res += counter*(counter+1)/2;
counter = 0;
printf("%d\n", res);
}
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... |
# | 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... |