# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
37687 | MatheusLealV | Watching (JOI13_watching) | C++14 | 1000 ms | 34932 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 int long long
#define N 2050
#define f first
#define s second
using namespace std;
typedef pair<int, int> pii;
int n, p, q, v[N];
int prox(int i, int w)
{
int ini = i, fim = n, mid, best;
while(fim >= ini)
{
mid = (ini + fim)/2;
if(v[mid] - v[i] + 1 <= w) best = mid, ini = mid + 1;
else fim = mid - 1;
}
return best + 1;
}
struct ss
{
int a, b, c;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |