| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1178132 | vannn168 | Kamenčići (COCI21_kamencici) | C++20 | 0 ms | 324 KiB |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0), cin.tie(0);
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> a(n);
deque<int> dq;
for(int i = 0; i < n; ++i) {
a[i] = (s[i] == 'C');
dq.push_back(a[i]);
}
vector<int> op(2);
for(int i = 0; i < n; ++i) {
op[i % 2] += min(dq.front(), dq.back());
if(!dq.front()) dq.pop_front();
else dq.pop_back();
if(op[i % 2] >= k) {
cout << ((i & 1) ? "DA" : "NE") << '\n';
return 0;
}
}
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
