# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
655475 | 2022-11-04T14:31:05 Z | Kamenčići (COCI21_kamencici) | C++17 | 1 ms | 324 KB |
#include<bits/stdc++.h> using namespace std; int n,k; vector<vector<int>> dp; string s; bool solve(int l, int r, int cnt1,int cnt2){ if (cnt1 >= k) return 0; if (cnt2 >= k) return 1; if (~dp[l][r]) return dp[l][r]; if (!solve(l+1,r,cnt2,cnt1+(s[l]=='C')) || !solve(l,r-1,cnt2,cnt1+(s[r]=='C'))) return dp[l][r] = 1; return dp[l][r] = 0; } int main(){ cin.tie(0)->sync_with_stdio(0); cin >> n >> k >> s; dp.resize(n,vector<int>(n,-1)); if (solve(0,n-1,0,0)) cout << "DA"; else cout << "NE"; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 324 KB | Output is correct |
3 | Correct | 1 ms | 288 KB | Output is correct |
4 | Correct | 1 ms | 320 KB | Output is correct |
5 | Incorrect | 1 ms | 320 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 324 KB | Output is correct |
3 | Correct | 1 ms | 288 KB | Output is correct |
4 | Correct | 1 ms | 320 KB | Output is correct |
5 | Incorrect | 1 ms | 320 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 324 KB | Output is correct |
3 | Correct | 1 ms | 288 KB | Output is correct |
4 | Correct | 1 ms | 320 KB | Output is correct |
5 | Incorrect | 1 ms | 320 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |