# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
869518 | JoksimKaktus | Kamenčići (COCI21_kamencici) | C++17 | 0 ms | 348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
int n,k;
string s;
cin >> n >> k >> s;
int l = 0;
int r = n-1;
int k1 = 0;
int k2 = 0;
bool antun = true;
while(l <= r){
if(antun){
antun = false;
if(s[l] == 'P'){
l++;
}else if(s[r] == 'P'){
r--;
}else{
if(s[l+1] == 'P'){
r--;
}else{
l++;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |