Submission #64804006

Source Code Expand

#include <iostream>
#include <vector>
using namespace std;
#define int long long
const int MOD = 1e9;


bool helper(char ch1, char ch2) {
    return ch1 == '.' || ch1 == '?' || ch2 == '?' || ch2 == '.';
}

signed main() {
    int n, k;
    cin >> n >> k;
    string s; cin >> s;

    if(n == 1) {
        if(k == 1) cout << 'o' << endl;
        else cout << '?' << endl;
    }

    else {

        int cnt = 0;

        for(int i=0;i<n;i++) {
            if(i && s[i] == '?' && (s[i-1] == 'o' || s[i+1] == 'o')) s[i] = '.'; 
            else if(i == 0 && s[i] == '?' && s[i+1] == 'o') s[i] = '.';
            else if(i == n-1 && (s[i] == '?' || s[i-1] == 'o')) s[i] = '.';
        } 

        for(int i=0;i<n;i++) {
            if(s[i] == '?' || s[i] == 'o') cnt++;
        }

        if(k == cnt) {
            for(int i=1;i<n-1;i++) {
                if(i && s[i] == '?' && helper(s[i+1], s[i-1])) s[i] = 'o'; 
                else if(i == 0 && s[i] == '?' && helper(s[i+1], s[i+1])) s[i] = 'o';
                else if(i == n-1 && s[i] == '?' && helper(s[i-1], s[i-1])) s[i] = 'o';
            }
        }

        cout << s << endl;

    }
}

Submission Info

Submission Time
Task D - Logical Filling
User sivasaran2003
Language C++ 17 (gcc 12.2)
Score 0
Code Size 1193 Byte
Status WA
Exec Time 5 ms
Memory 3784 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 1
WA × 2
AC × 14
WA × 29
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_random_00.txt, 01_random_01.txt, 01_random_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 01_random_07.txt, 01_random_08.txt, 01_random_09.txt, 01_random_10.txt, 01_random_11.txt, 01_random_12.txt, 01_random_13.txt, 01_random_14.txt, 01_random_15.txt, 01_random_16.txt, 01_random_17.txt, 01_random_18.txt, 01_random_19.txt, 01_random_20.txt, 01_random_21.txt, 01_random_22.txt, 01_random_23.txt, 01_random_24.txt, 01_random_25.txt, 01_random_26.txt, 01_random_27.txt, 01_random_28.txt, 01_random_29.txt, 01_random_30.txt, 01_random_31.txt, 01_random_32.txt, 01_random_33.txt, 01_random_34.txt, 01_random_35.txt, 01_random_36.txt, 01_random_37.txt, 01_random_38.txt, 01_random_39.txt
Case Name Status Exec Time Memory
00_sample_00.txt WA 1 ms 3444 KiB
00_sample_01.txt WA 1 ms 3532 KiB
00_sample_02.txt AC 1 ms 3464 KiB
01_random_00.txt AC 2 ms 3540 KiB
01_random_01.txt WA 5 ms 3624 KiB
01_random_02.txt AC 5 ms 3620 KiB
01_random_03.txt WA 1 ms 3544 KiB
01_random_04.txt WA 2 ms 3652 KiB
01_random_05.txt AC 3 ms 3608 KiB
01_random_06.txt AC 4 ms 3652 KiB
01_random_07.txt WA 4 ms 3592 KiB
01_random_08.txt WA 1 ms 3548 KiB
01_random_09.txt AC 4 ms 3592 KiB
01_random_10.txt AC 4 ms 3688 KiB
01_random_11.txt AC 4 ms 3628 KiB
01_random_12.txt AC 4 ms 3568 KiB
01_random_13.txt WA 4 ms 3784 KiB
01_random_14.txt WA 4 ms 3584 KiB
01_random_15.txt WA 4 ms 3552 KiB
01_random_16.txt AC 4 ms 3696 KiB
01_random_17.txt WA 4 ms 3600 KiB
01_random_18.txt WA 4 ms 3592 KiB
01_random_19.txt WA 4 ms 3588 KiB
01_random_20.txt AC 4 ms 3484 KiB
01_random_21.txt AC 3 ms 3692 KiB
01_random_22.txt WA 4 ms 3692 KiB
01_random_23.txt AC 1 ms 3548 KiB
01_random_24.txt AC 1 ms 3656 KiB
01_random_25.txt WA 1 ms 3560 KiB
01_random_26.txt WA 1 ms 3496 KiB
01_random_27.txt WA 5 ms 3664 KiB
01_random_28.txt WA 4 ms 3652 KiB
01_random_29.txt WA 4 ms 3588 KiB
01_random_30.txt WA 5 ms 3592 KiB
01_random_31.txt WA 4 ms 3652 KiB
01_random_32.txt WA 4 ms 3624 KiB
01_random_33.txt WA 4 ms 3584 KiB
01_random_34.txt WA 4 ms 3568 KiB
01_random_35.txt WA 4 ms 3648 KiB
01_random_36.txt WA 4 ms 3592 KiB
01_random_37.txt WA 4 ms 3592 KiB
01_random_38.txt WA 4 ms 3692 KiB
01_random_39.txt WA 4 ms 3620 KiB