ENG  RUS Timus Online Judge
Online Judge
Problems
Authors
Online contests
Site news
Webboard
Problem set
Submit solution
Judge status
Guide
Register
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

## Discussion of Problem 1152. False Mirrors

How to get AC with 0.02 s (mine is 0.7 s)??(-)
Posted by Miguel Angel 18 Apr 2002 03:24
Thanks :)
Re: How to get AC with 0.02 s (mine is 0.7 s)??(-)
Posted by zrp 21 Dec 2008 07:01
maybe you need to DP
Re: How to get AC with 0.02 s (mine is 0.7 s)??(-)
Posted by SevenEleven [Tartu U] 23 Dec 2008 17:11
I used bitwise operations (we can represent each subset as number between 1 and 2^n - 1), this AC'ed with 0.031s, may be you can further improve it ..
Re: How to get AC with 0.02 s (mine is 0.7 s)??(-)
Posted by Artem Khizha [DNU] 27 Jul 2011 20:14
Well, I used DP on subsets, but can't get faster than 0.093. Is there any special trick?
Re: How to get AC with 0.02 s (mine is 0.7 s)??(-)
Posted by Ainan Ahmed 9 Jun 2017 22:18
I used bitmask... AC on 0.015
Re: How to get AC with 0.02 s (mine is 0.7 s)??(-)
Posted by imaginary friend 17 Aug 2018 02:15
probably they just upgraded the machine from 2011, that's why you are faster than others :P
Re: How to get AC with 0.02 s (mine is 0.7 s)??(-)
Posted by Viktor Krivoshchekov`~ 28 Nov 2019 15:20
I get 0.015 and used queue for each recount