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

1 | tourist | 3496 |

2 | moejy0viiiiiv | 3288 |

3 | W4yneb0t | 3218 |

4 | TakanashiRikka | 3178 |

5 | Petr | 3173 |

6 | izrak | 3109 |

6 | Um_nik | 3109 |

8 | anta | 3106 |

9 | ershov.stanislav | 3105 |

10 | dotorya | 3089 |

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

1 | rng_58 | 172 |

2 | csacademy | 169 |

3 | Petr | 157 |

3 | tourist | 157 |

5 | Swistakk | 156 |

6 | Errichto | 150 |

7 | Zlobober | 145 |

8 | matthew99 | 141 |

9 | Endagorion | 137 |

10 | BledDest | 134 |

↑

↓

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/16/2017 21:38:14 (c6).

Desktop version, switch to mobile version.

User lists

Name |
---|

Sorry if this question has been asked before, but I quickly Googled it just now and can't find it.

Is there a way to change our COCI account password? Thanks.

Step 1: Go to http://evaluator.hsin.hr/login.php?redirect=index.php

Step 2: Look at the line "Forgot username and password..." and you will see a link directed to an other website.

Step 3: Enter your email you used to register.

I didn't try, but I hope these will help you.

I just tried this. This feature will generate a new (random) password for you and the new password will be emailed to you.

I want to be able to change it to my own custom password.

There is currently no feature that allows you to change your old password to a custom one, sorry.

try to send clarification request

duration ?

Three hours.

Good luck to everyone!

Weird. I don't see tasks.

Is there something with 0, (2^m)-1 and subsequence that xor of all elements == (2^m)-1 in E task?

How to solve

C, E, F?Is there smth faster than for

C?E: An interval can't win iff it contains exactly 2

kpair (x, 2^{n}- 1 -x).Do you have any proof?

Proof is easy. Let its xor sum be

X. Then for each elementain that interval we must havea^(2^{n}- 1)^Xalso is in that interval. So we havedpairs (a,a^(2^{n}- 1)^X). Because its xor sum isX, soXmust be 0.How do you check if an interval meets the condition effectively?

Denote

N= 2^{M}- 1.You can answer the queries of the type "maximum/minimum index

isuch thatN-perm[i] exists in the target interval" inO(1) withO(NlogN) or evenO(N) precomputation with RMQ. Then, if the answer to any of the queries doesn't belong to the target interval, the interval is winnable (as explained in chemthan's post).Unfortunately, as the task is to count the winnable intervals rather than answer to queries, this method is only

O(N^{2}), which is enough only for 50% of the points.How to solve it after this? It seems now it reduces to: count the number of subarrays with exactly 0 or 2 instances of every element.

If my solution is correct, time complexity of my solution is

O(R^{2}*S)Problem C

Yeah, that was the intended solution.

So can you explain it?

Sure, let's first think about the game in a different light. Suppose that everything on the grid stays still and the main character can in one second move from (

r,c) to (r- 1,c- 1), (r- 1,c) or (r- 1,c+ 1). It is easy to see those games are equivalent.Let

dp[r][c][o] denote the longest valid expression you can acquire if you are currently on position (r,c) on the screen and the difference between the number of open parentheses and closed parentheses in the expression you have acquired thus far equalso. Computing all dp values takesO(R^{3}) time. This solves the part of the problem that deals with the length of the sequence.For the reconstruction, we'll keep around a set of dp states that can potentially lead us to the lexicographically smallest solution. At the beginning, that set contains only Mirko's initial position. We will now make transitions from those states (similar to transitions in dp) that lead to longest solutions and traverse only the empty cells of the grid (this is a standard bfs). Once we have exhausted the empty cells, we have obtained the set of cells that contain the next parenthesis in our sequence. At this point we will disregard all cells that have ')' written on them in case there exists a single cell with '(' written on it. Repeating this process yields the lexicographically smallest sequence in

O(R^{2}).Since there is no test case with expression longer than 50, separate reconstruction part is actually not needed. We can define dp value as pair of (longest valid expression, lexicographic price of expression) and then just maximize this pair using dp.

If for some state longest valid expression is

kthen lexicographic price isk-bit number created from this expression with`(`

being 1 and`)`

being 0 — thisk-bit number is solution itself.EDIT:Actually I modified this approach a bit and it works for all possible cases i.e. with expressions up to 100, just replacek-bit number with solution string, add custom operator< and then just print that string at the end.What makes you think there is no test case with expression longer than 50?

Well, I meant in this specific contest there was not :). Of course there could be a test case with expression longer than 50.

You made me a bit paranoid for a second because I generated the test data :)

Now I see that we uploaded the wrong .zip archive at hsin.hr/coci which contains the test data for our local version of the contest (honi). That version of the task had looser constraints and the solution you described was supposed to get accepted.

The correct archive should be up tomorrow.

As noted in the edit of my comment above, this approach is working for all possible test cases if the lexicographic price part is replaced by plain string, bitset could be used as well. Thus special reconstruction phase could be avoidable after all. Waiting for additional test cases.

Wasn't C was harder than other C's in COCI?

Yes, considerably.

D is pretty easy right? Unless I missed something that made it hard...

Yeah.. Did you wrote simple BFS like me?

Same here. Honestly, C and D should be swapped.

Im not sure simple bfs was the optimal way. My code was not that simple

oh my god! I didn't read the D ,because i wanted to write c with recursion. #facepalm

really ,it is a simple bfs.

Yup. Well two BFS, but still very simple. I actually have a stupid typo in my last submission so it won't pass but it definitely seems too easy.

I don't know, but it reminded me this problem: http://codeforces.com/contest/877/problem/D

Do you know when can i see the results?

Usually, after 40 min. we can see results, but there can be delay sometimes.

Results delayed :(

in messages i saw this " Results will be available tomorrow. Thank you for patience. "

What is the optimal solution in problem B?

Precalculate prefix sums for each letter. When answering queries, check if count of each letter in same on intervals.

CodeWhat is the solution for C? I wrote a solution that works in

, but it is obviously too slow.O(3^R)Will they open the analysis mode?

Turn on analysis mode please.

The analysis mode is open now.