# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22896 | pichulia | Fully Generate (KRIII5_FG) | C++98 | 246 ms | 3932 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 M 1000000007
#define X 60009
int m;
int gl;
long long int n;
long long int a[X+1][2];
long long int g[X+1][2];
long long int gs[X+1];
int get_index(long long int x)
{
int l, r, mid;
l = 1; r = m;
while (l < r) {
mid = (l + r) / 2;
if (a[mid][0] <= x) {
if (a[mid][1] > x)
return mid;
l = mid + 1;
}
else
{
r = mid;
}
}
return l;
}
void inil()
{
long long int i, j, k, l;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |