Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

# | User | Rating |
---|---|---|

1 | tourist | 3602 |

2 | Petr | 3265 |

3 | ainta | 3174 |

4 | LHiC | 3163 |

5 | Um_nik | 3159 |

6 | izrak | 3109 |

7 | W4yneb0t | 3087 |

8 | RomaWhite | 3053 |

9 | moejy0viiiiiv | 3051 |

10 | I_love_Tanya_Romanova | 3031 |

# | User | Contrib. |
---|---|---|

1 | rng_58 | 176 |

2 | Errichto | 175 |

3 | Petr | 164 |

4 | csacademy | 160 |

5 | tourist | 158 |

6 | Zlobober | 151 |

7 | Swistakk | 150 |

7 | GlebsHP | 150 |

9 | zscoder | 144 |

10 | matthew99 | 138 |

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

↑

↓

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/29/2017 12:24:43 (c3).

Desktop version, switch to mobile version.
User lists

Name |
---|

Can you please elaborate soln. for problem C?

The Ray will always move with a vector (1,1) or (-1,1) or (1,-1) or (-1,-1) because it always change its direction 90° and in a straight line. For every one of this lines, witch are all parallels to the diagonals, if you extend them to the infinite they only cut once the x axis. In fact, they cut the x axis in (x+y) if the vector is (1,1) or (-1,-1) and in (x-y) if it is (1,-1) or (-1,1). You can then calculate for every sensor this number for the both line that pass throughout it. You make then lists of sensors for each possible sum and difference of coordinates.

You then simulate the ray, going from wall to wall in O(1), and checking and updating all the sensor that are in both lines that pass trough every point in the wall you touch.

It's then O(N) with N being the number of sensors.

It's also important to note that you only enter in a loop when you arrive to one of the other three corners (0,N), (M,0) or (N,M).

Another idea for Problem A without setting many conditions! 21324550

Pretty cool! Could you explain for nubbie please)?

of course, you just try the first day in the input with the months {28, 30, 31} and simulate the cycle till the second day in the input matches or else output NO!

That solution for C was so easy! I tried to elaborate a mathematical solution but things got too complicated. BTW, is it possible to get time for each point in O(1)? It's pretty easy to convert time into coordinates, so there basically must be a way to do the opposite i.e. convert coordinates into time.

I doubt that O(1) solution exist, but here I describe idea for O(log(n+m)) solution: http://codeforces.com/blog/entry/47598#comment-319789

I agree with you.We need binary search to solve it.So it is log(n+m)

21286454 is O(1) for each query for problem C

Lolwhat. It obviously uses Euclidean algorithm, which definitely has logarithmic complexity. O(1) solutions rarely use 'while' cycles, I should say:)

Oh, I'm sorry, it seems you are right. I didn't notice that we only need to compute gcd and corresponding coefficients only once.

Yeah, I think people misunderstood my statement. I should have clearly mentioned. O(1) query time. Preprocessing is O(log(n+m))

21347465 is my Accepted code using Chinese Remainder Theorem. I think it is O(1) though not completely sure.

21286454 is definitely O(1) query time, written by eatmore

there are on subtrees of size k at allMaybe there's a typo, it should be

there are no subtrees of size k at allI just can't understand why I get downvote. Or that we shouldn't point out typos?

Can problem D be done using this approach: starting from index 1, for each window of length 'm', we find the smallest character and add it to the answer. For checking the smallest character, set can be used with the element stored being (character,index). As we move the window, we remove the first element of the previous window and insert the new element of current window, then check if the new smallest character is the same as previous. If it is not, we can add it to our answer. Let the answer be 'ANS'.

At the end, we can iterate through the string and for each character that is not added in the answer, check whether it is less than the largest character that exists in 'ANS'. If yes, we can add it to answer and continue.

21398786 didnt work for me

The Tutorial of problem F use status O(n*n*d).But many people solve F with status O(n*d).Can anyone tell me how to solve it with status O(n*d)?

Can you explain why?

Fix vector

uin the basis which has i-th bit. Not depending on vectorvfrom first 2^{r-1} vector, one ofvand`v xor u`

will have 1 and other one will notCan anyone explain D?

it is important to observe that if a letter L is needed then all the occurrences of the letter from 1..L-1 will be included in the lexicographically smallest string. Now the main problem is to find the least number of occurrence of the letter L.

The initial problem is to find the max smallest letter L within which we will be able to visit all the intervals. To do this, we will iterate through all the intervals for each of the letters. In each iteration we will check whether the current letter indexes can fill any intervals and mark them. While doing this we will have to make sure that we always take the right most position and if we can use that position in other interval then we have to use it as it will solve our main goal of taking the least number of occurrence of the current letter. See the below test cases for clarification.

test case: 3 aaaaaaaaa ans : aaa

3 ababab ans : aa

Anyone solved 'D' with segment tree?

I did. It became extremely complicated though.

21310505

I did too. But it was only used for looking up "rightmost minimum character in an interval". I wish to note than it can also be done with RMQ: O(n log n) preprocessing and O(1) queries, but I find segment trees less error-prone and easier to code, so that's what I used.

Code: http://codeforces.com/contest/724/submission/21289565

I was doing exact same as you linkret but forget that maximum of all minimum char over segment must be greatest in result char array and all less left char must be included in result char array.

Thanks:)

Can anyone explain, why cycles with "zero" XOR sum makes sense for answer? I have submission 21335792, where I ignore all "zero" cycles, it gets WA24. But here 21335866 I use all cycles, even "zero", and get AC.

The mistake you made wasn't ignoring the "zero" cycles but "int mr = min(sz, 60)"

notice that

mrmay be larger thanszwhat if

cyc= {1, 4} ?You will get

mr= 2,base= 1,r= 1 but it should be thatmr> 2,base= 5,r= 2.So just change it to "int mr = 60;" and everything will be right.

"cut(i, j) = min(cut(i - 1, j - 1) + si, cut(i - 1, j) + pi + j * m)."

In problem E, what do you mean by m? I can solve the problem in O(n^3) but don't understand this relation.

They meant

c, maximum amount of goods for a single transportation. So they cut all edges tojcities, which are currently in set A.You consider two cases. If you assign the ith vertex to set A, the capacity increases by si. Instead, if you assign ith vertex to set B, capacity of cut increases by pi+j*m. The j*m value comes from the j vertices in set A such that there is edge from those to ith vertex.

The 724E - Goods transportation can be also solved using greedy (didn't get this right during the contest). It's a little tricky, but basically you first do all the trading that doesn't require sending things, so that each city either just produces or just consumes, and then go through the cities from left to right. You can maintain a list of already seen and active "producers", along with an information on how much can each of them send if a "consumer" comes (either directly, or via other already seen cities that don't produce, but can be used to transfer goods through them). When you get a "consumer", greedily use producers, starting from the rightmost one.

"via other already seen cities that don't produce, but can be used to transfer goods through them"

Can you please explain this a bit more?

To problem E: why isn't it

cut(i,j) =min(cut(i- 1,j- 1) +si,cut(i- 1,j) +pi+min(j*m,si)) ? it also seems OK..For the case that I cut both si and pi

editorial for problem F The number of trees that have exactly one centroid is equal to

when n is even, it should be tree(n, d, n/2 — 1) to avoid counting 2-centroid cases.

I've found O(n*log(n)) solution for problem E and it ran in almost no time 21622504.

I felt that the constraints should have been higher but they were not...

Eh, could you please explain your solution ?

I am only able to solve the problem with the complex

O(n^{2})Thx.

Instead of the approach given in the editorial we can do the following: Let the partition of vertices for the minimum cut be (S, V-S). Then |S| can take values from 1 to n+1. By doing some work it is easy to find out the capacity of the minimum cut which has |S| = i for i=1 to n+1. Our answer is evidently minimum of all these capacities.

Have a look at my code after you brainstorm on my point given above...

Is there any any mathematical generalisation for problem c. P.S. I'm a newbie,all I could see was some pattern and then it showed time limit exceeded my solution is http://codeforces.com/contest/724/submission/21307944 .can someone help me out ?

In problem E, why the formula to calculate the minimum cut is ?

(Sorry if this is something trivial, I'm completely newbie in minimum cut problem)