OJ Board

Directories should remain unsorted. Print them in the order they appear in the input as in the sample I/O. Here is output from my AC code for your input. DATA SET 1: ROOT | dir3 | | dir2 | | file1 | | file2 | dir1 file1 file2 file3 file4 DATA SET 2: ROOT file1 file2 DATA SET 3: ROOT DATA SET 4: ROO...

I got WA the first 3 submissions. The judges input is fine and uDebug even explains in an earlier post how to handle reading the i/o. Here is some input I created that pointed out some cases I overlooked. Once I solved this i/o correctly, I got Accepted with NO fancy tricks. In my Accepted program I...

Hello all, First of all, you can do this problem without recursion. It is solve-able using recursion, but definitely not necessary. A recursive solution may not run in time. I will give you all a hint: use a stack! Also, if you think about the problem you will realize you just need a for loop with n...

Hey all, even though it is about 14 years later, I thought I'd let you know you can now submit problems with Python!

Hi. Could anyone please help me understand why I'm getting TLE for this problem when I pass all test data provided here. I am using Java and have done re-factoring on the code a few times now. Really starting to feel down about it. Any help would be appreciated. Thank you. import java.util.Arrays; ...

Input: 10 22 1 15 2 19 3 9 4 11 5 10 6 17 7 19 8 19 9 6 10 4 11 17 12 1 13 18 14 11 15 9 16 3 17 9 18 12 19 9 20 4 21 1 22 22 16 1 15 2 15 3 13 4 4 5 9 6 9 7 3 8 3 9 7 10 11 11 2 12 9 13 2 14 6 15 9 16 4 22 1 2 2 11 3 5 4 17 5 21 6 11 7 20 8 5 9 22 10 6 11 7 12 1 13 5 14 1 15 15 16 12 17 15 18 8 19...

Can someone PLEASE post more critical input? I get the same output as all of the above input and cannot figure out why WA. I get the same answers for all of the uDebug sample io as well. Thanks. Also, can someone with AC confrm this... input begin var s := (* some long comment*) ' a string literal o...

This problem was beyond frustrating. I kept getting WA and I knew my algorithm was efficient and correct. I also debugged on uDebug. Once I read the posts here and saw that BrianFry (thank you Brian!) said to add 1e-9 to your final percentage I finally got ACC. I wish the judge would just ask for th...

Some valid ACC I/O: 21 33 22 34 22 33 10 100 100 1000 5000 9000 1234000 123456000 5567 900000000 34556 10000000000000 43324234 85675676576575675675 8678678 345345345345345345353453453 235432435425 4364364653453646353643645656345646345 1 100000000000000000000000 234134 454765765674567457645 123421341...

Ok, this problem was a pain. I got WA 10 times before I got ACC due to I/O mistakes. If you got WA on this problem it is most likely due to I/O and not your LCS algorithm... and yes basic LCS is enough for this problem. Here is some I/O: abcd caabd a b b a a b a b aaaaaaaaaaaa aaaa bbbbbbb bbbbbbb x...

I solved this problem in not so great time using the C++ STL priority_queue data structure and Kruskal's algorithm... Kruskal's relies on using a set union data structure which is just an array that keeps track of the i_th vertex's parent in the minimum spanning tree. Mahade- Your nested loops have ...

I solved this problem with backtracking in 0.015. A hint to those who are lost: for each test case compute the length of the solution string by summing all the input string lengths and dividing by (number of lines / 2) and exploit this in your pruning.

I solved this in 0.065s using BFS in C. Consider this test case... 4 1 1 3 1 2 2 3 1 2 0 0 0 ACC output is: Case 1: The longest path from 1 has length 3, finishing at 2. The problem people are having with BFS is most likely due to not revisiting nodes. Although in a BFS you don't visit a node that h...

brianfry, Is it too much to tell you that I love you, lol? You are extremely helpful for so many of these problems. Anyways, I got 3 WA when I tried to submit the problem. Originally, read the input char by char using getchar() in the C standard library, assuming that there was one space between fie...

brainfry - Thank you so much for all of your sample IO. You have helped me so much over the past month or so since I started these problems. I really appreciate it. Anyways, to the rest of the people who read this... the description does not say the input will be integers, BUT I used a greedy algori...