# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1056996 | Thanhs | Kamenčići (COCI21_kamencici) | C++17 | 19 ms | 175512 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.
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define endl '\n'
#define fastIO ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define setmin(x, y) x = min((x), (y))
#define setmax(x, y) x = max((x), (y))
#define sqr(x) ((x) * (x))
#define fi first
#define se second
#define all(x) x.begin(), x.end()
// mt19937 hdp(chrono::high_resolution_clock::now().time_since_epoch().count());
// int rand(int l, int r){return l + ((hdp() % (r - l + 1)) + r - l + 1) % (r - l + 1);}
const int NM = 350 + 5;
const int inf = 1e9;
string s;
int pf[NM], sf[NM], n, k;
signed dp[NM][NM][NM];
bool DP(int l, int r, int c)
{
if (~dp[l][r][c])
return dp[l][r][c];
dp[l][r][c] = 0;
int o = pf[l - 1] + sf[r + 1];
if (c + (s[l] == 'C') < k)
dp[l][r][c] |= !DP(l + 1, r, o);
if (c + (s[r] == 'C') < k)
dp[l][r][c] |= !DP(l, r + 1, o);
return dp[l][r][c];
}
void solve()
{
memset(dp, -1, sizeof dp);
cin >> n >> k >> s;
s = ' ' + s;
for (int i = 1; i <= n; i++)
pf[i] = pf[i - 1] + (s[i] == 'C');
for (int i = n; i >= 1; i--)
sf[i] = sf[i + 1] + (s[i] == 'C');
cout << (DP(1, n, 0) ? "DA" : "NE");
}
signed main()
{
fastIO
if (fopen("in.txt", "r"))
{
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
}
int tc = 1;
// cin >> tc;
while (tc--)
solve();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |