oj.uz

답안 #525889

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
525889 2022-02-13T05:57:18 Z BackNoob Kamenčići (COCI21_kamencici) C++14
70 / 70
 45 ms 44528 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1) 
#define TASK "task"
#define sz(s) (int) (s).size()

using namespace std;
const int mxN = 357;
const int inf = 1e9 + 277;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 7;
const int base = 307;
const int LOG = 20;
 
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
	if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
	if (a < b) {a = b; return true;} return false;
}

int n , k;
string s;
bool dp[mxN][mxN][mxN];
bool vis[mxN][mxN][mxN];
int pre[mxN];
int suf[mxN];

bool sol(int l , int r , int have)
{
	if(l > r) {
		if(have >= k) return false;
		return true;
	}
	int x = pre[l - 1] + suf[r + 1] - have;
	if(have >= k) return false;
	if(x >= k) return true;

	bool &res = dp[l][r][have];
	if(vis[l][r][have] == true) return res;
	vis[l][r][have] = true;


	res |= !sol(l + 1 , r , x);
	res |= !sol(l , r - 1 , x);
	return res;
}

void solve()
{
	cin >> n >> k;
	cin >> s;

	for(int i = 1 ; i <= n ; i++) pre[i] = pre[i - 1] + (s[i - 1] == 'C');
	for(int i = n ; i >= 1 ; i--) suf[i] = suf[i + 1] + (s[i - 1] == 'C');

	if(sol(1 , n , 0) == true) cout << "DA";
	else cout << "NE";
}
 
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen(TASK".in" , "r" , stdin);
    //freopen(TASK".out" , "w" , stdout);
    
    int tc = 1;
    //cin >> tc;
    while(tc--) {
    	solve();
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 332 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 580 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 844 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 844 KB Output is correct
12 Correct 1 ms 1356 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 580 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 844 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 844 KB Output is correct
12 Correct 1 ms 1356 KB Output is correct
13 Correct 1 ms 1612 KB Output is correct
14 Correct 45 ms 42560 KB Output is correct
15 Correct 11 ms 14284 KB Output is correct
16 Correct 38 ms 27076 KB Output is correct
17 Correct 34 ms 44528 KB Output is correct
18 Correct 14 ms 17972 KB Output is correct