oj.uz

답안 #517043

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
517043 2022-01-22T12:38:55 Z Marslai24 Kamenčići (COCI21_kamencici) C++17
0 / 70
 118 ms 338720 KB 
#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 = 351, K = __lg(N) + 1;

int n, k;
string s;
int dp[N][N][N], pre[N]{};

bool solve(int l = 0, int r = n - 1, int val = 0){
    if(~dp[l][r][val])return dp[l][r][val];
    if(val >= k){
        dp[l][r][val] = 0;
        return false;
    }
    if(l > r)return val < k;
    int other = pre[n - 1] - pre[r] - (l ? pre[l - 1] : 0) - val;
    dp[l][r][val] = (!solve(l + 1, r, other) || !solve(l, r - 1, other));
    return dp[l][r][val];
}

signed main(){
    setIO();
    memset(dp, -1, sizeof dp);
    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");
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 118 ms 338720 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 118 ms 338720 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 118 ms 338720 KB Output isn't correct
2 Halted 0 ms 0 KB -