### Berted's blog

By Berted, 7 days ago,

Dear Codeforces community,

We are excited to invite you to TOKI Regular Open Contest #16!

Key details:

Scoring distribution: 100 — 200 — 350 — 450 — 500 — 550 — 850

Finally, we would like to thank:

Please register to the contest, and we hope you will enjoy the contest!

UPD: Contest is over!

Congratulations to our top 10:

Congratulations to our first solvers:

Editorial is available here. (English version is available on page 8)

You can upsolve the problems here.

Thank you for participating and we hope to see you on the next contest!

• +144

 » 7 days ago, # | ← Rev. 2 →   +52 imagine editing your comment because of samsudin
•  » » 7 days ago, # ^ | ← Rev. 3 →   +45 [insert inside joke here]
•  » » » 7 days ago, # ^ | ← Rev. 4 →   +52 sui chan wa kyou mo kawaii~[is trying his best to erase inside joke][tzaph wa, warukanai yo ne]
•  » » » » 7 days ago, # ^ | ← Rev. 2 →   +47 swag
•  » » » » » 7 days ago, # ^ | ← Rev. 3 →   +44 swag
•  » » » » » » 7 days ago, # ^ | ← Rev. 2 →   +44 the person below me is gay
•  » » » » » » 7 days ago, # ^ |   +43
•  » » » » » » » 7 days ago, # ^ |   +43 mass udin
•  » » » » » » » » 7 days ago, # ^ | ← Rev. 2 →   +35 fun fact : udin is a substring of samsudin
•  » » » » » » » » » 7 days ago, # ^ |   +3 fun fact : sin is a subsequence of samsudin
 » 7 days ago, # |   +49 Fun fact: The problem writers of this contest are Indonesia's participants in IOI 2020.
•  » » 7 days ago, # ^ |   +40 I'm panicking right now
•  » » » 7 days ago, # ^ |   +45 nyse fact
•  » » » » 7 days ago, # ^ |   +22 nyse pun
 » 5 days ago, # |   +18 who's samsudin?
•  » » 5 days ago, # ^ |   +19 that's the beauty of it, nobody knows
 » 4 days ago, # | ← Rev. 3 →   +33 Friendly bump! 2 hours 20 minutes before the contest!N. B. This comment is actually made so that people joining today's Atcoder Beginners Contest has a chance to read this announcement.
•  » » 4 days ago, # ^ |   +19 Bump! Contest in 15 minutes!Good luck, we hope you enjoy the contest :D
 » 4 days ago, # |   0 Can someone please tell, why this doesn't work for D? Codevector>> v; for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { int a; cin >> a; if (i < j) { v.pb({a, {i, j}}); } } } sort(all(v)); for (auto [a, ij] : v) { auto [i, j] = ij; i = dsu.find_set(i); j = dsu.find_set(j); if (i == j) { cout << a; return; } if (opp[i] != -1) { dsu.merge(opp[i], j); } if (opp[j] != -1) { dsu.merge(opp[j], i); } i = dsu.find_set(i); j = dsu.find_set(j); assert(i != j); opp[j] = i; opp[i] = j; } assert(0); 
•  » » 4 days ago, # ^ | ← Rev. 2 →   +24 This looks correct to me. In which case number does your code fail?
•  » » » 4 days ago, # ^ |   0 The first hidden testcase.
•  » » » » 4 days ago, # ^ |   +23 hmm, maybe make sure that you have initialized everything correctly (init the dsu, init opp to -1)
•  » » » » » 4 days ago, # ^ |   +19 Ohh, I somehow deleted the memset (for -1 initialization) line.Thank you very much for your help!
 » 4 days ago, # |   0 can anyone share code for problem E
•  » » 4 days ago, # ^ |   +18 You can see one of the sample codes (by rama_pang) here: https://ideone.com/ifIFgc
 » 4 days ago, # |   0 Problem: D Can anyone explain why my code didn't pass? I exactly did the same things written in the editorials. Code#include using namespace std; typedef long long ll; const int N=505; vector g[N]; int color[N]; int yes; void dfs(int at){ for (auto x : g[at]){ if(!color[x]){ color[x] = -1*color[at]; dfs(x); } else if(color[x] == color[at]){ yes = 0; return ; } } } int main(){ ios::sync_with_stdio(0), cin.tie(0); int n; cin >> n; ll a[n][n]; for (int i = 0; i < n; ++i){ for (int j = 0; j < n; ++j){ cin >> a[i][j]; } } ll lo=0, hi=1e9+9; while (lo<=hi){ ll mid = (lo+hi)/2; for (int i = 0; i < N; ++i){ g[i].clear(); } for (int i = 0; i < n; ++i){ for (int j = 0; j < i; ++j){ if(a[i][j]
•  » » 4 days ago, # ^ |   +26 The graph might be disconnected, so you have to check each connected component.
•  » » » 3 days ago, # ^ |   0 Thanks!
 » 4 days ago, # |   +18 Are the test cases available to download somewhere? (I'm trying to debug my solution to G).
•  » » 3 days ago, # ^ |   +33 You can find the test cases for this contest in this repository
•  » » » 3 days ago, # ^ |   +8 Thanks!