# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
862192 | 3omar_ahmed | Kamenčići (COCI21_kamencici) | C++17 | 98 ms | 344776 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
#define endl '\n'
#define all(a) a.begin() , a.end()
#define alr(a) a.rbegin() , a.rend()
int n, k;
string x;
vector < int > pre, suf;
int dp[353][353][353];
int solve(int l, int r, int red) {
int type = ((l - 1) + (n - r)) % 2;
if(red == k) {
return 0;
}
int opp = pre[l - 1] + suf[r + 1] - red;
if(opp == k) {
return 1;
}
if(dp[l][r][red] != -1) return dp[l][r][red];
dp[l][r][red] = 0;
if(type == 0) {
if(solve(l + 1, r, red + (x[l] == 'C')))
return dp[l][r][red] = 1;
if(solve(l, r - 1, red + (x[r] == 'C')))
return dp[l][r][red] = 1;
return 0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |