# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
366311 | idk321 | Watching (JOI13_watching) | C++11 | 1086 ms | 16256 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;
typedef long long ll;
const int N = 2005;
int dp[N][N];
int n,p, q;
int a[N];
bool poss(ll w)
{
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N; j++) dp[i][j] = 0;
}
for (int i = p; i >= 0; i--)
{
for (int j = q; j >= 0; j--)
{
if (dp[i][j] == n)
{
dp[0][0] = n;
} else
{
if (i != 0)
{
int first = a[dp[i][j]];
auto it = upper_bound(a, a + n, first + w - 1);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |