oj.uz

답안 #862094

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
862094 2023-10-17T14:04:32 Z Youssif_Elkadi Kamenčići (COCI21_kamencici) C++17
30 / 70
 52 ms 107860 KB 
#include <bits/stdc++.h>
using namespace std;
const long long N = 51, mod = 1e9 + 7, base = 31;
int dp[N][N][N][N][2];
int n, k;
string x;
int solve(int l, int r, int rem1, int rem2, int t)
{
    if (rem1 == 0)
        return 0;
    if (rem2 == 0)
        return 1;
    if (~dp[l][r][rem1][rem2][t])
        return dp[l][r][rem1][rem2][t];
    if (t)
        return dp[l][r][rem1][rem2][t] = min(solve(l + 1, r, rem1, rem2 - (x[l] == 'C'), 0), solve(l, r - 1, rem1, rem2 - (x[r] == 'C'), 0));
    else
        return dp[l][r][rem1][rem2][t] = max(solve(l + 1, r, rem1 - (x[l] == 'C'), rem2, 1), solve(l, r - 1, rem1 - (x[r] == 'C'), rem2, 1));
}
int main()
{
    memset(dp, -1, sizeof dp);
    cin >> n >> k;
    cin >> x;
    cout << (solve(0, n - 1, k, k, 0) ? "DA" : "NE");
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 53336 KB Output is correct
2 Correct 6 ms 53340 KB Output is correct
3 Correct 6 ms 53340 KB Output is correct
4 Correct 7 ms 53340 KB Output is correct
5 Correct 6 ms 53176 KB Output is correct
6 Correct 7 ms 53336 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 53336 KB Output is correct
2 Correct 6 ms 53340 KB Output is correct
3 Correct 6 ms 53340 KB Output is correct
4 Correct 7 ms 53340 KB Output is correct
5 Correct 6 ms 53176 KB Output is correct
6 Correct 7 ms 53336 KB Output is correct
7 Correct 8 ms 53340 KB Output is correct
8 Correct 7 ms 53340 KB Output is correct
9 Correct 7 ms 53336 KB Output is correct
10 Correct 7 ms 53340 KB Output is correct
11 Correct 8 ms 53176 KB Output is correct
12 Correct 7 ms 53340 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 53336 KB Output is correct
2 Correct 6 ms 53340 KB Output is correct
3 Correct 6 ms 53340 KB Output is correct
4 Correct 7 ms 53340 KB Output is correct
5 Correct 6 ms 53176 KB Output is correct
6 Correct 7 ms 53336 KB Output is correct
7 Correct 8 ms 53340 KB Output is correct
8 Correct 7 ms 53340 KB Output is correct
9 Correct 7 ms 53336 KB Output is correct
10 Correct 7 ms 53340 KB Output is correct
11 Correct 8 ms 53176 KB Output is correct
12 Correct 7 ms 53340 KB Output is correct
13 Runtime error 52 ms 107860 KB Execution killed with signal 11
14 Halted 0 ms 0 KB -