# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
46857 | MatheusLealV | Library (JOI18_library) | C++17 | 534 ms | 844 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 <bits/stdc++.h>
#define Nmax 1005
#include "library.h"
using namespace std;
#define f first
#define s second
typedef pair<int, int> pii;
int n, used[Nmax], conta = 0, ans[Nmax], ans2[Nmax];
int esq[Nmax], dir[Nmax];
int lower_bound(int x)
{
int ini = 1, fim = x - 1, mid, best = -1;
while(fim >= ini)
{
mid = (ini + fim)/2;
vector<int> v (n);
for(int i = 1; i <= mid; i++) v[i - 1] = 1;
v[x - 1] = 1;
int q = ans[mid] - Query(v);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |