# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
44368 | RayaBurong25_1 | Worst Reporter 3 (JOI18_worst_reporter3) | C++17 | 982 ms | 9332 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 <algorithm>
int D[500005];
int E[500005];
int T;
typedef struct node node;
struct node
{
int i;
};
node V[500005];
int comp1(node element, int value)
{
return (T/E[element.i]*E[element.i] - element.i) < value;
}
int comp2(int value, node element)
{
return (T/E[element.i]*E[element.i] - element.i) > value;
}
int main()
{
int N, Q;
scanf("%d %d", &N, &Q);
int i;
D[0] = 1;
E[0] = 1;
for (i = 1; i <= N; i++)
{
scanf("%d", &D[i]);
if (i == 1)
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... |