Blog entries - Codeforces

#	User	Rating
1	tourist	4009
2	jiangly	3821
3	Benq	3736
4	Radewoosh	3631
5	jqdai0815	3620
6	orzdevinwang	3529
7	ecnerwala	3446
8	Um_nik	3396
9	ksun48	3388
10	gamegame	3386

#	User	Contrib.
1	cry	164
1	maomao90	164
3	Um_nik	163
4	atcoder_official	161
5	-is-this-fft-	158
6	awoo	157
7	adamant	156
8	TheScrasse	154
8	nor	154
10	Dominater069	153

Hey MikeMirzayanov, don't even know if you will read this comment or not, but still hope that. Today I received mail regarding there is similarity between my code and a bucnch of usernames/submissions whom I don't even know. I have the code all by myself in the ongoing contest in my VS Code editior only.

Codeforces Round 964 (Div. 4) Problem D Slavic's Exam : 1999D - Slavic's Exam My solution was : 274868344 code :

My Code

string s;
        string s2;
        cin >> s >> s2;
        vector<bool> ch(s2.length(), 0);
        int i1 = 0;
        for (int i = 0; i < s.length(); i++)
        {
            if (i1 >= s2.length())
            {
                break;
            }
            if (s[i] == s2[i1])
            {
                i1++;
            }
            if (s[i] == '?')
            {
                s[i] = s2[i1];
                i1++;
            }
        }
 
        i1 = 0;
        for (int i = 0; i < s.length(); i++)
        {
            if (i1 >= s.length())
            {
                break;
            }
            if (s[i] == s2[i1])
            {
                ch[i1] = 1;
                i1++;
            }
        }
        for (int i = 0; i < s.length(); i++)
        {
            if (s[i] == '?')
            {
                s[i] = 'a';
            }
        }
        if (ch[s2.length() - 1])
        {
            yes;
            cout << s << endl;
        }
        else
        {
            no;
        }

Here is what my Logic was: 1. Created a boolean vector for storing the second string's letters' presence in first string. 2. 1st for loop through 1st string increased second string's pointerif second string's letter is in first string or if first string's char is '?' then replaced '?' with second string's letter and incremented second string's pointer. 3. 2nd for loop: here I checked for string s2 in string s1 and as I found the letters of s2 in s1, I marked the boolean vectors respective index as true. 4. in the 3rd for loop: if there were any remaining '?'s in s1, i replaced them with 'a' (well , most of coders who want to remove some '?' and replace it with only lowercase letters will first think of 'a' Or 'z' and this is the only thing that you system seems to give me the tag of suspicios submission ) 5. At last I just needed to check if the boolean vector is all marked with true or not(based on my code if last index of vector is true -> whole vector is true).

I don't use any online IDE for running the code on my end before submission, i use VS code.

The 4th step mentioned above was what was missing from my 1st submission where I divided that solution into two parts(which wasn't needed as I later figured): 274830513

Previous WA Code

        string s;
        string s2;
        cin >> s >> s2;
        if (count(s.begin(), s.end(), '?') >= s2.length())
        {
            int i1 = 0;
            for (int j = 0; j < s.length(); j++)
            {
                if (i1 >= s2.length())
                {
                    i1 = 0;
                }
                if (s[j] == '?')
                {
                    s[j] = s2[i1];
                    i1++;
                }
            }
            yes;
            cout << s << endl;
            continue;
        }
 
        int i1 = 0;
        for (int j = 0; j < s.length(); j++)
        {
            if (i1 >= s2.length())
            {
                break;
            }
            if (s[j] == s2[i1])
            {
                // ch[i1] = 1;
                i1++;
                continue;
            }
            if (s[j] == '?')
            {
                s[j] = s2[i1];
                i1++;
            }
        }
        vector<bool> ch(s2.length(), 0);
        i1 = 0;
        for (int i = 0; i < s.length(); i++)
        {
            if (i1 >= s2.length())
            {
                break;
            }
            // if (s[i] == s2[i1])
            // {
            //     ch[i1] = 1;
            //     i1++;
            // }
            if (s[i] == s2[i1])
            {
                ch[i1] = 1;
                i1++;
            }
        }
        if (ch[s2.length() - 1])
        {
            yes;
            cout << s << endl;
        }
        else
        {
            no;
        }

And finally come on man, this wasn't that hard problem to come with solution , Just had to skip the letters in s2 and replace the '?'s in s1, that's it. I request you to got through my profile once and see for yourself If you think I can cheat on this code or Not. I don't think there was any other way for solving this particular problem other thatn a greedy approach (I am pupil, so 'I THINK'). I hope the admins read this comment of mine and remove the skipped tag from my solutions.

Full text and comments »

chaserxJ's blog