66

2021-2022 ICPC Latin American Regional Programming Contest

 2 years ago
source link: http://codeforces.com/blog/entry/101550
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
neoserver,ios ssh client

7 days ago, # |

I'm washed and only tried the mirror for a bit but here's some sketches

C (didn't code)
D (didn't code)
F
H
I
J
K
L
M
  • 5 days ago, # ^ |

    In problem D, it's possible to keep the answer using only a segment tree with lazy propagation instead of a treap.

4 days ago, # |

Rev. 2  

+15

Are the test cases the official ones? I got AC on problem C with an incorrect solution.

Test case
Polygon image

My AC code (152805814) answers 3, but the correct answer is 1 (and this other AC submission answers 1 152705102)

Edit: And this other test breaks all currently accepted solutions except from 152757395:

Test case
  • 4 days ago, # ^ |

    They might have fixed problem D's cases because the team that passed it passed with a wrong solution but for the other problems I think it's the same cases.

  • 4 days ago, # ^ |

    Thanks for pointing these out, added them to the testset.

3 days ago, # |

Rev. 5  

+14

I'm sorry for my poor English

D
E

problem G I don't know the solution, I just guess

G

problem A I don't know how to solve it,wish somebody could tell me, I guess the key is that for a Ax+By>=SAx+By>=S the different AA and BB is O(n2)O(n2),but I don't know how to solve the condition of simple quadrilateral

2 days ago, # |

One more solution

B
  • 41 minute(s) ago, # ^ |

    Rev. 2  

    0

    Did you actually implement that solution? I did it using the complex FFT with double precision. But round-off error kills it. To get enough precision you have to use long double (80 bit) floating point. Is that what you did? Or is there some other trick?


About Joyk


Aggregate valuable and interesting links.
Joyk means Joy of geeK