Codeforces Round #650 (Div. 3)

5 years ago, # ^ |

+23

and being so busy you found time to reply us all. Thats what increases our love for you.

→ Reply

ashkANOn

5 years ago, # ^ |

Then i am excited to see you participate in some div3 rounds.

→ Reply

xodeChemist

5 years ago, # ^ |

we are for div-3 and div-3 for you

→ Reply

5 years ago, # ^ |

More up-vote than the main one.. it's all about vovuh popularity :3 <3

→ Reply

Tamaami

5 years ago, # ^ |

-39

Is it rated.

→ Reply

CvYaswanth

5 years ago, # ^ |

+43

→ Reply

i_am_vk

5 years ago, # ^ |

yes, if your rating is less than 1600 Div 3 contest will be rated for you. but as I can see you are unrated so yes this contest will be rated for you

→ Reply

btdat2506

5 years ago, # ^ |

← Rev. 2 →

Hmm, then why am I not rated for this contest?

Edit: Sorry, I didn't know that it just need to be waited.

→ Reply

i_am_vk

5 years ago, # ^ |

Rating gets change after 12 hours of hacking phase, in Div. 3

→ Reply

rickbaishuak

5 years ago, # ^ |

My rating still isn't changed, it's been 17 hours

→ Reply

ujjwalsinghgravity

5 years ago, # ^ |

Same here, no rating changes.

→ Reply

vipchhabra99

5 years ago, # ^ |

← Rev. 2 →

Same my friend's ratings have been changed but my rating is not changed till now.

→ Reply

satyam_0751

5 years ago, # ^ |

And I started missing Vova in the contest. Spoiler: https://mirror.codeforces.com/contest/1324/problem/E

→ Reply

5 years ago, # |

how can I become a tester?

→ Reply

anirudhak47

5 years ago, # |

-64

Editorial before contest ;)

→ Reply

Mikepayne14

5 years ago, # ^ |

+57

this ain't codechef! ;p

→ Reply

kingkong1

5 years ago, # ^ |

CodeChef_admin teja349 Look what world thinks about you. Thanks to the long challenge

→ Reply

anirudhak47

5 years ago, # ^ |

There is a lot of cheating going on codechef long long challenge.

Search on Telegram, there a special group ( dont remember exact name but its similar to "codechef discussion" ) dedicated to discuss the test cases and solutions.

Also on YouTube found some guys explaining the solutions in comment boxes.

→ Reply

dontknowwhy

5 years ago, # ^ |

+24

I really dont know why u try to blame codechef or codechef admin for such thing. They are just organising contest they are not saying u to cheat and u know what its people like u who cheat in the contest search for links on telegram and so so... and really dont know why people cheat just to gain good rating ... well my friend rating at any platform wont fetch u any job or such its the knowledge that can ... so just stop blaming and start studying

→ Reply

kingkong1

5 years ago, # ^ |

Hell yeah!! The name of telegram grp is exact same. Another reason to scrap long. I saw people there are congratulating each other and saying I got +210, i got +190 blah blah. And when i saw the shared files and photos then i realised how they acheived so. I still remeber codechef used to be good platform but now it is not so, you will barely see any (non indian) suggesting codechef. It can still regain its glory but for that they have to take some serious action and yeah plagiarism detector in long challenge is ineffective as one can easily make changes in entire code as long challenge is very supportive in such case as it give plenty of time

→ Reply

5 years ago, # ^ |

+52

Forget about non-Indian...I barely see any Indian suggesting Codechef nowadays XD...

→ Reply

5 years ago, # ^ |

He's the codechef admin?!!!!!!!!

→ Reply

kingkong1

5 years ago, # ^ |

I tagged codechef admin and cache they are different person. Cache was admin of this contest

→ Reply

5 years ago, # ^ |

Oh I'm sorry.. I didn't notice that was a separate handle..

→ Reply

Muhimen

5 years ago, # |

+59

vovuh Will always be in our memory

→ Reply

5 years ago, # ^ |

+10

stop saying that he will be back soon.

→ Reply

karthik_28

5 years ago, # |

+30

Consecutive div3 without vovuh :|

→ Reply

KB2.0

5 years ago, # ^ |

Shut up

→ Reply

Rafid98

5 years ago, # |

-32

Hope solving upto C will be enough to increase rating for newbies like me :|

→ Reply

5 years ago, # ^ |

+11

hope is a good thing.

→ Reply

abhi_gupta

5 years ago, # ^ |

probably one of the best.!

→ Reply

potta.mukulparas

5 years ago, # ^ |

+10

"...maybe the best of things..."

→ Reply

asfd221

5 years ago, # ^ |

+11

And no good things ever dies.

→ Reply

Nodirbek_Sattorov

5 years ago, # |

I wish all rated(<1600) users in this DIV-3 will be Unrated in the next coming div-3 rounds! :-)

→ Reply

5 years ago, # ^ |

+25

if talking logically, this is not possible.

→ Reply

5 years ago, # |

← Rev. 2 →

I'm just curios, did vovuh retire?

Also almost-copy-pasted-part is a lie. :(

→ Reply

5 years ago, # ^ |

he has not retired bro.... he is just a bit tired.

→ Reply

nFlamel

5 years ago, # ^ |

He's a bit retired

→ Reply

AM_I_Learning

5 years ago, # ^ |

+15

May be vovuh is busy making a nice Div3 as after so many successive Div 3s He might have gone out of problems, but I feel that he will be back soon with a lot of quality problems.

→ Reply

5 years ago, # ^ |

I hope so.

→ Reply

S2speed

5 years ago, # ^ |

Check his reply of first comment.

→ Reply

5 years ago, # ^ |

Thanks, ill be looking forward to it!

→ Reply

Muhimen

5 years ago, # ^ |

Read this comment Hopefully, it will clear all your doubts.

→ Reply

5 years ago, # ^ |

Thanks.

→ Reply

golki

5 years ago, # |

I have only taken part in one rated contest, I guess this one's unrated for me.

→ Reply

https://cfviz.netlify.app/index.html

5 years ago, # ^ |

you are rated.. Read the line carefully >> "Regardless of whether you are a trusted participant of the third division or not, if your rating is less than 1600, then the round will be rated for you."

→ Reply

Jhin

5 years ago, # |

+210

→ Reply

ivatopuria

5 years ago, # ^ |

told ya he needed warm up :))

→ Reply

AyanoGod

5 years ago, # ^ |

← Rev. 3 →

→ Reply

manish_joshi

5 years ago, # ^ |

← Rev. 2 →

+22

Come on, I am here for a year practising almost every day for months

Is this how months of practice looks like? There is a reason why people who are green are green.

Edit: I used Codeforces Visualizer to plot this.

→ Reply

ZetaFunction

5 years ago, # ^ |

+14

Destruction level 1e9 + 7. xD

→ Reply

AyanoGod

5 years ago, # ^ |

← Rev. 2 →

-25

→ Reply

shahil_005

5 years ago, # ^ |

The graph clearly shows "Your way of practice". Mine is even poorer than yours and I clearly know what my way of practice is.

→ Reply

ZetaFunction

5 years ago, # ^ |

BTW which website is it ?

→ Reply

LaKsHiTh_

5 years ago, # ^ |

i think it's this

→ Reply

AnshulGarg22

5 years ago, # ^ |

Sorry I'm new here. How do I know the rating of a problem? How do I get problems of a particular rating? And how can I access such data for myself?

Ty :)

→ Reply

aswwwanth

5 years ago, # ^ |

Problemset. Here you can filter problems according to it's rating. The filter is on the right.

→ Reply

AnshulGarg22

5 years ago, # ^ |

Thanks! What level of problems should I be solving relative to my rating?

→ Reply

Sundaram_Sharma

5 years ago, # ^ |

← Rev. 3 →

It varies from person to person.Looking at your graph you should probably be trying problems ranging from 1400-1700(same as mine) .If you find it too difficult gradually,come down to easier questions and practice them till you get a firm grip.If you find the questions easily solvable ,move up to higher rated problems.Always remember the key point is solving problems slightly above your comfort zone.You can use various sites like a2oj (https://www.a2oj.com/Ladders.html) and (https://www.a2oj.com/Categories.html) and code-drills(https://recommender.codedrills.io/) to practice as well.

→ Reply

88sama88

5 years ago, # ^ |

Where can i find this graph for myself?

→ Reply

hata_saa

5 years ago, # ^ |

→ Reply

AyanoGod

5 years ago, # ^ |

← Rev. 2 →

→ Reply

manish_joshi

5 years ago, # ^ |

You have almost the same solve count as me on Stopstalk. But, It's hard to measure the difficulty of those numbers. Try doing more 1400-1500-1600 difficulty problems on Codeforces. By the time you do more than 100 of >=1500 problems, you won't be pupil anymore.

→ Reply

Jhin

5 years ago, # ^ |

that's great I demoted to pupil

→ Reply

5 years ago, # |

+20

→ Reply

Abdullah_Sheehan

5 years ago, # |

← Rev. 2 →

-55

Always in Div.3 contest

→ Reply

5 years ago, # ^ |

← Rev. 2 →

+18

why this meme looks like almost-copy-pasted?

→ Reply

5 years ago, # |

-33

→ Reply

DasAnuDasah

5 years ago, # ^ |

+11

Stop posting shit man

→ Reply

5 years ago, # ^ |

ok Boss.

→ Reply

anishde85

5 years ago, # |

my first div 3 contest as an expert excited

→ Reply

5 years ago, # ^ |

Now you can play without tension...I don't know when I will be a expert

→ Reply

5 years ago, # |

← Rev. 2 →

+86

No offence .. It's just a meme ..

→ Reply

5 years ago, # |

← Rev. 2 →

+14

We are missing vovuh

→ Reply

GrandDaddy

5 years ago, # ^ |

Did you mean the other way around? I guess Vovuh and Stepavly should be swapped in this.

→ Reply

5 years ago, # ^ |

+11

Actually I have kind of lost my mind in this lockdown.

→ Reply

Circumcircle

5 years ago, # |

-44

We are getting almost copy pasted blogs, one day we will get almost copy pasted problems.

→ Reply

5 years ago, # ^ |

+18

yeah you can make your own codeforces for that

→ Reply

Circumcircle

5 years ago, # ^ |

If I can be a pro, I will make it surely

→ Reply

Ariadne.w.

5 years ago, # ^ |

What do you mean by "pro"? Like GM or LGM?

→ Reply

not_noob

5 years ago, # ^ |

I think spending time on problems is of greater importance than spending time on writing beautiful or new blogs

→ Reply

nurda_bar

5 years ago, # |

RIP — vovuh, heh i will miss your contests(

→ Reply

Anubhabghosh

5 years ago, # ^ |

Hope vovuh will be back for next div 3 contest.

→ Reply

I_love_Mia_Malkova

5 years ago, # |

-6

Hope this round will give me positive rating change.

→ Reply

https://surya1231.github.io/Codeforces-contest/

5 years ago, # ^ |

← Rev. 2 →

+11

Just make 1 submission (correct or wrong doesn't matter) and then even God can't stop you from getting positive rating change. XD #newratingsystem

→ Reply

RAB

5 years ago, # |

-22

→ Reply

shahil_005

5 years ago, # ^ |

I used to do the same until I found this.

→ Reply

3o1

5 years ago, # ^ |

Sounds like the good ol advertisement line.

Helpful link tho

→ Reply

nayakashutosh9

5 years ago, # ^ |

← Rev. 2 →

follow this to get the links of all the contests of codeforces. you can also check the problems that you could not solve so that you can upsolve it later.

→ Reply

Sindy

5 years ago, # ^ |

get it in your blog !!

→ Reply

achung72

5 years ago, # |

What does a penalty of 10 minutes mean? If you have a wrong answer submission you lose ten minutes?

→ Reply

Mikepayne14

5 years ago, # ^ |

The points you lose for submitting 10 min later will be the points deducted for 1 wrong submission.

→ Reply

5 years ago, # ^ |

Let's take an example. Suppose you are submitting your question A after 5 minutes of contest's start time. If it is going to be correct you will be given penalty of just 5(minutes to solve question). Now suppose it is wrong on some test case.You find fault in logic and submit it after 15 minutes from the start time. So total penalty for this question would be 15(minutes to solve question) + 10(for 1 wrong submission)=25. For every wrong submission you will be awarded with 10 minutes penalty. I hope this cleared your doubt about 10 minutes penalty.

→ Reply

5 years ago, # ^ |

-8

You could have simply said that we get 10 minutes behind than the actual submission time.

→ Reply

5 years ago, # ^ |

← Rev. 2 →

Well I tried my best to explain him 10 minutes behind the actual submission time.....

→ Reply

RomeoFantastik

5 years ago, # |

Live upsolving 5 mins after the round ends: https://youtu.be/Fcxm3iROflI

Good luck!

→ Reply

Abdullah_Sheehan

5 years ago, # |

-25

→ Reply

3o1

5 years ago, # ^ |

-30

Stfmu!

Having a good day

→ Reply

ventak

5 years ago, # ^ |

-16

My guy almost thought he is going to get +ves for the comment ((

→ Reply

3o1

5 years ago, # ^ |

-10

You see LIGHT in my profile pic..?

YES!! I've always admired THE negative. [wicked smile]

→ Reply

anishde85

5 years ago, # ^ |

not when u code in python:)

→ Reply

shinobu2006

5 years ago, # |

+38

→ Reply

Mazaalai

5 years ago, # |

+10

vovuh will you make div(1, 2) contest in the future??

most of the participants will be looking forward to the contest that you are making.

good luck to everyone who are participating in this contest!!!

and if you are interested and don't know look into it(there is an extension which predicts your score change after contest called CF-Predictor)

(Good luck & high rating!)

→ Reply

vovuh

5 years ago, # ^ |

+14

Div. 2 maybe sometimes, when I come up with good and hard enough problems. Not sure about Div. 1 :)

→ Reply

kuchbhinahihai1344

5 years ago, # ^ |

CF-Predictor disabled today.!!

→ Reply

WasylF

5 years ago, # ^ |

No, it's not :)

→ Reply

tourist_Niche_se

5 years ago, # |

You have 6 Hrs 30 Min to provide fastest editorial. :)

→ Reply

LoveYouEx

5 years ago, # |

+28

→ Reply

Ariadne.w.

5 years ago, # |

+30

I thought vovuh was a university student... Though youth doesn't prevent him from being strong and orzable.

→ Reply

vovuh

5 years ago, # ^ |

+19

Actually, I am stupid and "high school" was a semantic typo because I don't remember what is high school exactly and of course because I am stupid. Sorry :(

→ Reply

5 years ago, # ^ |

What does orzable have to do with it?

→ Reply

orzable

4 years ago, # ^ |

hehe only just saw this xd

→ Reply

-Chim-

5 years ago, # |

← Rev. 2 →

-59

Is it rated?

→ Reply

5 years ago, # ^ |

+12

Downvotes would have surely given you the answer....

→ Reply

pollob1563

5 years ago, # |

waiting for this contest <3

→ Reply

codemastercpp

5 years ago, # ^ |

-9

Don't wait for something to happen, Make it happen.

→ Reply

kuchbhinahihai1344

5 years ago, # |

Worst Problem Today: CF Predictor is disabled.

→ Reply

WasylF

5 years ago, # ^ |

I've updated the extension, you probably didn't accept new permission. Please let me know if you have latest version of the extension (1.3.0) it's enabled and still doesn't work.

→ Reply

Trgt_2021_explosion

5 years ago, # |

"do not have a point of 1900 or higher in the rating." 1900 or1600?

→ Reply

ezdp

5 years ago, # ^ |

+22

lets say at some point in time you've been 2000. then you do a huge drop and go to 1200. in this situation your current rating is under 1600, but you have a point in which your rating has been above 1900 and because of that div3 will not be rated for you. hope that helped

→ Reply

5 years ago, # |

hope to solve a b c or a b c d

→ Reply

gdffdvdf

5 years ago, # |

-6

Looks like most unbalanced Div 3 ever. Solve first 3 and then netflix and chill.

→ Reply

sur.i.rus

5 years ago, # ^ |

-10

its unfair and worst Div. 3 ever.

→ Reply

towhid1zaman

5 years ago, # |

← Rev. 3 →

-7

stringforces!

→ Reply

PatronSaint

5 years ago, # |

-50

Worst contest of all time.

→ Reply

5 years ago, # ^ |

-21

same to me..a b solved with 8 min..but c killed me..i solved at last with 6 WA.

→ Reply

nihal_47

5 years ago, # |

notDiv3 Forces

→ Reply

Bhj2001

5 years ago, # |

+24

Comments summarized -
Make Div.3 great again.
Bring vovuh back.

→ Reply

5 years ago, # ^ |

+21

Today's contest was great. wasn't it?

→ Reply

p_unit

5 years ago, # ^ |

← Rev. 3 →

+18

yes but I think problems are more suitable for DIV-2.

→ Reply

5 years ago, # ^ |

Yeah, i agree that problems were tougher than usual Div3's.

→ Reply

jackcaptain

5 years ago, # |

Could you anyone explain answer 15-beautiful to the task E?

20 10
aaebdbabdbbddaadaadc

Counts:

[a,b,c,d,e]
[7,5,1,6,1]

→ Reply

swapnil159

5 years ago, # ^ |

← Rev. 2 →

adbadadbadadbad

→ Reply

Robbinb1993

5 years ago, # ^ |

Swap b and d, you have 6x b but there are only 5.

→ Reply

swapnil159

5 years ago, # ^ |

oops!! Thanks :)

→ Reply

Robbinb1993

5 years ago, # ^ |

aabddaabddaabdd

→ Reply

hata_saa

5 years ago, # |

As usual xD.D always alot harder than C

→ Reply

tribute_to_Ukraine_2022

5 years ago, # |

F1 seems weirdly familiar: https://mirror.codeforces.com/contest/606/problem/C

→ Reply

5 years ago, # ^ |

Yeah..XD.. But i had found it in codechef https://www.codechef.com/PLIN2020/problems/BALASEQ

→ Reply

l-l-l-l-l-l-l

5 years ago, # ^ |

+11

also this

→ Reply

HadyMosaad

5 years ago, # |

How to solve F1 !?

→ Reply

https://www.codechef.com/PLIN2020/problems/BALASEQ

5 years ago, # ^ |

→ Reply

prakhsri_

5 years ago, # ^ |

← Rev. 2 →

Find the longest increasing subsequence of the given array which is the subarray of the sorted version of that array. Some examples are good for this observation. Then the answer is n-size.

→ Reply

5 years ago, # |

← Rev. 2 →

+15

C to D long difference -_-

→ Reply

thesinhajee

5 years ago, # ^ |

Hey, how to upload a meme?

→ Reply

5 years ago, # ^ |

upload image on imgflip.com
you can add some text on the picture.
copy the link and paste in the comment picture option.

→ Reply

dmdivyansh_113

5 years ago, # |

corner cases in C sucked the crap outta me

→ Reply

5 years ago, # ^ |

same to me ..just 1 case fully sucked me.

→ Reply

matheus3301

5 years ago, # |

← Rev. 2 →

How to solve C? This one was hard for me

→ Reply

Sindy

5 years ago, # ^ |

man are you nude in pic ?? !! hell !!

→ Reply

https://mirror.codeforces.com/contest/1367/submission/84003910

5 years ago, # ^ |

← Rev. 2 →

between two 1 >> count number of zero ..count-=k and ans+=count/(k+1);
and for first until found 1>> count number of zero ..and ans+=count/(k+1);
and for last_1 to last>> count number of zero ..and ans+=count/(k+1);
But if all zero then ans=(n+k)/(k+1);

→ Reply

blankh

5 years ago, # |

What is this lol?

→ Reply

Nk77

5 years ago, # ^ |

← Rev. 2 →

Trr chacha trrr haha trrr wumbam trrr haha dalung us nadi hafanana and on on cucarella shalalala

Celebration sounds..?

→ Reply

ivatopuria

5 years ago, # ^ |

https://www.youtube.com/watch?v=EZN2y-bJ-kQ

→ Reply

whybee

5 years ago, # |

I submitted the solution for E here: https://mirror.codeforces.com/contest/1367/submission/84020235 It gives the correct output locally, as well as on codechef's online IDE. What's going on? Can anyone help?

→ Reply

secundus

5 years ago, # |

Can someone explain their approach to F? I was thinking that the answer is something along the lines of $$$n - LIS(a)$$$ but I couldn't prove it

→ Reply

prakhsri_

5 years ago, # ^ |

← Rev. 2 →

Yes we have to find the LIS but it should also be the subarray of sorted version of that array.

→ Reply

Sakhiya07

5 years ago, # ^ |

← Rev. 3 →

There is one more condition that LIS should be consecutive in given sorted array.

→ Reply

ashishkr23438

5 years ago, # |

+44

vovuh back!""/>

→ Reply

thesinhajee

5 years ago, # ^ |

-10

Hey, how to uploaed a meme?

→ Reply

cis_pie

5 years ago, # |

Am I the only one who was facing difficulties in implementing D?

I should have tried E first.

Looking forward for short ways to implement D.

PS. Solved D,5 mins before the contest ends. Fingers crossed for system tests.

→ Reply

Nucleist

5 years ago, # |

← Rev. 2 →

Problem F1 is a variation of this problem: https://mirror.codeforces.com/contest/1231/problem/E

→ Reply

SarthakBansal

5 years ago, # |

The problems were nice!

But the Huge difficulty gap between Problem C and D made the contest "FastTypeForces" !

→ Reply

zephxr

5 years ago, # |

← Rev. 2 →

Can Anybody tell that is there any corner case in Problem C? Getting WA on test 2. Solution — 84019963

→ Reply

5 years ago, # ^ |

← Rev. 4 →

Brother your solution is failing on some test cases... One example
n=5 k=1
string= 10100
Your output= 0
Answer should be= 1 (10101)
Please check your code accordingly.......

→ Reply

zephxr

5 years ago, # ^ |

Thanks Brother for replying,

I think Answer should be 1. Why are you counting the '1' which is already given? we have to find additional tables that we can occupy.

→ Reply

827852427

5 years ago, # |

Dont konw why get WA on 3 in problem D until the end of the contest. Interesting maybe I implement something stupidly wrong.

→ Reply

PRUGREMMER

5 years ago, # |

Tough div3 round!!

→ Reply

5 years ago, # |

I found the answer for F1 as n — (longest sorted subsequence length). Why doesnt the same logic work for F2? My logic was basically keeping the already sorted things at their place and moving other numbers to sort them.

→ Reply

Mucosolvan

5 years ago, # ^ |

← Rev. 2 →

2 0 0 3

Longest sorted subsequence is 0 0 3, but you cannot move 2 to the middle in one move.

→ Reply

5 years ago, # ^ |

By longest sorted subsequence i did not mean Longest increasing subsequence. Sorry for the confusion. What i meant was if we sort the given sequence lets say

S = 2 0 0 3

and the sorted sequence becomes

S' = 0 0 2 3

I am calling the longest sorted subsequence as the largest subsequence in S which is a substring of S'. So for your example it will be 0 0 and the answer comes to be 2. Again, sorry for the confusion of terminology.

→ Reply

5 years ago, # ^ |

← Rev. 4 →

it will work, your way of finding the lis which occurs as sorted subarray is wrong. let's compress the array so that it contains elements from 1 to n. The problem is when an element(let's say $$$x$$$ and $$$x$$$ -1 is already taken in LIS) has multiple occurences than we need to ensure that if we take $$$x$$$ + 1 then all the occurrences of $$$x$$$ are already taken in LIS. This is the thing you are missing (i too missed this).

→ Reply

5 years ago, # ^ |

← Rev. 2 →

I do not think i missed it but i will check again :) Thank you :)

→ Reply

uno6

5 years ago, # ^ |

← Rev. 2 →

How does one come up with such observation? Its like, I thought of LIS but after seeing the last sample test case I thought may be this observation of mine is farfetched. Do I need to solve similar questions before I get any close to acing div2 and div3?

→ Reply

https://mirror.codeforces.com/problemset/problem/1363/F

5 years ago, # ^ |

i couldnt understand the question to the link i gave you, before. Its editorial had similar wording. So while i was trying F i thought of the operation as cyclic shifts and modeled it similar to this question. I remembered in the actual editorial (there was an editorial of this question which i cannot find link to, this question was copied from there). In the actual editorial they talk about if both types of shifts were allowed. So i modeled on that solution. I think in the end it is how many questions you have solved and how much did you learn from them. Keep solving and you will get these questions soon :)

→ Reply

LimitBreaker

5 years ago, # |

StringForcessss

→ Reply

near-river

5 years ago, # |

bring back vovuh

→ Reply

oogerbooger

5 years ago, # |

← Rev. 2 →

In my opinion too hard problems for div 3 and I felt like it was div 2 with more problems than usual

→ Reply

Hisham_hates_graphs

5 years ago, # |

D is for div2

→ Reply

jupiro

5 years ago, # |

Problem F is very similar https://atcoder.jp/contests/agc024/tasks/agc024_b?lang=en , but I can't solve F2 ( ；∀；)

→ Reply

hata_saa

5 years ago, # |

How can i solve D and E? I solved A,B,C fast but I can't get an idea how to solve these two

→ Reply

BumbleBee

5 years ago, # ^ |

← Rev. 3 →

Problem D

Let $$$X$$$ be the number of position $$$i$$$ such that $$$B_i$$$ is $$$0$$$ and $$$t_i$$$ is still undetermined.
Choose the biggest character $$$c$$$ such that it is unused, smaller than any already used character and it appears at least $$$X$$$ times in $$$s$$$. Assign $$$c$$$ to all of those $$$X$$$ positions described in the previous step.
For all the position $$$j$$$ where $$$B_j$$$ is non-zero, subtract $$$|i-j|$$$ from $$$B_j$$$ for each position $$$i$$$ of those $$$X$$$ positions we got in the first step.
Repeat these steps until all the characters of $$$t$$$ are determined.

→ Reply

sur.i.rus

5 years ago, # |

Codeforces should add a new feature for rating a round. from C to D hardness jumped like anything and this isn't good for us. at the last it was just a typing round. maybe testing could have been better.

→ Reply

thedebater

5 years ago, # |

Here's how I solved D:

We have our array b. We start filling our final string at those positions where b[i]=0 {because we can fill all these positions with greatest alphabet having relevant count}. This means, first iterate over string and calculate count of each character in our original string s. Now, at each iteration, we fill all indices at which b[i]=0 with the character that is lexicographically greatest, and has a count greater than or equal to no. of indices having b[i]=0. Dont forget that with increasing iterations, the character in the final string that you fill in at all 'i's such that b[i]=0; should decrease lexicographically.

Also at each iteration, for each index value where b[i]=0; update the values in array b for every j (b[j]!=0) by b[j]= b[j]-abs(j-index[i]) {where lets say index array contains all positions in b where b[i]=0}. This is done to ensure that the contribution of positions we've already filled, is not taken further into account while filling the final string in further iterations.

Do these iterations uptil the level, all positions in the final string are assigned some character.

You can visit my profile and see my code. Its pretty understandable.

Btw It was a beautiful contest. I couldn't have time to solve E although it seemed doable to me.

→ Reply

5 years ago, # ^ |

+25

→ Reply

AnshulGarg22

5 years ago, # |

Was E today easier than usual div3 Es?

→ Reply

_pastor_

5 years ago, # ^ |

slightly but it is ok it was more because D was hard

→ Reply

_pastor_

5 years ago, # |

why there are hacks on D?

→ Reply

perseverance_01

5 years ago, # |

Video Tutorial C:https://www.youtube.com/watch?v=lCNk_D5m6-I

→ Reply

Finding_Infinity

5 years ago, # |

-9

LOL F1 was much easier than D,E

→ Reply

5 years ago, # |

+86

Ashishgup is back!!

→ Reply

perseverance_01

5 years ago, # |

← Rev. 2 →

Edit: Found a simpler method.

→ Reply

alwyn

5 years ago, # |

I got this diagnostics from my submission 84025940 for 1367D - Task On The Board. Does anyone know what this means?

→ Reply

sandeep_kumar_e

5 years ago, # ^ |

The error is in reference with the cf evalutor, read the check log you will get it. Yours code is generating warnings but no compilation or runtime error. The ans it is printing is causing the error in the evaluator

→ Reply

the_pythor

5 years ago, # |

F1 is very similar to this problem from SPOJ which I already solved. I didn't read F1 during the contest (thinking it would be very difficult) and now I submitted the same code just with one change and got accepted :-( and F1 is more easier than D and E

→ Reply

5 years ago, # |

What's the meaning of giving such useless pretests? Isn't it better to run the whole dataset after the contest and no testcase run during the contest? If pretests of problem D didn't give the AC verdict,I would make some cases and run them for my code. The case missing in the pretest set is like:

1 aaabbc 4 3 2 1 0

Simple and necessary case.

What's the meaning of pretests? mocking?

→ Reply

Hasnaine_

5 years ago, # ^ |

Exactly my question. If you don't even care enough to give some critical in pretests what's the use of even giving some of those?

Many setters even exclude all the critical cases intentionally to make every contestant suffer after the contest ends. I don't actually get the actual reason behind this. Contestants love a contest with some strong pretests, not your silly evil game.

→ Reply

aranjuda

5 years ago, # ^ |

You should work on testing your own code. TopCoder for example gives very simple pretests. If pretests catch everything, then hacks will be impossible.

→ Reply

Hasnaine_

5 years ago, # ^ |

Yeah, I guess. The best thing we can do from our side to write the cleanest as possible code possible, I guess.

→ Reply

alvinvaja

5 years ago, # ^ |

← Rev. 2 →

mian hehe

→ Reply

5 years ago, # ^ |

I have hacked my own submission with this case. I will be pleased to know how the case is invalid.

→ Reply

the_pythor

5 years ago, # ^ |

You might have given 1 aaabbc 4 3 2 1 0 in the hack. The correct format is
1
aaabbc
4
3 2 1 0

→ Reply

alvinvaja

5 years ago, # ^ |

You were right. My bad

→ Reply

5 years ago, # ^ |

No worries, thanks.

→ Reply

robostac

5 years ago, # ^ |

The first example case tests the same thing and your code somehow gets marked as OK despite an invalid answer. I don't think the pretests are weak, I think the checker is broken.

→ Reply

5 years ago, # ^ |

No, I was not taking care of the frequency. Say, I want to put a character in the indexes where b[I] = 0. Let, I have chosen character 'x' and I don't have enough characters to put in the indexes where b[i] = 0. My code was not handling that and got AC. It's not fair at all.

→ Reply

Jack_

5 years ago, # ^ |

-78

MikeMirzayanov Stepavly Supermagzzz What the FUCK man. You FUCKING FUCK.

→ Reply

Abdullah_Sheehan

5 years ago, # ^ |

+33

GET OUT FROM CODEFORCES.

→ Reply

Grapeee

5 years ago, # |

← Rev. 2 →

+24

MikeMirzayanov Stepavly i wonder how did this pass ? the complexity is O(n*n*n) 84019953

→ Reply

https://mirror.codeforces.com/contest/1367/submission/84033068

5 years ago, # ^ |

← Rev. 2 →

The sum of n for all test cases in one test does not exceed 3000.

I THINK its ok with the constraints.

→ Reply

Grapeee

5 years ago, # ^ |

3000^3 should be TLE :/

→ Reply

spookywooky

5 years ago, # ^ |

I think it is $$$\frac{3000^3}{8}$$$, which is aprox 3e9 and slightly fits into 2000ms.

→ Reply

Stepavly

5 years ago, # ^ |

Your algorithm has a good constant factor and TL is quite big.

→ Reply

Opa-Nset-Asmy

5 years ago, # ^ |

it's just O(n*n)

→ Reply

spookywooky

5 years ago, # ^ |

+19

No, the memoization is useless.

→ Reply

3.141592653

5 years ago, # ^ |

+11

Maybe it's due to compiler optimization...

The algorithm is exactly $$$O(n^3)$$$ but the compiler greatly optimized it...

In fact, that program need to run about $$$4.5*10^9$$$ operations in the worst case (when $$$a_i$$$ is strictly increasing), which should take over $$$20$$$ seconds without optimization :(

→ Reply

Grapeee

5 years ago, # ^ |

+14

Yes I know that my program need to run 4.5e9 in the worst case .. and i tried to hack it but i couldn't .. so i think that is unfair :/

→ Reply

harsh1868

5 years ago, # |

Can any one Explain E problem?

`Thanks in advance`

→ Reply

SecondThread

5 years ago, # ^ |

I discuss the solution with pictures at 2:02:12 in this video.

→ Reply

SecondThread

5 years ago, # |

+17

For people who prefer video editorials, I discuss the solutions to all problems at the end of my screencast of the round.

→ Reply

codersgroup18

5 years ago, # |

I hope "accepted" and "pretest passed" will not follow the rule of social distancing

but vovuh should not keep social distancing from Div3

→ Reply

mandh_bhudhi_huon_me

5 years ago, # |

83942386 why is it giving MLE for the first question ????

→ Reply

codersgroup18

5 years ago, # ^ |

because of this array int divisors[100000000] ={0};

check this one same as your code but without this array

→ Reply

apoorv17

5 years ago, # |

Is there some problem with the checker for Problem D ?
For the case-
aabc
3
2 1 0
Many submissions give "bbc" as output and checker give them Ok response

→ Reply

https://mirror.codeforces.com/blog/entry/78942

5 years ago, # ^ |

Exactly! :/ I think this ruined the contest.

→ Reply

DMCH

5 years ago, # ^ |

Poor Testing! Disappointed! Test cases accepting wrong answers too.

→ Reply

Puff_Puff_Pass

5 years ago, # ^ |

Exactly

→ Reply

__invariant__

5 years ago, # |

why am i getting this error in trying to hack a solution ? Validator 'validator.exe' returns exit code 3 [FAIL initial string should satisfy distance condition (test case 1) can anyone help ?

→ Reply

5 years ago, # ^ |

I guess you are talking about problem C.
From error it seems that that you are entering string that itself is not satisfying the condition of minimum distance. Eg. For n=5 and k=1 you cannot enter input string as 10011

→ Reply

__invariant__

5 years ago, # ^ |

thanks.

→ Reply

krisnanil

5 years ago, # |

why not my dashboard is not showing i have participated in this contest and even not any changes in rating

→ Reply

5 years ago, # ^ |

i can see you in the standing and wait for rating change.

→ Reply

shyamsvs

5 years ago, # |

Is the round rated yet?

→ Reply

5 years ago, # ^ |

Of course . Just need to wait.

→ Reply

LoneWolfKJ

5 years ago, # |

Have all the submission's been re-judged after the hacking phase? it doesn't look like it.

→ Reply

divya.99

5 years ago, # ^ |

Same question, is system testing done?

→ Reply

aranjuda

5 years ago, # ^ |

Yes, it says so in the standings.

→ Reply

_mndm

5 years ago, # ^ |

I don't think so....

→ Reply

ritikbansal27.rb

5 years ago, # |

My solutions are in queue since 30 minutes!

→ Reply

_mndm

5 years ago, # ^ |

maybe server is down,once my solutions were in queue for 4 hours..

→ Reply

_aadiupadhyay_

5 years ago, # |

← Rev. 2 →

Hey all, I am a newbie and I saw many blogs about problem D of yesterday's contest . So I want to know that whether this contest is rated for me or not . I am able to solve only problem A and B

→ Reply

5 years ago, # ^ |

Rated for you.rating change doesn't not related with newbie or you saw problem D in many blog..rated for all are rating less than 1600.

→ Reply

_aadiupadhyay_

5 years ago, # ^ |

Ok fine but why till now no improvement in rating. Is it unrated ?

→ Reply

prateekvr1

5 years ago, # |

Hey i gave this contest and my rating is not updated yet I am new to codeforces how much time it takes to update rating??

→ Reply

Just_a_programmer

5 years ago, # ^ |

+10

The system testing is not complete yet, ones it is completed rating will get updated in 2-3 hours.

→ Reply

anirudhak47

5 years ago, # ^ |

its complete ig coz the rankings arent changing anymore

→ Reply

Just_a_programmer

5 years ago, # ^ |

It is not even started, only the hacking phase is completed.

→ Reply

Codeforcer

5 years ago, # ^ |

Yeah right

→ Reply

sebi420p

5 years ago, # |

← Rev. 2 →

solved E without graphs.. gcd and some basic operations : solution

→ Reply

88sama88

5 years ago, # |

Why has the rating not updated yet?

→ Reply

dmdivyansh_113

5 years ago, # ^ |

← Rev. 2 →

coz a lot of people aren't ready for that(including me)... XD

→ Reply

MikeMirzayanov

5 years ago, # |

+85

In problem D, there was an issue in the checker program, which affected some participants. I am now investigating this incident. I'll exclude from the rating all those who were affected by this mistake. During the research, I will temporarily hide the problem from the contest, then it will return. I believe that the problem affected no more than a few percents of all participants in the round. I apologize: I was one of three people who read the checker but did not notice a typo in it.

→ Reply

guptaashutosh

5 years ago, # ^ |

+13

But pls make sure those who have submitted correct , they should be rated with problem D,because i see a sudden drop in my standing

→ Reply

ayushpandey

5 years ago, # ^ |

Yes, the people who submitted it right must be given points for it and the system testing should be done again.

→ Reply

trieboi

5 years ago, # ^ |

Same thinking with you :(

→ Reply

Matuagkeetarp

5 years ago, # ^ |

What's actually a hacking phase in codeforces? I'm new at it and I've seen people talking about hacking a problem or solution (don't know exactly what it is). Can someone explain about it little bit?

→ Reply

sarkarasm

5 years ago, # ^ |

After the contest is over, your solution can be viewed by anyone. You can then run the solution on your custom testcases known as hacks. if the solution fails, then the hack is succesful.

→ Reply

Matuagkeetarp

5 years ago, # ^ |

Wait but if the code fails on someone's custom testcases then how did it pass the codeforces' test cases in the first place?

→ Reply

sarkarasm

5 years ago, # ^ |

During a live contest, your solution is not tested on all the testcases as it will increase judging time. So a small number of strong testcases called pretests are used. But sometimes the pretests turn out to be weak.

→ Reply

Matuagkeetarp

5 years ago, # ^ |

Ohhh thanks for the clarification. i got it.

→ Reply

chiraga196

5 years ago, # ^ |

Bro it's hide the problem temporarily only. After research were complete it again return it

→ Reply

5 years ago, # ^ |

Will the ratings update be delayed because of this?

→ Reply

ayushpandey

5 years ago, # ^ |

Yes, I think it will

→ Reply

Ritwik0208

5 years ago, # ^ |

← Rev. 2 →

MikeMirzayanov, if my D was hacked because of the issue with the checker, I don't think the contest should be unrated for me because I spent two hours on the contest from my valuable time. Please consider the D as a wrong answer just like any other hacked answer and rate the contest for the affected people. I worked hard for all the problems and I am sure so did the other affected people.

→ Reply

5 years ago, # ^ |

I agree. The decision doesn't seem fair to me.

→ Reply

Ritwik0208

5 years ago, # ^ |

For the first time, I was on the verge of becoming an Expert and now, I am unrated in the contest. This is largely unfair. I request the organizers MikeMirzayanov and Stepavly to please reconsider.

→ Reply

Justinzxy

5 years ago, # ^ |

After solving A B C pretty fast if I had left D i would have gained aroung 50 but for trying D and almost solving it (just missing the frequency check) the contest is unrated for me. Doesnt seem fair.

→ Reply

helpme10

5 years ago, # ^ |

Have they made it official that the contest is unrated? If so, then could you please provide me a link or let me know where you found it?

→ Reply

Ritwik0208

5 years ago, # ^ |

My account is missing from the standings. So are the ones who did D wrong.

→ Reply

LoopFree

5 years ago, # ^ |

same here!..This is totally unfair. Just treat the prob D as the wrong answer and make the contest rated.

→ Reply

5 years ago, # ^ |

How you can be unrated for problem D , that you did not solved yet.. just wrong answer on test 1. my friend Adicr7 also got WA on 2 but he is still rated..your on may be other reason ..

→ Reply

sumbulkaynat

5 years ago, # ^ |

This seems quite unfair to me, as I solved A,B and C fast. Although D solution was hacked, but still my rating would have increase. But suddenly, now I am unrated for the contest.

→ Reply

_Tien_

5 years ago, # |

-13

Please explain me where problem D is ??

→ Reply

Atish508

5 years ago, # ^ |

-MikeMirzayanov

→ Reply

_Tien_

5 years ago, # ^ |

tks

→ Reply

5 years ago, # ^ |

+21

Can you read a few comments up?

→ Reply

Radhe_Loves_To_Eat

5 years ago, # ^ |

_Tien_ See MikeMirzayanov's comment here

→ Reply

shivam_145

5 years ago, # |

-13

Why is the problem D removed?

→ Reply

Atish508

5 years ago, # ^ |

Read a few comments up

→ Reply

5 years ago, # ^ |

I wonder why would anybody post such a question without checking the comment section for the answer first.

→ Reply

shivam_145

5 years ago, # ^ |

+16

extremely sorry I didn't see the above comments, will take care next time onwards

→ Reply

isocyanide7

5 years ago, # ^ |

Read comments above you.

→ Reply

ayushpandey

5 years ago, # ^ |

There is a problem with the checker For the case- aabc 3 2 1 0 Many submissions give "bbc" as output and checker give them Ok response

→ Reply

_NeewBie_

5 years ago, # |

This was my first contest on codeforces, but its not showing any rating for me?

→ Reply

cheissmart

5 years ago, # ^ |

← Rev. 3 →

+18

You have to wait(~~This is not atcoder~~). I guess it will be updated within an hour.

Upd: I was wrong. 1 hour has passed. But not updated yet.

Upd2: 2 hours!!

→ Reply

Cvangi

5 years ago, # ^ |

Because ratings are not updated yet.

→ Reply

kiraa_545

5 years ago, # |

how much more time will it take for rating to show

→ Reply

LeavingZ

5 years ago, # |

← Rev. 2 →

Hope problem D will return soon.:D

→ Reply

kingslayer18

5 years ago, # ^ |

Already returned...

→ Reply

LeavingZ

5 years ago, # ^ |

I'm sorry. :(
I just learned the issues about problem D a few minutes ago and didn't notice that.

→ Reply

5 years ago, # |

When the ratings will be updated ...

→ Reply

Alama

5 years ago, # ^ |

Same here, I hope it's going to happen soon

→ Reply

5 years ago, # ^ |

I am refreshing the tab continuously since few hours.

→ Reply

Alama

5 years ago, # ^ |

Me Too XD

→ Reply

5 years ago, # |

One of my friends solved 5 problems and rating predictor was showing +139.Later his D got hacked.still rating predictor showed +58.Now this round is unrated for him.This is so pathetic.

→ Reply

5 years ago, # ^ |

This round is unrated for him only or everyone ??

→ Reply

5 years ago, # ^ |

For him and some other participants too but not for everyone.

→ Reply

5 years ago, # ^ |

Thanks for clarification.

→ Reply

ab_rar

5 years ago, # ^ |

→ Reply

5 years ago, # ^ |

I also solved A, B, C, and D. D didn`t pass the final tests and I was removed from the contest:).

→ Reply

Lelouch.Lamperouge

5 years ago, # |

Don't know why but my rank is just toggling between 558 and 670 every time I refresh, looks like rankings have not been finalized yet

→ Reply

naffly

5 years ago, # |

← Rev. 3 →

[sheeeeeeeesh]

→ Reply

Lelouch.Lamperouge

5 years ago, # ^ |

+13

Can you say it in a way that everybody understands?

→ Reply

5 years ago, # ^ |

← Rev. 2 →

I understood.Actually large amount of pretests create long queues for that reason the time needed to show verdict becomes too long.But setters want to set strong testcases so that it may pass system test.But it is completely your misfortune to get wa or tle or some other verdict except accepted after system test or hacking phase.

→ Reply

mushkilWaqt_CommandoSakt

5 years ago, # |

-31

hi i want to tell that "rishab1815" mushkilWaqt_CommandoSakt and "Rishabsoni1815" Rishabsoni1815 are both my accounts

Attention!

Your solution 83955381 for the problem 1367B significantly coincides with solutions rishab1815/83955381, Rishabsoni1815/84010648. Such a coincidence is a clear rules violation. Note that unintentional leakage is also a violation. For example, do not use ideone.com with the default settings (public access to your code). If you have conclusive evidence that a coincidence has occurred due to the use of a common source published before the competition, write a comment to post about the round with all the details. More information can be found at http://mirror.codeforces.com/blog/entry/8790. Such violation of the rules may be the reason for blocking your account or other penalties. In case of repeated violations, your account may be blocked.

please see in this matter @codeforces MikeMirzayanov

→ Reply

5 years ago, # ^ |

+44

You cannot use multiple accounts in a contest.This is a violation of contest rules

→ Reply

3.141592653

5 years ago, # ^ |

+59

The registration confirms that you:

* have read the contest rules  by the links http://mirror.codeforces.com/blog/entry/456 and http://mirror.codeforces.com/blog/entry/4088
* will not violate the rules described on http://mirror.codeforces.com/blog/entry/456 and/or http://mirror.codeforces.com/blog/entry/4088
* will not communicate with other participants, share ideas of solutions and hacks
* will not use third-party code, except stated in http://mirror.codeforces.com/blog/entry/8790
* will not attempt to deliberately destabilize the testing process and try to hack the contest system in any form
* will not use multiple accounts and will take part in the contest using your personal and the single account.

→ Reply

nagato15

5 years ago, # |

← Rev. 2 →

-13

i have two ID on Codeforces. Unfortunately, I have submitted solutions of a contest from both of my id and hence, I got an email regarding clash of solutions. What should i do to prevent both of my ids from being blocked??

→ Reply

5 years ago, # ^ |

+15

Now you have to suffer for your deeds.

→ Reply

nagato15

5 years ago, # ^ |

So, what will be the severest result?

→ Reply

5 years ago, # ^ |

+14

it may happen definitely that one of your account will be blocked or also possible that both of your account. Don't go blindly for ratings , make yourself a good coder ...

→ Reply

5 years ago, # ^ |

+12

If you have done this for first time,your id will not be blocked.But repeatedly doing this may result in blocking or some other severe punishment.

→ Reply

nagato15

5 years ago, # ^ |

all of my submissions were skipped....

→ Reply

5 years ago, # ^ |

+14

This time you will only get skipped. But the next time your ids will be vanished.

→ Reply

5 years ago, # |

← Rev. 2 →

+14

[Now Changed]

→ Reply

5 years ago, # ^ |

[Not Changed]

→ Reply

5 years ago, # ^ |

Some people faced hack on D and in the last they became unrated. I know , some of them solved a b c very fast and will get + rating. But think logically if judge them just skip D who faced hacked on D, some people get — rating for only system problem..So some people always faced unfair. GL and hope for your best..

→ Reply

5 years ago, # ^ |

Yes, but whenever there was a problem in tests or something else, the round became unrated. Now they simply crossed out a layer of players indiscriminately. A strange decision, it was possible by individual decision of the participant to remove or not remove him from the competition

→ Reply

5 years ago, # ^ |

← Rev. 2 →

And what's more — my decision D wasnt hacked — it didnt pass the final tests.

→ Reply

5 years ago, # ^ |

i feel your pain bro. I think you will back to be more strength full and do good. GL & take love

→ Reply

5 years ago, # |

my rating is 1328 but i am newbie , I want to know the boundary of pupil. Please tell me

→ Reply

5 years ago, # ^ |

Mike will change it.dont worry.sometimes it happens

→ Reply

krishna_annapurne

5 years ago, # |

Can anyone tell me why my rating is not updated? My solution to problem D was Hacked(Is is the reason?)

→ Reply

Rahat_Khan_Pathan

5 years ago, # ^ |

Yes

→ Reply

5 years ago, # ^ |

Hacking a task is the reason that the rating will be given less, or it will be removed altogether, but it`s not the reason for removal from the list of participants, most likely it is a system bug, task D either disappears, then appears, and problems arise in people who decided or tried to solve D

→ Reply

5 years ago, # ^ |

contest is declared unrated

→ Reply

krishna_annapurne

5 years ago, # ^ |

Is is unrated for only those whose problem D got wrong?

→ Reply

5 years ago, # ^ |

Yes...whose problem D was wrong first then got accepted or got hacked...or those who hacked solutions for problem D

→ Reply

Rahat_Khan_Pathan

5 years ago, # |

← Rev. 3 →

I am in position 3670 with ABC solved and I got rating update from 1217 to 1263. In the same position 3670 with ABC solved, another one got update from 1227 to 1339. Can anyone explain this system?

→ Reply

3.141592653

5 years ago, # ^ |

Please read this.

Now participants will gain some extra rating in their first $$$6$$$ rated contests.

→ Reply

Rahat_Khan_Pathan

5 years ago, # ^ |

Thanks, didn't know this.

→ Reply

Aiman11

5 years ago, # ^ |

My rating did not change in this contest. Can you tell me why?

→ Reply

Aiman11

5 years ago, # |

@MikeMirzayanov i participated in this round but my rating is not updated.

→ Reply

ErasedSoul

5 years ago, # ^ |

+10

Yes same . My rating also not changed @MikeMirzayanov

→ Reply

agarus

5 years ago, # ^ |

Have a patience.

→ Reply

ErasedSoul

5 years ago, # |

I registered and participated in the contest but my rating didn't change . After the problem D came back to rank list I was removed from the official rank list . Why ? Please anyone tell me. @MikeMirzayanov

→ Reply

sethir

5 years ago, # |

Could someone please help me figure out the error in my code? https://pastebin.com/wvfqbw6Z Fails a particular case in test case 2.

→ Reply

agarus

5 years ago, # ^ |

← Rev. 2 →

It would better if you'd share the link to your failed submission (instead of pastebin). It would at least be clear what problem you are talking about.

→ Reply

5 years ago, # ^ |

← Rev. 3 →

on line 34 (without comment-i just count from up)

need to change from>>> l = one_pos[0] — k — 1; //left free length to >>> l = one_pos[0] — k; //left free length

** just need to remove -1 .. i think you did it mistakenly..

→ Reply

5 years ago, # |

← Rev. 2 →

lol.I just deleted from the final results. They didn’t even give a rating. WTF @MikeMirzayanov:D?

→ Reply

mr_robot11

5 years ago, # ^ |

← Rev. 3 →

-Mike

I guess all participant with wrong submissions(accepted initially) for problem D along with the hacked ones are removed from official rank list. And rating has been updated for the rest of the participant.

→ Reply

5 years ago, # ^ |

well well well. I solved 3 tasks. I took the 900 place.I had to get 45 to the rating. And i was kicked? Really? While the rest of the participants got their rating? Very nice idea.Bravo

→ Reply

ErasedSoul

5 years ago, # ^ |

Really it hurts.

→ Reply

DaoTa

5 years ago, # |

Why my rating is no change? My rating less than 1600, but now my rating is no change!

→ Reply

Martian4T

5 years ago, # ^ |

My rating did not change either. Someone tell me that post here #bugyforces , I don't know if it is a joke, but there's nothing to lose, I think...

→ Reply

TheScrasse

5 years ago, # |

Isn't problem 1367F2 - Flying Sort (Hard Version) too similar to 1223D - Sequence Sorting? I got AC on the easy version by just copying the solution of 1223D.
Submissions: 72059675 84097673

→ Reply

Rohit1111

5 years ago, # |

Why I'm not in the rank list? My rating didn't change either.

→ Reply