Greetings Codeforces community!
CodeChef brings you its last contest of the month, Lunchtime. And everyone's invited! The June Lunchtime 2019, sponsored by ShareChat, is a 3-hour contest and will present you with 5 problems to test your coding abilities.
ShareChat — India’s fastest growing social network — is hiring for full-time and internship roles, and participants of the June Lunchtime will have a chance to apply for these exciting opportunities. Visit the contest page for more details.
We are on the hunt for a Mandarin Translator to help translate problem statements for our monthly contests. This will be a long-term commitment with translations required thrice a month. If you think you are up to the task, then do get back to us at problems@codechef.com.
Additionally, if you have some original and interesting problem ideas, and want them to be used in CodeChef's contests, you can share them here: www.codechef.com/problemsetting/new-ideas
I hope you will join your fellow programmers and enjoy the contest problems. Joining me on the problem setting panel are:
- Setters: MladenP (Mladen Puzić), hackslash_123 (Raj Khandor)
- Tester: Deemo (Michael Nematollahi)
- Editorialist: taran_1407 (Taranpreet Singh)
- Statement Verifier: Xellos (Jakub Safin)
- Mandarin Translator: huzecong (Hu Zecong)
- Vietnamese Translator: Team VNOI
- Russian Translator: Mediocrity (Fedor Korobeinikov)
- Bengali Translator: solaimanope (Mohammad Solaiman)
Hindi Translator: Akash Shrivastava
Contest Details:
- Start Date & Time: 29th June 2019 (1930 hrs) to 29th June 2019 (2230 hrs). (Indian Standard Time — +5:30 GMT) — Check your timezone
- Contest link: https://www.codechef.com/LTIME73
- Registration: You just need to have a CodeChef handle to participate. For all those, who are interested and do not have a CodeChef handle, are requested to register in order to participate.
- Prizes: Top 10 Indian and top 10 Global school students from ranklist will receive certificates and CodeChef laddus, with which the winners can claim cool CodeChef goodies. Know more here: https://discuss.codechef.com/t/how-do-i-win-a-codechef-goodie/7344. (For those who have not yet got their previous winning, please send an email to winners@codechef.com)
Good Luck!
Hope to see you participating!!
Happy Programming!!
Editorial is out https://discuss.codechef.com/search?q=ltime73
Editorials for all problems have been posted and can be found at https://discuss.codechef.com/tags/c/editorial/ltime73
Hope you guys had a nice contest.
In problem Igzi and Burly Array I have used dsu. Can someone find what is wrong in my code
include <bits/stdc++.h>
define ll long long int
define pb push_back
define mp make_pair
define mod 1000000007
define pi 3.141592653589793
using namespace std;
map<ll, ll> parent;
ll par(ll ind) { if (parent.find(ind) == parent.end()) { // parent[ind] = ind; return ind;
} ll cur = parent[ind]; if (cur == ind) { return cur; } parent[ind] = par(parent[ind]); return parent[ind];}
int main() { // cout << setprecision(100); ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
ll t; cin >> t; while (t--) { ll n, q; cin >> n >> q; ll till = 0; map<ll, ll> d; while (q--) { ll type; cin >> type; if (type == 1) { ll x; cin >> x; x += till; parent[x] = par(x - 1); } else { ll l, r; cin >> l >> r; l += till; r += till; ll foo = par(r); parent[r] = foo; ll ans = (parent[r] >= l ? parent[r] : 0); cout << ans << '\n'; till = (till + ans) % n; } } parent.clear(); }}
You only changed this line of code in the second query
parent[r] = par(r);
to
ll foo = par(r);
parent[r] = foo;
I really can't figure out how is it making a difference
EDIT I got it. When I wrote parent[r] = par(r) then r got inserted in the map and it never went into the first if statement and the default value was 0. SO 0 was returned for every ind. Right??
Thank you guys for participating. Hope you had a fun time!