Why no ponies this time :(

Wow dude! you've got $$$69$$$ downvotes!

fixed

short and clear ? okay

But I like this line : the editorial will be published shortly after the round ends

That surely is a slow climb haha

Lot more to come !!

Inspiring !! Consistency Level inf!!

Ur graph is lowkey inspiring as u didnt giveup :)

Do you know INGLISH? this means problem statements are not wordy.

but pretest should be long and strong (just kidding I know that may result in a long queue)

No, You can give this in GYM section.

Why do you guys even comment without reading the blog? @dreamkiller

I've seen it in many blogs... Wondering why many people asking this kind of question. :(

May the Force be with you!

good luck brother :)

Good luck!

You will surely... This one will be positive 100 delta :)

With You Brother All the Best

Good luck bro

Good luck !! :)

Good luck bro! :)

Rating is not important but your ability is,good luck!

Good luck and have fun! :)

Success is the next chapter of failure... Wish you all the best bro.

here you got +26. ratings are like a roller coaster sometimes up sometimes down.

What a way to end the streak with a plus 200 delta... Amazing stuff

Thanks!

As a single, I wish you all to become double XD

What does that mean?

The problem setter doesn't enjoy the immense pleasure of rejected problems by our emperor anton. ;-)

In your last contest C is bad(pretest is nothing),so this time I solve C first but C is still bad(example is nothing),so disappointing...

As a tester, I think that it's a wonderful round

Bruh what went wrong for you?

I think I am color blind

Is this an intentional move?

-> I can see you are pretty comfortable with problem A , So I will advise you to up solve problem B of every div 2 round.

-> practice daily , I can see you are not regular in doing problems , its fine even if you do just 2 or 3 on a busy day but do it regularly.

-> Whenever you come across a new concept (eg : prefix sum, binary search) learn that concept and solve few problems on that.

-> solve problems slightly higher than your rating , for you case solve up to 1400. and solve problems with different tags not just brute force and constructive.

May this helps

Maybe I don't get what you mean, but when I click on the link it works just fine

Hey Mr. white We got an order for 5 barrel crystals. wanna cook?

Same brother

what about those who can't even find a solution ? :(

You were right

its_Atrap!!

Please don't cheat if you are participating alongside :P

At least the statement is clear but I doubt short...
P.S. Just for Div.2B...

[Deleted: Sorry I thought it would be a silly doubt and so didnot bother to ask directly ther , But i will remember that! ]

You're not allowed to ask here, you can ask in the "Ask a question" section.

Even if you have a bad experience of the contest, please respect the work of the authors and the testers. Making a contest is not as easy as you think.

To tell the truth, the experience of this round is truly bad. But your words maybe too extreme...

I had a stroke reading that

yes bro you are god

Segment tree

Create for every prime number $$$t$$$ segment tree, that will store array $$$p_{1}, \dots$$$ such that $$$p_{i}$$$ is equal to degree of factor $$$t$$$ in number $$$a_{i}$$$. Assume we multiply $$$a_{i}$$$ by $$$x$$$. Factorize $$$x$$$. For every factor add his degree to appropriate segment tree and check, if the minimum on whole segment $$$[1,n]$$$ become bigger. If so, multiply result buy factor $$$newmin - oldmin$$$ times. But $$$18000$$$ segment trees with sizes $$$n$$$ need much memory, so notice, that the value for segment tree can become bigger that zero not earlier, than $$$n$$$ queries for this segment tree was applied. So we will just store queries for every segment tree in array and once the number become $$$\ge n$$$ apply all them to appropriate segment tree. After this, apply all queries to this segment tree immediately.

I totally agree, implementation heavy B atleast for me :( I just got last 15mins to solve D :(

I spent 25 min solving B...
No FST plz!!!

I totally agree with you, the best part of codeforces rounds are logic/ideas behind each and every problem there in contest. But if we see problems like B then I don't think people would appreciate the round, and it may be uninteresting for many participants.

Even a single problem like B can spoil complete round.

Exactly, problem B was quite dumb as it was just brainless implementation

I agree with everything you said. Problem B was a bad problem even for Div2 (which is usually not the best in terms of beauty and originality).

However, I want to put in a good word for the authors. Problem B wasn't all that implementation-heavy (I mean, I've seen worse). Part -- or should I say, the entirety -- of the challenge to overcome was to find a sensible way to translate the idea into code, which wouldn't lead to a complete mess. And if done right, the implementation is actually quite short.

I've seen this same theme reappear in problem D. One could, in theory, solve it by means of segment trees (which, at least in my case, is the first thing that comes to mind), but that solution is hell to implement. Here, again, the challenge was coming up with a good approach. This one I enjoyed solving.

Of course, I'm not saying that B and D are on the same level, not even close. Problems like B should be eradicated, period. I'm just saying that the implementation alone is not bad enough to justify such a negative feedback.

Todays B and C would have perfectly fit in educational contest, since there are often implementation heavy problems which feel like school homework.

I think these types of problems are good for A and B. Sure I didn't have to think theoretically at all, but I had to think more overall than normal trying to figure out how to implement, and had to think about actual coding in a coding contest rather than just basic mafs.

As far as for beginners, who they're for, beginners often don't have basic implementation skills and when joining a programming contest with almost no programming for the problems they see would leave a bad impression for me, as I would not expect to feel like i'm in grade school math writing equations but actually programming.

Also people who think these are "implementation heavy" surely have never done a single hard cp problem, or severely need to practice implementation...

sadly, it was a pure implementation-based question.

I think that my implementation came out well: https://mirror.codeforces.com/contest/1493/submission/109236256

You can slightly clean up the implementation by processing the reflection using maps and performing it on strings to avoid the pain with leading zeros while reversing, but I don't think there is a way to make it properly clean.

Edit: My attempt at coding it in a clean-ish manner — 109282647

#include <bits/stdc++.h>
#define int long long
using namespace std;

bool valid(int hrs, int min, int h, int m, int ref[]){
	if(ref[hrs/10]==-1 or ref[hrs%10]==-1 or ref[min/10]==-1 or ref[min%10]==-1)
		return false;
	int hrs1 = 10*ref[min%10]+ref[min/10];
	int min1 = 10*ref[hrs%10]+ref[hrs/10];
	if(hrs1<h and min1<m)
		return true;
	return false;
}

int32_t main(){
    int t;
    cin >> t;
    int ref[10]; // inverse mapping of numbers
    memset(ref, -1, sizeof(ref));
    ref[0] = 0, ref[1] = 1, ref[2] = 5, ref[5] = 2, ref[8] = 8;
    while(t--) {
        int h, m;
	cin >> h >> m;
	string s;
	cin >> s;
	int hrs = stoi(s.substr(0,2)); // hours
	int min = stoi(s.substr(3,2)); // minutes
	for(int i=0; i<10001; i++){ // iterate through all the hours
	    if(valid(hrs, min, h, m, ref))
		break;
	    if(min<m-1)
		min++;
	    else if(min==m-1){
		if(hrs<h-1)
		    hrs++;
		else
		    hrs=0;
		min = 0;
	     }
	}
	if(hrs/10==0)
	    cout << 0;
	    cout << hrs << ":";
        if(min/10==0)
	    cout << 0;
	cout << min << endl;
    }
}

`

You could have simplified it additionally with:

1.Brute-forcing it and verifying if it's correct. I think the more optimal version was probably uglier.

2.In C/C++ you could have read the hour and minute separately when they had : between them simply with

scanf("%d:%d", &h, &m)

1. And pad with zeroes with a bit of printf magic: printf("%02d:%02d", h, m)

If you can use python, a lot of the annoying parts are pretty smooth (parsing the string to int, reversing the strings, padding with 0): 109244789