OJ Board

I have tested all the cases of the post and more on udebug.com (created by myself), however, I can't find bad answer from my code. Can anyone help me with a tricky edge case?... I am leaving my solution here: #include <bits/stdc++.h> using namespace std; #define ALL(v) (v).begin(), (v).end() #define...

How can this input be correct? 8 16 XYZ ZA AX BY BZ CX CY DZ YD XE ZE XY YZ ZX EF CA BD It says 8 slept parts but the connections (letter pairs) shows that there are 9 (9 different letters) parts. What should I do with this kind of inputs? Should I work with the first 8 letters and forget about awak...

Yeah. You are right. Thanks for your feedback!

Hi everyone. I just got an AC for this problem with a time of 0.999 (almost rejected for TL). So I am looking for advices on how could I improve the performance of my code. #include <iostream> #include <string> #include <map> using namespace std; int main(int argc, char const *argv[]) { int s, b, l,...

Wow... I was counting the positve attempts too. Thanks for pointing it out.

I saw that for this test:

4
rommel
romlnptuyq

The solution should be:

Round 4
You chickend out.

Why is that?. Shouldn't be "You lose."?. Because the number of attempts > 8.