OJ Board

Test cases are weak, got acc with an internet code, it fails on this test (it handles multiple edges and/or self loops if there is any, I didnt checked the input, just generated a random one..):

29 91
20 25
28 19
13 10
23 1
2 25
2 19
26 8
1 2
17 16
9 13
3 12
14 1
4 16
28 6
26 9
4 3
22 8
17 23
15 ...

What is wrong with my code (WA), I am using Per idea:
Edit--

The random idea is very cool , my mistake was that the total of pairs must be at most m/2 on both rooms, not m/2 in each one.. Thank you Igor for clarifying that for me!

If I set the games as nodes, linking with the guys, on the worst case (50 guys) there will be +- 2000 games (vertexes), and +- 4000 links (edges)? Is that right? Edmons-Karp is VE², I guess it wont run on time :/ .. I used the wikipedia code and for 50 guys it is still running.. is there any ...

Humm, so if there is some lines that collide forming 3 I choose that? I did not understand very well, what happens in this case:

A B C D E F G H I J K L
1 1 1 1 1 1 1 1 1 1 1 0

- combine A, E, J
- combine B, F, K
- now C can only combine to remove 2, which one to choose? I can choose C, F, I for ...

Finally got accepted! The idea above is correct , I was making a little mistake on the complete search, I forgot to check in the arrangements to check if the third line is OK too, this test case was giving me wrong output:
The correct output is:
Thank you!

I cant get an AC, here are some input and my output:

5 7 8 9 6 1 9 0 9 8 4 6
5 7 8 9 6 1 9 0 9 8 9 6
1 2 3 4 1 1 1 4 1 1 4 1
1 1 1 4 1 1 1 4 1 1 4 1
1 1 1 1 1 1 1 1 1 1 1 0
1 1 1 1 1 1 1 1 1 1 1 2
1 7 6 2 9 7 1 0 2 3 4 9
0 0 0 0 0 0 0 0 0 0 0 0
1 1 1 1 1 1 1 1 1 1 1 1
2 2 2 2 2 2 2 2 2 2 2 2
3 3 3 ...

Not Found

The requested URL /contests/263-3e9bb4ed/index.html was not found on this server.
Apache Server at uva.onlinejudge.org Port 80

:/

I used the greedy approach, but its giving WA :/, I tried all the inputs here on this thread and its all ok. Could anyone post more inputs? Thank you!

I am doing a maximum spanning tree and then finding the min weight between the source and dest, and its giving me WA , is this correct?

Following little joey algorithm (Pells equations, etc..) I got a very fast result! I tryed all the test cases from mukeshtiwari and all answers are equal! But I am getting WA :o

EDIT---

Got accpeted finally! :P
The problem was that in the last result I was printing a blank line too :evil ...

arifcsecu wrote:Read previous post

Which one?

Got accepted, I was forgetting to clear the vectors

Anyway, I needed to change from cin to scanf! With cin I got TLE! This should be considered by the judges as cin/scanf should not interfere in the algorithm complexity and performance Should it???

I am getting WA, anybody could give me another sample input (one that may fail)?

I tried this:
And output is:
Just like the toolkit

I apparently found a very quick way to find x y and z with even numbers and odd numbers in the form 3 + 4k, all based on the 4/n thing that you can write it as a form of 2 unit fractions. But I would like to know how to calculate for prime numbers !

Thanks Igor!

After analyzing a bit more, here is a tip, you dont need to check if its power of 2! (You will need to change something with the formula)