Hello Codeforces!!!
AlgoManiaX, the competitive programming club of BITS Goa, is happy to invite you to participate in CodeJam Quark'23 — Preliminary Round, which will be held on Sunday, February 26, 2023 at 21:00 (IST).
The contest will be hosted on CodeChef. You will be given 6 problems and 2 hours to solve them.
We thank CodeChef for providing us the platform to host our contest. We would also like to thank the problem setting panel:
- Problem Setters — deVICe7772, Darshan_Bhangale, Bro_Hit, mhgishere, dashing_arpit and ankushgarg_04
- Testers — PSYC0DE, Rajat_2203, pratham_b, sahiljaveri, ansh, Ruturaj_Godse, pranav_m02, aryan.gupta, AryanGoyal and f20201732
About CodeJam Quark'23
CodeJam is a part of Quark'23, the technical fest of BITS Goa. If you are an Indian school/college student, we will hold an onsite round of CodeJam Finals from 24 to 26 March, 2023. There will be two other onsite events:
- CodeWars — Intense 1v1 Competitive Programming Duels for top 32 participants of this round.
- Fool's Coding Contest — An event bringing out the comic side of you while testing your logic and coding skills.
There are prizes worth INR 1,00,000 for the top participants of each of the three competitions.
See you on the standings (and also at BITS Goa). Good Luck!!!
UPD: Thank you for participating! We'll invite the top participants to BITS Goa for the onsite finals. Meanwhile, you can fill the feedback for our problems :)
Are there any prizes for the online round toppers?
![ ](
)
How many people will qualify for the finals?
We will get in touch with all the qualified participants soon.
Ok how to solve Let's Race?
I tried something like meet in the middle, precompute path products with corresp minimum sums for some top left, and for remaining bottom right, and then tried to combine the 2; not sure if it's the right approach (there was a CF problem with same logic).
Also, answer does not exist always right? What do we return then?
2 2 3
1 2
3 4
Your approach looks correct. We forgot to mention that the given test cases were generated in such a way that at least 1 valid path exists. Sorry for any inconvenience caused.
Nvm.
Potato me forgot n!=m and made a mess. Cool problems though!
Similar problem
Why my code is failing on que no. 2 Average Chef
// Online C++ compiler to run C++ program online
include <bits/stdc++.h>
using namespace std;
define ll long long
define pb push_back
define endl "\n"
define ff first
define ss second
define vll vector
define mll map<ll , ll>
define f(i , a , b) for(ll i=a ; i<b ; i++)
define Sort(v) sort(v.begin() , v.end())
define decsort(v) sort(v.begin(), v.end(), greater());
define yes cout<<"YES"<<endl
define no cout<<"NO"<<endl
define MOD 1000000007
define lmax LLONG_MIN
define lmin LLONG_MAX
define booster ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
define ull unsigned long long
mt19937 rng(uint32_t(chrono::steady_clock::now().time_since_epoch().count()));
define uid(a, b) uniform_int_distribution(a, b)(rng)
int main() { booster
}
your code prints negative values for the following test case
1 99998 49999
ankushgarg_04 when can we make practice submissions to the contest ?
Practice submissions have been opened now.
Will you guys be sponsoring the travel/accommodation for the onsite participants?
Great questions. Had a fun time solving them.
The only issue was that I had asked a question on "Lets Race!" about what to output if no path exists, it was not answered :(