# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
976123 | vjudge1 | Watching (JOI13_watching) | C++17 | 371 ms | 30556 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;
#define int long long
const int inf = 2e9;
int n, p, q, k;
vector<int> a, nxt1, nxt2;
vector<vector<int>> dp;
int f(int i, int b) {
if (i == n) {
return 0;
}
if (dp[i][b] != -1) {
return dp[i][b];
}
int ret = f(nxt1[i], b) + 1;
if (b > 0) ret = min(ret, f(nxt2[i], b - 1));
return dp[i][b] = ret;
}
signed main() {
cin >> n >> p >> q;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |