# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
955806 | vjudge1 | Sparklers (JOI17_sparklers) | C++17 | 48 ms | 8660 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 long long mod = 1e9 + 7;
const long long maxn=1000+10;
const long long logn=25;
long long n,k,t;
long long x[maxn];
long long dp[maxn][maxn];
long long kol=0;
long long f(long long L,long long R)
{
if(L==0 && R==n-1)
{
return true;
}
if(dp[L][R]!=-1)
{
return dp[L][R];
}
long long rez=0;
if(R<n-1 && (x[R+1]-x[L])<=(R-L+1)*t*(2*kol))
{
rez=max(rez,f(L,R+1));
}
if(L>0 && (x[R]-x[L-1])<=(R-L+1)*t*(2*kol))
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |