# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
502838 | LucaIlie | Divide and conquer (IZhO14_divide) | C++17 | 150 ms | 10900 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 <iostream>
#include <algorithm>
#define MAX_N 100000
#define MAX_G 100000000000000
using namespace std;
struct val_and_poz {
int poz;
long long val;
bool operator < (const val_and_poz &a) const {
return val < a.val;
}
};
struct AIB {
long long aib[2 * MAX_N + 1];
void init() {
int i;
for ( i = 0; i <= 2 * MAX_N; i++ )
aib[i] = MAX_G + 1;
}
long long query( int i ) {
long long minG;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |