1698.md (2624B)
1 Source: https://codeforces.com/blog/entry/104310 2 3 Thank you for participating in our contest! We hope you enjoyed it. 4 5 [1698A - XOR Mixup](/contest/1698/problem/A "Codeforces Round 803 (Div. 2)") 6 7 **Hint** 8 9 $k \oplus k = 0$. 10 11 **Solution** 12 13 Tutorial is loading... 14 15 **Implementation (C++)** 16 17 [162159711](/contest/1698/submission/162159711 "Submission 162159711 by flamestorm") 18 19 **Implementation (Python)** 20 21 [162158539](/contest/1698/submission/162158539 "Submission 162158539 by ScarletS") 22 23 [1698B - Rising Sand](/contest/1698/problem/B "Codeforces Round 803 (Div. 2)") 24 25 **Hint** 26 27 What happens when two consecutive piles are increased? 28 29 **Solution** 30 31 Tutorial is loading... 32 33 **Implementation (C++)** 34 35 [162159774](/contest/1698/submission/162159774 "Submission 162159774 by flamestorm") 36 37 **Implementation (Python)** 38 39 [162158852](/contest/1698/submission/162158852 "Submission 162158852 by ScarletS") 40 41 [1698C - 3SUM Closure](/contest/1698/problem/C "Codeforces Round 803 (Div. 2)") 42 43 **Hint** 44 45 What happens if there exist $i, j, k$ such that $a_i + a_j + a_k \gt a_{max}$? 46 47 **Solution** 48 49 Tutorial is loading... 50 51 **Implementation (C++)** 52 53 [162159874](/contest/1698/submission/162159874 "Submission 162159874 by flamestorm") 54 55 [1698D - Fixed Point Guessing](/contest/1698/problem/D "Codeforces Round 803 (Div. 2)") 56 57 **Hint** 58 59 Binary search. 60 61 **Solution** 62 63 Tutorial is loading... 64 65 **Implementation (C++)** 66 67 [162159950](/contest/1698/submission/162159950 "Submission 162159950 by flamestorm") 68 69 **Implementation (Python)** 70 71 [162684743](/contest/1698/submission/162684743 "Submission 162684743 by ScarletS") 72 73 [1698E - PermutationForces II](/contest/1698/problem/E "Codeforces Round 803 (Div. 2)") 74 75 **Hint 1** 76 77 When can you make $a$ into $b$? 78 79 **Hint 2** 80 81 To swap $a_i$ with $i$, we need a strength of at least $a_i - i$. Is it enough? 82 83 **Hint 3** 84 85 The minimum strength needed is $\max_{i=1}^n a_i - b_i$. How can we count the number of solutions? 86 87 **Solution** 88 89 Tutorial is loading... 90 91 **Implementation (C++)** 92 93 [162159984](/contest/1698/submission/162159984 "Submission 162159984 by flamestorm") 94 95 [1698F - Equal Reversal](/contest/1698/problem/F "Codeforces Round 803 (Div. 2)") 96 97 **Hint** 98 99 What's an invariant of the array? 100 101 **Solution** 102 103 Tutorial is loading... 104 105 **Implementation (C++)** 106 107 [162160016](/contest/1698/submission/162160016 "Submission 162160016 by flamestorm") 108 109 [1698G - Long Binary String](/contest/1698/problem/G "Codeforces Round 803 (Div. 2)") 110 111 **Hint** 112 113 Polynomials! 114 115 **Solution** 116 117 Tutorial is loading... 118 119 **Implementation (C++)** 120 121 [162160053](/contest/1698/submission/162160053 "Submission 162160053 by flamestorm")