Submission #702129

#	Time	Username	Problem	Language	Result	Execution time	Memory
702129		shmad	Kamenčići (COCI21_kamencici)	C++17	70 / 70	1 ms	332 KiB

Main

#pragma GCC optimize("O3", "unroll-loops") // "Ofast" 	
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt") 

#include <bits/stdc++.h>

#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define f first
#define s second
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bit(x, i) ((x) >> (i) & 1)

using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;

const int N = 1e6 + 5, mod = 1e9 + 7;
const ll inf = 1e18 + 7;
const ld eps = 1e-6;

int n, k, cnt[N];
string s;

void solve () {
	cin >> n >> k >> s;
	int l = 0, r = n - 1, i = 0;
	while (l <= r) {
		if (s[l] == 'P') l++;
		else if (s[r] == 'P') r--;
		else if (l < r && s[l + 1] == 'C') l++, cnt[i]++;
		else if (l < r && s[r - 1] == 'C') r--, cnt[i]++;
		else l++, cnt[i]++;
		if (cnt[i] == k) {
			cout << (i ? "DA" : "NE") << '\n';
			return;
		}
		i ^= 1;
	}
	cout << '\n';
}

bool testcases = 0;

signed main() {
#ifdef ONLINE_JUDGE
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
#endif
	cin.tie(0) -> sync_with_stdio(0);
	int test = 1;
	if (testcases) cin >> test;
	for (int cs = 1; cs <= test; cs++) {
		solve();
	}
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 40 / 40