i got a call from fedex on 13th. they told me to do the kyc. I receive the kyc confirmation and the airwaybill number in mail after that.

i can track it from fedex website using my airway bill number

I claimed the shirt two weeks ago and am only now being informed that KYC is required for shipments to India to avoid the package being discarded. This should have been communicated earlier. How can I confirm whether the shipment has already been discarded? The tracking ID is still unavailable in my profile. When I try to complete the KYC process, it asks for an Air Waybill number, which I have not received. What should I do?

how to do C in O(1)?

The number of Indian participants is actually higher than that. Just a look at the leaderboard will reveal those who are participating under a different country name.

Damn I had a feeling that the answer won't change for even K but I couldn't prove it and was thinking about edge cases. Maybe if I had not wasted so much time on implementing B i could have got it.

How did so many people get C. It looked like there were lots of cases or am I just stupid:/

I read that wrong

yes i used prefix sum

Personally, C was logically easy but hard to code nice contest though

What happened

My rank is falling so fast 2.5 hrs into the contest. I went from around 1000 to now 4000. Hope the plagiarism check is strong ;_;

343027901

Just checking through the leftover was not enough. It may happen none of those pairs satisfy the degenerate condition. In that case you had to check if you can really make a polygon with your already picked sides else print 0. Also there is another edge case where even if leftover size is not 1 we can pick only one of the leftover elements and not a pair. In that case adding an extra 0 made the checking easier

before adding the largest two leftover values you didnt check if they satisfy the degenerate polygon condition. Just run a loop and check for which two largest consecutive pair their absolute difference is strictly less than your current sum.

Bro was being too helpful, so they had to silence him.

I got the modulus idea immediately. After that I just worked out some cases. I am not practicing much right now so the implementation took some time.

I got stuck on it too. Solved C in like 15 minutes while it took around 50 for B

C felt much easier than B.

Can you link your submission please.

9/11 for indians

.

O(n) solution for B

void solve()
{
    ll n, k, x;
    cin >> n >> k >> x;
    vector < int > a(n);
    REP(i, n) cin >> a[i];
    ll sum = accumulate(all(a), 0ll);
    ll temp = sum;
    ll ans = 0;
    for (int i = 0; i < n; i++) {
        ll cnt = 1;
        ll val = x - temp;
        cnt += max(0ll,val / sum);
        if (val % sum != 0 && val>=0) cnt++;
        ans += max(0ll, k - cnt + 1);
        temp -= a[i];
    }
    cout << ans << endl;
}

What does 7 sisters have anything to do with Bangladesh

.

very helpful kashil bhai

LMAO who came up with the event name

He is definitely a cheater in one of the older rounds I saw two guys in top 10 with his handle names. He was submitting with another account to avoid penalty

Multiplexer got over 40 AC in div2 in the last 2 minutes. Indians are so smart wow.

As an Indian I can confirm.

I was also surprised by the number of submissions on A. It got to 1000+ on div 2 in under 5 minutes when the problem wasn't that trivial.

Anybody who used fenwick tree to solve D has most likely cheated. I saw the solution after contest and it was pretty simple. It used a standard moving median approach.

.

How much free time do you have?

3/10 ragebait

I didn't read the question properly during the contest. The length of n (number of digits) is specified to be a maximum of 1e5 whereas int can handle a maximum of 32 bits number (roughly around 9 digits) and long long 64 bits which are way below the possible value resulting in WA for bigger numbers. The samples given fit in int that's why it gives correct output.

I spent over 40 minutes on C trying out different logics and debugging my code because it was getting WA on test 3. It's only at the very end that I realized that the intended input type for n was string because it wasn't explicitly mentioned in the problem.