제출 #1184265

#제출 시각아이디문제언어결과실행 시간메모리
1184265al95ireyizKamenčići (COCI21_kamencici)C++20
0 / 70
0 ms580 KiB
//*** Bismillah ***// // It's the evening of another day. And the end of mine... #pragma GCC optimize("O3") #include <bits/stdc++.h> using namespace std; #if !defined(ONLINE_JUDGE) and !defined(EVAL) #include "template/debug.h" #else #define d(x...) #endif #define ll long long const ll INF = 1e9; const ll INFL = 1e18; const ll MOD = 1e9 + 7; const ll maxn = 350 + 5; ll n,m,k=0; bool dp[maxn][maxn][maxn], vis[maxn][maxn][2]; ll a[maxn], ps[maxn]; ll f(ll l, ll r, ll c){ if(vis[l][r][c]) return dp[l][r][c]; vis[l][r][c] = 1; ll ot = ps[l-1] + (ps[n] - ps[r]) - c; if(c >= m) return dp[l][r][c] = 0; if(ot >= m) return dp[l][r][c] = 1; ll l1 = f(l+1, r, ot); ll l2 = f(l, r-1, ot); return dp[l][r][c] = (!l1 or !l2); } void _(){ cin>>n>>m; char c; for(ll i=1;i<=n;i++) cin>>c, a[i] = (c == 'C'), ps[i] = ps[i-1] + a[i]; if(f(1, n, 0)) cout<<"DA\n"; else cout<<"NE\n"; } signed main(){ auto testcaseruntime=clock(); cin.tie(0)->sync_with_stdio(0); ll t=1; // cin>>t; while(t--){ _(); } cerr<<"\n\033[1;31mTime: \033[1;30m" <<(double)(clock()-testcaseruntime)/1000000<<"\033[1;32m seconds\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...