Submission #516893

#TimeUsernameProblemLanguageResultExecution timeMemory
516893Marslai24Kamenčići (COCI21_kamencici)C++17
30 / 70
1089 ms312 KiB
#include <bits/stdc++.h> using namespace std; #define int long long // a.k.a. TLE creator #define all(x) x.begin(), x.end() template<class A, class B> istream& operator >>(istream &o, pair<A, B> &x){return o >> x.first >> x.second;} template<class A, class B> ostream& operator <<(ostream &o, pair<A, B> &x){return o << x.first << ' ' << x.second << ' ';} void setIO(){ios::sync_with_stdio(false); cin.tie(0);} const int INF = INT_MAX, MOD = 998244353, N = 1e6 + 2, K = __lg(N) + 1; int n, k; string s; bool solve(int l = 0, int r = n - 1, int me = 0, int op = 0){ if(me >= k)return false; if(op >= k)return true; if(l > r)return me < k; if(l == r)return me + s[l] < k; if(solve(l + 2, r, me + s[l], op + s[l + 1]) && solve(l + 1, r - 1, me + s[l], op + s[r]))return true; if(solve(l, r - 2, me + s[r], op + s[r - 1]) && solve(l + 1, r - 1, me + s[r], op + s[l]))return true; return false; } signed main(){ setIO(); cin >> n >> k >> s; for(auto &i : s)i = (i == 'C'); cout << (solve() ? "DA\n" : "NE\n"); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...