답안 #516788

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
516788 2022-01-22T06:24:33 Z Marslai24 Kamenčići (COCI21_kamencici) C++17
0 / 70
1 ms 316 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 = 1e6 + 2, K = __lg(N) + 1;

signed main(){
    setIO();
    int n, k;
    cin >> n >> k;
    deque<char> s;
    for(int i = 0; i < n; i++){
        char c;
        cin >> c;
        s.push_back(c);
    }
    int cnt[2]{};
    for(int i = 0; i < n; i++){
        if(cnt[0] >= k || cnt[1] >= k)break;
        if(s.front() == 'P'){
            s.pop_front();
        }else if(s.back() == 'P'){
            s.pop_back();
        }else{
            cnt[i & 1]++;
            s.pop_front();
        }
    }
    cout << (cnt[0] < k ? "DA" : "NE");
}


# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Incorrect 1 ms 316 KB Output isn't correct
7 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Incorrect 1 ms 316 KB Output isn't correct
7 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Incorrect 1 ms 316 KB Output isn't correct
7 Halted 0 ms 0 KB -