OJ Board

Consider this input: d := 45 - 86 e := 22 - 9 j := 92 - f c := 49 - 91 e := 12 - 45 j := 24 + f e := f - 90 f := 44 - 91 END g := 68 + 97 c := 40 + 75 b := 64 + a j := 7 - b i := a + 52 j := 41 + 19 b := 28 - b a := a + b END The first program does not access the variables "a" and "b" at all, so the...

OK, I've figured out how for a given M to split the sum into two parts. The first part can be cached independent of M (for given p), the other part is dependent on M, and has to be recalculated for every M (again, for given fixed p). I get TLE. Is this the approach you took? Do you answer each query...

OK, I do a BFS with bitmasks, each word being encoded with an at most 50-bit unsigned long long... Result: TLE. Question: what else needs to be done apart from BFS?

Ok, we've got tone-tone-semitone-ton-tone-tone-semitone thing. Now, what is, say, "FIFTH UP"? Does it mean, starting from the current "starting" note, keep going to the next note in the scale while also adding +2 to the counter if the transition was "tone". and +1 is the transition was semitone, and...

The judge I/O does not adhere to the problem description: there are duplicate points! I checked this with assert. Once I remove duplicates, my algo got Accepted.

Yes, alexiago is right! Just got Accepted. Although this rule is not written very well in the problem description. Such a pity!

Are there multiple runs? So, what is the input format? What is the exact format if numPatients = 100? 100 won't fit into two columns, but two columns for patient ID number is what is shown in sample I/O.

If two patients emerge from surgery at the same time, the patient with the lower number will be the first assigned to a recovery room bed. (If in addition the two patients entered surgery at the same time, the one first on the roster is first assigned a bed.) Here, "lower number" means lower number...

I believe judge's input is incomplete. I got Accepted, but my output differs from the above in 23 cases from the 100.

Out of 100 Brian's cases, my code produces 77 correctly. My algo is as follows. For the second test case, for instance, my code produces 13902, three minutes short of the correct answer. How the staff members get assigned to jobs? I do it in rounds. First, each staff members selects herself a reques...

Huffman encoding for the first sample input is (code and probabilities) However, this does not even match the sample output. What's wrong with using Huffman here?

Ok, from Cho's hints I've been able to go as far as this:

a_n = \sum_{k=1}^{n}b_{n,k},
b_{n,k} = \sum_{t=1}^{n-k}(t+k-1)b_{n-k,t}

I can take this one step further, but how to get to the formula a_n = ?a_{n-1} + ?a_{n-2} + ?a_{n-3}?
Cho's derivation is no longer accessible.

Short of using permanent of a matrix, how to solve this?...

I am also checking the stability, as well as that all the pairs are present. However, WA. any ideas why? /* * 11119. chemical Attraction * TOPIC: bipartite matching, stable matching * status: */ #include <cassert> #include <cstdio> #include <cstdlib> #include <cstring> #include <iostream> #include <...

Cities are vertices, flights are edges with capacities. Perfect. But how to deal with the time parameter? The easiest way is that we redefine a vertex as a (city,timestamp) pair, but that would lead to the explosion in the number of vertices.