Balkan Olympiad in Informatics 2018 — Timisoara, Romania

http://boi2018.ro/competition-tasks

6 лет назад, # ^ |

-18

No.

→ Ответить

JustInCase

6 лет назад, # |

Will there be live standings at least?

→ Ответить

I_LOVE_METSUKA

6 лет назад, # ^ |

Check these links later:

http://boi2018.ro/competition-results

→ Ответить

Enchom

6 лет назад, # |

+14

Competition must have started, does anybody have a clue if there will be a livescore? Can't find any on the website.

→ Ответить

bciobanu

6 лет назад, # ^ |

There is no public livescore.

→ Ответить

6 лет назад, # ^ |

+27

Unfortunately, there is no public scoreboard, but here is a snapshot if anyone is interested: Current results

→ Ответить

I_LOVE_METSUKA

6 лет назад, # ^ |

+17

Keep us updated please

→ Ответить

6 лет назад, # ^ |

+19

Sure I will, but nothing much is changing: Results

→ Ответить

6 лет назад, # ^ |

Thank you so much! Does it take the best submission? Also could you try to update it from let's say 30 mins in 30 mins? That would really help. I don't see if you have the rankings why can't they just make them public though...

→ Ответить

Enchom

6 лет назад, # ^ |

← Rev. 2 →

Takes last submission, not best — at least that's what I got told.

The System is not CMS so maybe it doesn't support broadcasting rankings as easily. Just guessing, though

→ Ответить

6 лет назад, # ^ |

It doesn't take the best submission, it takes the last one, so the standings aren't always the best ones. I'll try to update them every 30 minutes. And for the rankings, the committee's 'excuse' for that is that something is going to crash if they make it public. I can publish the tasks if you want.

→ Ответить

SampersandU

6 лет назад, # ^ |

Can you publish the tasks, please?

→ Ответить

6 лет назад, # ^ |

I don't have English version of printed tasks, but I can write a brief description of tasks.

minmaxtree : We are given a tree of size N (N <= 10^5 or so), and we should reconstruct the tree (weights of every edge) in order to fulfill M (M <= 10^5 or so) constraints of type MAX u v x, meaning that the maximum of all the edge weights on simple path from node u and node v is equal to x, and MIN u v x, meaning the same thing but for the minimum.

It's guaranteed that the answer will always exist.

elections Given a string of 'C' and 'T's (of length <= 10^5) , we should answer Q (Q <= 10^5) queries of type L R. Answer to the query is the minimum number of removals to make interval [L, R] good. A good interval is defined as an interval in which there is no prefix or suffix containing strictly more 'T's than 'C's.

homecoming We are given a circular list of N (N <= 10^5) books, each having cost A_i. Also, for every consecutive interval of size K (exactly N of them), we are given a prize we get if we buy them all. We are asked what is the highest amount of money we can get.

This is just a brief overview, I may have made some mistakes and if I have, sorry for that. Also, the constraints aren't exact, but they are between 1e5 and 1e6 for every task so it doesn't matter much.

I'd like to hear your solutions.

→ Ответить

SampersandU

6 лет назад, # ^ |

← Rev. 3 →

Thanks!

→ Ответить

6 лет назад, # ^ |

← Rev. 2 →

I can only post them in Serbian, I guess that won't mean anything to you :)

→ Ответить

6 лет назад, # ^ |

+37

Upd: link

→ Ответить

6 лет назад, # ^ |

+18

Upd: First two Romanians scored 200, milisav scored 100 on first problem, nothing apart from that in top 10 has changed.

→ Ответить

6 лет назад, # ^ |

+19

Upd: link

→ Ответить

6 лет назад, # ^ |

+37

Upd: TadijaSebez solves elections and claims the third place!

→ Ответить

6 лет назад, # ^ |

Update: results

→ Ответить

Results, half an hour before the end

6 лет назад, # ^ |

+16

→ Ответить

6 лет назад, # ^ |

← Rev. 2 →

+19

Can you please also give a picture with the final results (maybe for juniors as well)? Also thanks for keeping us updated:)

→ Ответить

6 лет назад, # ^ |

+19

Day 2 have just started, I'll try to be publishing tasks & 'live' results once again

→ Ответить

6 лет назад, # ^ |

← Rev. 2 →

Soo could you try to give a Ss in the near future? Also please don’t forget about juniors: maybe you could give a picture per hour for them instead of per 30 minutes if that’s not too hard? We thank you for your service:))

→ Ответить

6 лет назад, # ^ |

+29

Sure thing, there it is. JBOI current results: https://screenshots.firefox.com/teeI3PzT4Jg9rphX/192.168.100.3 BOI current results: https://screenshots.firefox.com/b8lv6MzI9Zgl2hg7/192.168.100.3

→ Ответить

6 лет назад, # ^ |

+29

JBOI current results: https://screenshots.firefox.com/AQCNDA8HsxkJZ14s/192.168.100.3 BOI current results: https://screenshots.firefox.com/zjzpdppKWN6r10By/192.168.100.3

→ Ответить

6 лет назад, # ^ |

+38

JBOI results: https://screenshots.firefox.com/fgQvAThSXtKM0UFm/192.168.100.3 BOI results: https://screenshots.firefox.com/qMzGlIMZKHIeOPiE/192.168.100.3

→ Ответить

6 лет назад, # ^ |

+20

Can you give one last update before the end?

→ Ответить

P_Nyagolov

6 лет назад, # ^ |

+23

BOI at 13:10.

→ Ответить

P_Nyagolov

6 лет назад, # ^ |

+24

Final BOI results, photo by perchema. GG, petrescu.

→ Ответить

21August

6 лет назад, # |

What about JBOI results, can somebody post those?

→ Ответить

6 лет назад, # ^ |

+10

JBOI results (current): link

→ Ответить

https://drive.google.com/drive/folders/19d7eX7JqE6ikBEwf8cG0mqS8NfSdR4QP?usp=sharing

6 лет назад, # |

+17

Hi. You can find the statements here:

Enjoy :)

→ Ответить

6 лет назад, # |

+19

You can also see the standings in the link i provided above.

→ Ответить

6 лет назад, # ^ |

← Rev. 2 →

+11

Can you also provide a screenshot for the JBOI?

→ Ответить

6 лет назад, # ^ |

Done.

→ Ответить

ibrahim001

6 лет назад, # |

Can you share JBOI tasks, please?

→ Ответить

6 лет назад, # ^ |

Given N and K, find sum of all the numbers strictly less than N having exactly K ones in its binary representation. N <= 10^15
Given N, find sum $\text{[math]}$ as an irreducible fraction $\text{[math]}$ . Output P and Q.
Given a set of N <= 10^5 non-intersecting (and non-overlapping) rectangles with sides parallel to coordinate axes, and having coordinates between 1 and 10^6, answer Q <= 10^5 queries of kind: Find the sum of the lengths of intersections of a ray with every rectangle in the set, where every ray is starting from some point at x-axis and forming an angle of 45 degrees, 90 degrees, or 135 degrees with x-axis.

→ Ответить

please_delete_account

6 лет назад, # ^ |

Tasks have been posted fyi: http://boi2018.ro/tasks-jboi

→ Ответить

https://drive.google.com/drive/folders/1I-IFJDKPsxKNHxRdMrHnmmrdH93kZI7F?usp=sharing

6 лет назад, # |

← Rev. 3 →

Day 2 (tasks + results):

→ Ответить

6 лет назад, # ^ |

Can you also add the JBOI ranking?

→ Ответить

http://store.picbg.net/pubpic/C1/C2/b1b0124607e6c1c2.jpg

6 лет назад, # ^ |

← Rev. 2 →

I don't have access to it. I'll ask the JBOI committee later.

→ Ответить

P_Nyagolov

6 лет назад, # ^ |

+10

→ Ответить

zendo

6 лет назад, # |

There are people from Turkmenistan in the results table. But Turlmenistan isn't a Balkan Region country.

How other countries (not from Balkan region can participate in this contest)?

→ Ответить

Tosic

6 лет назад, # ^ |

Look at the rules, they can be invited but they aren't official participants IIRC.

→ Ответить