# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
917137 | allvik | Sparklers (JOI17_sparklers) | C++17 | 2259 ms | 262144 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 <iostream>
#include <vector>
using namespace std;
#define int long long
const int MAXN = 5000;
int dp[MAXN][MAXN];
int t;
bool check(int n, int k, vector <int>& a, int s) {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
dp[i][j] = 0;
}
}
dp[k][k] = 1;
for (int len = 1; len <= n; ++len) {
for (int l = 0; l + len - 1 < n; ++l) {
int r = l + len - 1;
if (dp[l][r] == 0) continue;
if (r < n - 1 && (a[r + 1] - a[l] + 2 * s - 1) / (2 * s) <= (r - l + 1) * t) dp[l][r + 1] = 1;
if (l && (a[r] - a[l - 1] + 2 * s - 1) / (2 * s) <= (r - l + 1) * t) dp[l - 1][r] = 1;
}
}
return dp[0][n - 1];
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |