Editorial for CCC '11 S2 - Multiple Choice

Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.

Author: Kirito

Scan the two lists into an array, and compare them.

Time Complexity: $\mathcal O(N)$ ~\mathcal O(N)~

Comments

-37

JohnstonLiu commented on Jan. 28, 2020, 6:31 p.m. ← edited →

You actually don't need to scan both lists into an array. You don't have to store the second list in an array. You can scan the first list only and then while you are reading the input for the next list you can compare it with the previous list.

This comment is hidden due to too much negative feedback. Show it anyway.

36

Tzak commented on Jan. 28, 2020, 11:09 p.m.

You actually don't need to do the problem

-1

JohnstonLiu commented on Feb. 12, 2020, 3:50 a.m. ← edit 3 →

I know this solution would work with Java. Not sure about other languages. Sorry about being unclear.

-1

JoJo_Cubano_13 commented on Dec. 31, 2023, 2:56 a.m. ← edited →

JohnstonLiu Don't worry, it works the same for each language. Or well, at least I did it in C++ exactly as you describe and I got an AC