Submission #517036

#TimeUsernameProblemLanguageResultExecution timeMemory
517036Marslai24Kamenčići (COCI21_kamencici)C++17
10 / 70
1088 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 = 350, K = __lg(N) + 1; int n, k; string s; int pre[N]{}; bool solve(int l = 0, int r = n - 1, int val = 0){ if(l > r)return val < k; int other = pre[n - 1] - pre[r] - (l ? pre[l - 1] : 0) - val; return !solve(l + 1, r, other) && !solve(l, r - 1, other); } signed main(){ setIO(); cin >> n >> k >> s; for(int i = 0; i < n; i++){ pre[i] = (s[i] == 'C') + (i ? pre[i - 1] : 0); } cout << (solve() ? "DA\n" : "NE\n"); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...