# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
56532 | luciocf | 구경하기 (JOI13_watching) | C++14 | 1044 ms | 32852 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>
using namespace std;
const int MAXN = 2010;
typedef long long ll;
ll n, p, q;
ll num[MAXN];
ll dp[MAXN][MAXN];
ll busca2(ll k)
{
if (k > num[n]) return n;
ll ini = 1LL, fim = n, ans;
while (ini <= fim)
{
int mid = (ini+fim)>>1;
if (num[mid] <= k) ans = mid, ini = mid+1;
else fim = mid-1;
}
return ans;
}
bool ok(ll w)
{
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |