Given an array * A* of length

**n(n≤105, ai<250)**, divide it into two subsequences

*and*

**X***such that (x1|x2...) ⊕ (y1|y2...) is maximum. Print the maximum*

**Y***.*

**OR(X) ⊕ OR(Y)**Any help would be appreciated. Thanks!

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

1 | tourist | 3947 |

2 | jiangly | 3740 |

3 | Radewoosh | 3652 |

4 | Benq | 3626 |

5 | jqdai0815 | 3620 |

6 | orzdevinwang | 3612 |

7 | ecnerwala | 3587 |

8 | Geothermal | 3569 |

8 | cnnfls_csy | 3569 |

10 | ksun48 | 3485 |

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

1 | awoo | 162 |

2 | maomao90 | 160 |

3 | adamant | 156 |

4 | atcoder_official | 155 |

5 | nor | 153 |

5 | cry | 153 |

7 | maroonrk | 152 |

8 | SecondThread | 148 |

8 | -is-this-fft- | 148 |

10 | Petr | 146 |

Given an array * A* of length

Any help would be appreciated. Thanks!

↑

↓

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/16/2024 07:06:01 (j1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|

i believe you need to know a technique called XOR basis to solve this. its the same as this problem https://atcoder.jp/contests/abc141/tasks/abc141_f

Auto comment: topic has been updated by cyber_simar (previous revision, new revision, compare).