Codeforces Round #538 (Div. 2)

6 лет назад, # |

-26

i don’t understand any of this can someone explain

→ Ответить

aryaman

6 лет назад, # ^ |

+28

OMEGALULGRAPE

→ Ответить

mtdrewski

6 лет назад, # ^ |

← Rev. 2 →

+21

ALL HAIL THE MIGHTY OMEGALULGRAPE

→ Ответить

6 лет назад, # ^ |

-24

i am confused and you come here to make fun of me and confuse me even more? classic slav attitude...

→ Ответить

M_H_H_7

6 лет назад, # |

+32

GreenGrape everywhere...

→ Ответить

Dr_Park

6 лет назад, # |

Good Luck to All!

→ Ответить

tryhard

6 лет назад, # |

+83

GreenGrape in two consecutive rounds, you must be joking

→ Ответить

6 лет назад, # |

← Rev. 2 →

-129

writing an announcement five days before a round -> bad round

→ Ответить

6 лет назад, # ^ |

+30

At least it showed my bad patience :D

→ Ответить

6 лет назад, # ^ |

-89

bad patience -> bad round

→ Ответить

sguu

6 лет назад, # ^ |

Is That Angel/Angle Said u to write so?? :thinking: rotavirus

→ Ответить

6 лет назад, # ^ |

-27

no, angel said to write a comment about dead boi

→ Ответить

Adibov

6 лет назад, # ^ |

I think it's vice versa and it means that this round is important for him and he worked on it well.

→ Ответить

6 лет назад, # ^ |

-33

important != worked well

→ Ответить

EmilConst

6 лет назад, # ^ |

← Rev. 2 →

Furthermore, important != bad work

→ Ответить

caojiangxia

6 лет назад, # |

Kuroyukihime round? awesome!

→ Ответить

6 лет назад, # ^ |

So far the round is not anime-themed...

... yet Lotus will not disappoint ya ;)

→ Ответить

caojiangxia

6 лет назад, # ^ |

+11

that's fantastic! i can not waiting anymore!

→ Ответить

thanhloi

6 лет назад, # |

-20

Vietnamese, raise your hand!!!!!

→ Ответить

Kamalia

6 лет назад, # ^ |

You speak the language of the trees?

→ Ответить

dm1k9thisyear

6 лет назад, # ^ |

No, the trees speak his language.

→ Ответить

tantam75

6 лет назад, # |

+13

Good luck for your first round! I'm feeling some math here

→ Ответить

C137

6 лет назад, # |

I dont know if I can ask this, but which is the interactive problem? C, D, E or F ???

→ Ответить

aryanc403

6 лет назад, # ^ |

+93

All you need to know is there will be an binary search problem.

→ Ответить

tantam75

6 лет назад, # ^ |

+33

Or a magic random problem

→ Ответить

dorijanlendvaj

6 лет назад, # ^ |

+23

With binary search.

→ Ответить

0101-1001

6 лет назад, # ^ |

+41

On bits.

→ Ответить

RayPatterson

6 лет назад, # ^ |

-35

or HLD + FFT.

→ Ответить

Karabutsa

6 лет назад, # ^ |

← Rev. 2 →

+18

your wish was granted

→ Ответить

6 лет назад, # ^ |

+13

Why did you wish for this bro :D

→ Ответить

tantam75

6 лет назад, # ^ |

+13

I knew you bro xD

→ Ответить

IIIIIIIIIIIIIIIIIIIII

6 лет назад, # |

Did anybody notice that there are less comments than shown in the blog.

→ Ответить

6 лет назад, # ^ |

+15

Some spams were hidden by the administrators.

→ Ответить

vivace_jr

6 лет назад, # |

+23

Dont worry guys Not every grape is Greengrape

→ Ответить

RayPatterson

6 лет назад, # ^ |

+21

Purple grapes taste better.

→ Ответить

6 лет назад, # ^ |

How about black grapes? :D

→ Ответить

RayPatterson

6 лет назад, # ^ |

never knew they exist D:

→ Ответить

6 лет назад, # |

-28

romania!!! unite for this contest !!!

→ Ответить

6 лет назад, # ^ |

-25

romani unitiva!!! acum ori niciodată!

→ Ответить

gold1103

6 лет назад, # |

← Rev. 2 →

+20

I hope the difficult gap between problems can be proper.More personally,I hope there will be a problem(maybe problem D) whose difficulty is between 1700 and 1900.In recent contests,the gap between C and D is always wide(such as 1500 and 2200),which is ,to be honest, unfriendly to me(rating between 1800 and 1900).In many contests,I pass the first three problems in 30 mins and cannot solve problem D in remaining time.

→ Ответить

CRAYONAZO

6 лет назад, # ^ |

Try problem E

→ Ответить

gold1103

6 лет назад, # ^ |

Personally,this contest's problem E is easier than D for me.But I focus on D and fail,so I miss a chance to become purple.

→ Ответить

Chiakisa

6 лет назад, # |

Interactive problem，I'm not good at it,sad... Hope it won't be too difficult.

→ Ответить

T1duS

6 лет назад, # |

They didn't complete surgery on GreenGrape

→ Ответить

SugA

6 лет назад, # |

+17

Just a random fact, GreenGrape has never been GreenGrape .

→ Ответить

HosseinYousefi

6 лет назад, # ^ |

+13

He was! New year's magic :)

→ Ответить

step_by_step

6 лет назад, # |

+52

Why are there more and more Div2 rounds consisting of 6 problems nowadays? I think that this leads to more implementation and to less thinking. I think it's better when there is one interesting Div2E problem than 2 pure implementation Div2E and Div2F problems.

→ Ответить

6 лет назад, # |

-7

i will get grandmaster this round

→ Ответить

47th-draganov

6 лет назад, # ^ |

+10

good luck!

I believe in you!

→ Ответить

cxkno1

6 лет назад, # |

-6

I wished that there will be 6 nice problems and make me get some new skills in this contest. Thanks to the selfless dedication of the problem provivers.

→ Ответить

6 лет назад, # ^ |

what are you talking about i dont understand

→ Ответить

I_love_VladaMG98

6 лет назад, # ^ |

tf you say to me you little

→ Ответить

6 лет назад, # ^ |

stop harassing people, you might get muted.

→ Ответить

IbragiMMamilov

6 лет назад, # |

+25

→ Ответить

6 лет назад, # |

Auto comment: topic has been updated by AkiLotus (previous revision, new revision, compare).

→ Ответить

chaitanya

6 лет назад, # |

Good Luck to All!

→ Ответить

kishanradia

6 лет назад, # |

What will be the pattern of the points of every problem?

→ Ответить

TheRedLegend

6 лет назад, # ^ |

A 500 B 1250 C 1500 D 2000 E 2000 F 2750

→ Ответить

Pi-nan

6 лет назад, # |

what is pretest 10 for problem C?

→ Ответить

6 лет назад, # ^ |

I think it breaks some overflow checkers, namely the ones that test if your new product is less than your old product. You can have overflow and still have the new product be greater than your old ones, and in this case I believe it is because they had some prime that was greater than 4e9 that was getting squared.

→ Ответить

Pi-nan

6 лет назад, # ^ |

"You can have overflow and still have the new product be greater than your old ones", how to handle this ?

→ Ответить

w1kku

6 лет назад, # ^ |

You could use long doubles for checking overflows or, possibly less stupidly, GCC's __builtin_mul_overflow

→ Ответить

Pand9

6 лет назад, # ^ |

Or instead of n >= p * p0 check n / p >= p0.

→ Ответить

Pi-nan

6 лет назад, # ^ |

Thanks! It worked

→ Ответить

natofp

6 лет назад, # |

Pretest 12 E?

→ Ответить

lychao

6 лет назад, # ^ |

← Rev. 2 →

RAND_MAX is 32767, u should extend it.

→ Ответить

natofp

6 лет назад, # ^ |

Oh my god...

→ Ответить

sdnr1

6 лет назад, # ^ |

-42

So basically random_shuffle would not shuffle properly for N ≤ 10⁶?

If this is the case then it is really bad problem setting because this is not something of common knowledge and many people would have encountered this error even though the had the solution.

→ Ответить

lychao

6 лет назад, # ^ |

← Rev. 2 →

Yes, but I think we can use some tricks to make it work in N<=1e6 even though it is not actually uniform distribution.

→ Ответить

6 лет назад, # ^ |

← Rev. 2 →

+91

"The problem is bad if it requires some knowledge that I don't have" doesn't sound like a reasonable approach to me. The fact that random_shuffle() isn't very random by default is important thing to know, and your comment sounds like "It is bad to expect us to know that cout<<endl; is slow" or "It is bad to expect us to know that cache misses are slowing things down".

→ Ответить

sdnr1

6 лет назад, # ^ |

-13

It seems many people had the same issue so it isn't really common knowledge that inbuilt randomisation in C++ does not work properly for sizes greater than 32767.

I do not mean to disrespect the problem setters, but it does seem like this specific piece of knowledge is not known to many. Otherwise I would not have said anything like that. Although I do understand that if I am coding in C++ I should know it well enough to be able to code all kinds of solutions.

→ Ответить

6 лет назад, # ^ |

+23

I still think that your reasoning makes little sense.

The fact that a lot of contestants don't know (or don't think about) something doesn't imply anything. I would agree if that was something very compiler-specific or CF-specific, like exploiting particular compiler bug that behaves clearly against the standard of C++ and has been introduced in particular version of compiler. I also didn't manage to get this problem initially, and it took me long time to figure out my mistake — but that's my fault, and not setter's.

Rabin-Vazirani algorithm isn't known to majority of CF users either, should we criticize any setter for deciding to use it for their problem? :)

Moreover, setters are so nice here that they even included this test in pretests. Can you imagine the mess we'd have otherwise? :)

→ Ответить

sdnr1

6 лет назад, # ^ |

-19

Well I do agree to that. After all, someday someone had to make such a problem which would have highlighted this issue despite the fact that this has been posted in a blog earlier (because many people don't read blogs or simply don't happen to come across them). I guess this was inevitable.

Again, I don't mean to say this was setters' fault. All I wanted to say was that maybe the problem could have been set in a way that this issue would not have occurred (maybe setting N ≤ 10⁴). But then this is also true for many other situations, like the need for fast IO (though I am not the setter so I don't have a say in this :P). In no way I mean to disrespect the setters, and I truly believe all setters do a great job at bringing us new problems to solve.

→ Ответить

6 лет назад, # ^ |

In what sense is including this test different from including a test for the random generator of an arbitrary language? I could see which are the first 60 numbers the program would ask for and make sure they are not coprime positions. Also using any solution (assuming it does not seed on time) I can break it. I don't think this test adds to the quality of the problem and it is specifically targeted towards one of the allowed languages. Is there a test with the first 30 numbers the random of java would generate? Would you consider such a test fair?

→ Ответить

6 лет назад, # ^ |

Yes, I would consider it totally fair.

Moreover, your analogy sounds wrong to me. You don't need to know much about generator here — the solution is going to fail no matter what seed is used in generator.

You are complaining that the solution doesn't work because constraints are too large. That's like saying "my solution with int didn't pass only because in your problem n<=1e18".

→ Ответить

6 лет назад, # ^ |

-18

I don't agree. It is like having the codeforces server using integers fit up to 2^15 and my solution failing because I had used int. On my machine and ideone rand() is not limited to 32k: https://ideone.com/r91m04 And c++ standard does not guarantee the size of int to fit 2^31: https://stackoverflow.com/a/589684/812912

→ Ответить

6 лет назад, # |

What is the 12th pretest on E? I kept getting wrong answer on this one

→ Ответить

6 лет назад, # ^ |

+11

Probably a test exploiting https://codeforces.net/blog/entry/61587.

→ Ответить

nantf

6 лет назад, # ^ |

I did this too,so I changed random_shuffle into my_rand.

→ Ответить

1a2a3a

6 лет назад, # |

+11

what is the pretest #6 in D? ..

→ Ответить

baobab

6 лет назад, # |

Can someone please explain how to solve D?

→ Ответить

6 лет назад, # |

Does interval DP not work for problem D?

→ Ответить

6 лет назад, # ^ |

It does, my solution is df[from][to]

→ Ответить

6 лет назад, # ^ |

Interesting. I kept getting WA on pretest 6. What was your idea?

→ Ответить

6 лет назад, # ^ |

-8

If the first and the last letter of the interval do not much you either will convert the longest prefix matching the first letter or the longest suffix matching the last letter. If the two letters match you will change both the longest suffix and the longest prefix on the last move.

→ Ответить

6 лет назад, # ^ |

So it seems that you're doing the DP by decreasing the size of the DP interval?

→ Ответить

6 лет назад, # ^ |

Yeap

→ Ответить

6 лет назад, # ^ |

+10

I did my DP with increasing size of the DP interval (I suppose that should work?). I couldn't seem to come up with a counter case though.

→ Ответить

M.A.H.M.O.O.D

6 лет назад, # ^ |

It should at least pass the pretests I did something similar to your solution. Did you take every possible starting position?

→ Ответить

6 лет назад, # ^ |

← Rev. 3 →

My program should have accounted for every possible starting position. I guess the code speaks better for itself. 49731308

I think my transitions may be wrong but I'm not sure how.

→ Ответить

swapnil159

6 лет назад, # ^ |

I did it with increasing interval. you can have a look at my code- here

→ Ответить

6 лет назад, # ^ |

Thanks

→ Ответить

6 лет назад, # ^ |

I'm probably misunderstanding you, but I don't think what you said is true. If your array is 1 2 2 3, you can change this minimally to 2 2 2 2, which doesn't match the first or last letter.

→ Ответить

6 лет назад, # ^ |

Hmm no you can not. You have to change it first to 2 2 2 3 and then to 2 2 2 2

→ Ответить

6 лет назад, # ^ |

Ok, I misunderstood what you meant. I thought you meant that the prefix/suffix was going to match the exact color of the endpoints.

In any case, I see where my understanding of the problem was flawed.

→ Ответить

6 лет назад, # ^ |

What are the recursive calls? I imagine it's the classic (l+1, r) and (l, r-1), but sometimes you'll have to add 1 to your result, namely if it's not possible to get (l+1, r) to be the color of c[l] or (l, r-1) to be the color of c[r], but I couldn't find a good way to find when that's possible or not.

→ Ответить

6 лет назад, # ^ |

That is the typical way I implement DP — recursion with memoization

→ Ответить

TrickmanOff

6 лет назад, # |

Задача C нагло была взята отсюда!

→ Ответить

Wandoka

6 лет назад, # ^ |

I think it's just a coincidence

→ Ответить

6 лет назад, # ^ |

← Rev. 2 →

+39

-> Три вьетнамских автора
-> acmp

→ Ответить

Dalgerok

6 лет назад, # ^ |

-> GreenGrape

→ Ответить

6 лет назад, # |

What to do in E after finding Xn? I asked for 30 random values and tried to find d based on these, but it doesn't have to be correct

→ Ответить

linjek

6 лет назад, # ^ |

i do the same and pass the pretests

→ Ответить

6 лет назад, # ^ |

So I may have failed just because I forgot to delete the line where I was checking something...

→ Ответить

linjek

6 лет назад, # ^ |

how u calculate d ? i find all gcd between all pairs, smth like :

g = gcd(d, a[j] — a[i]) , for every i, j

→ Ответить

6 лет назад, # ^ |

I did the same and could not pass pretest 12

→ Ответить

6 лет назад, # ^ |

I had a list of all common divisors of differences. Final list could have more than 1 element, so d is last element in list, which is the greatest one. I made mistake here and said that d is first element of the list which is actually 1 :)

→ Ответить

nantf

6 лет назад, # ^ |

Use your own rand instead of C++ rand.

→ Ответить

6 лет назад, # ^ |

I had something like cout<<"xn is "<<xn<<endl; and didn't delete it. mt19937 should work for randomization btw

→ Ответить

lychao

6 лет назад, # ^ |

In fact u are findng at least 30 rand number and get their common gcd, if it is 1, the d is true. Actually, it is correct at most situations.

→ Ответить

6 лет назад, # ^ |

+16

That seems to be the intended approach.

Probability of failure is very small. Let's assume that you found dFake which is equal to k * d. This means that all your queries were lucky to hit position with same remainder modulo k, and the chance for it is roughly (1 / k)^{NumberOfQueries - 1}.

→ Ответить

https://codeforces.net/contest/1114/submission/49743195

6 лет назад, # |

← Rev. 2 →

Why fail segment tree solutions and pass BIT solutions in F? (Offline, solve for each prime separately) -_-

→ Ответить

proofbycontradiction

6 лет назад, # ^ |

My segment tree managed to pass the time limit.

→ Ответить

6 лет назад, # ^ |

This isn't the segment tree solution I was talking about. There is another approach using segment tree that solves the problem offline by handling one prime at a time and merging all answers. Such solution using segment tree gets TLE but BIT gets AC.

→ Ответить

linjek

6 лет назад, # |

i think for about 40 minutes that's is sum in F instead of mult :(

→ Ответить

Heisenberg

6 лет назад, # |

I was literally begging for pretest 5 in 'C' :(

→ Ответить

Jhin

6 лет назад, # |

what is pretest 7 in C :(

I just checked how much each prime for b exists

and applied this func for each prime

long long factr(long long n,long long p) { long long po=0; for(long long i=p;i<=n;i*=p)po+=n/i; return po; } and then I got the result after division first array to the second (not sure if this is important to explain first array and the second )

what's the mistake maybe just tell me the right solution and I'll know it because I have no idea

→ Ответить

Ufowoqqqo

6 лет назад, # ^ |

Have you checked your data type? I changed from long long to unsigned long long, and passed Pretest 7.

→ Ответить

Jhin

6 лет назад, # ^ |

that would make a difference in the function I wrote above ?

→ Ответить

Ufowoqqqo

6 лет назад, # ^ |

You may try remove i, and let n /= p and po += n / p instead. I passed the pretests in this way.

→ Ответить

6 лет назад, # ^ |

long long i=p;i<=n;i*=p

Is there anything in your code to make sure that i*=p doesn't overflow long long?

The idea that you described sounds right.

→ Ответить

Jhin

6 лет назад, # ^ |

yikes No what a sad mistake

→ Ответить

aswwwanth

6 лет назад, # ^ |

49731384 Can someone help me with this. I am getting WA on Pretest 10 for problem C.

→ Ответить

T1duS

6 лет назад, # |

E test case 12?

→ Ответить

6 лет назад, # ^ |

Anti rand() testcase.

→ Ответить

T1duS

6 лет назад, # ^ |

I used srand(time(0))

→ Ответить

6 лет назад, # ^ |

Err yes — the C standard srand() and rand() will only generate integers up to RAND_MAX = 32767. The array size is quite large, and such low-range randomization could be easily countered.

→ Ответить

lessmeaning

6 лет назад, # ^ |

I don't know what is worse anti-rand or anti java Arrays.sort tests

→ Ответить

eidan

6 лет назад, # ^ |

← Rev. 2 →

My lazy way of solving this:

long long RAND(){
    long long ret = 0;
    while(ret < n) ret = ret * RAND_MAX + rand();
    return ret % n;
}

→ Ответить

oToToT

6 лет назад, # ^ |

← Rev. 2 →

How about using C++ random

#include <random>
mt19937 gen(time(NULL));
uniform_int_distribution<int> range(1, 1000000000);
auto RAND = bind(range, gen);

→ Ответить

Guaguapi

6 лет назад, # |

I feel liangliang

→ Ответить

Ufowoqqqo

6 лет назад, # |

Tonight I learnt one thing from C, that one should never try multiply two numbers as large as 1e18... Failed several times for it. qwq

→ Ответить

6 лет назад, # |

Auto comment: topic has been updated by AkiLotus (previous revision, new revision, compare).

→ Ответить

Origenes

6 лет назад, # |

Anyone passed E without randomisation?

→ Ответить

mohamedeltair

6 лет назад, # |

So is problem E just testing that we have read this blog Don't use rand(): a guide to random number generators in C++? Really?

→ Ответить

6 лет назад, # ^ |

+20

Problem E was only about knowing that rand and random shuffle might fail you.

→ Ответить

MetB

6 лет назад, # ^ |

← Rev. 2 →

-23

Wow. So we have to be prepared for THIS type of problems now too? So it's kinda STDforces?

→ Ответить

6 лет назад, # ^ |

+35

I’ve once heard that it’s a programming competition. And yes, you must know how basic stuff works in your favourite language.

→ Ответить

MetB

6 лет назад, # ^ |

← Rev. 2 →

-6

I don't mind. I'm just curious if this exploit-as-a-main-idea-stuff is going to be a trend.

→ Ответить

6 лет назад, # ^ |

It's like exploiting hashes modulo 2^64: if you are doing it often enough, everybody knows it and it gets rather pointless as an "exploit".

I would even say that my example is far from perfect: hashes modulo 2^64 have advantages (like faster execution), so you may still reasons to gamble "Do they have tests against it?.."; and here the fix is pretty much one-liner without significant side effects.

→ Ответить

eidan

6 лет назад, # ^ |

+73

Wow, mathforces, quickforces, hackforces, stdforces...

You guys just never run out of ways to complain about contests.

→ Ответить

eisen_shinzou

6 лет назад, # ^ |

← Rev. 2 →

+61

delayforces, isitratedforces, forcedforces, damnforces, unratedforces, grapeforces, overflowforces, cheatforces, longstatementforces, pupilforces, foolishforces...

→ Ответить

dorijanlendvaj

6 лет назад, # ^ |

Add time(NULL) and random_device not being random to that list.

→ Ответить

6 лет назад, # |

What is correct structure for F? My first thoutgh is segment tree for each prime with add on segment and sum on segment. But then I realize that segment tree can't do that from my understanding.

→ Ответить

mango_lassi

6 лет назад, # ^ |

+11

That is entirely possible with lazy segment tree, but it uses too much memory.

I had a segment tree storing the product of values in an interval, and a segment tree for every prime telling if the prime exists on the interval. The second type of segment trees just use vector<bool>, so they don't use too much memory.

Answer to every query is just product of numbers in the interval * (p-1 / p) for every prime p that has at least one appearance on the interval. The division is of course modular division.

In total this is O(q * log(n) * (log(n) + cp)), where cp is the amount of primes below 300

This was quite annoying to fit in time limit however, since I don't know how to write a lazy interval multiplication segtree without taking modpow log(n) times. TLE'd once but some changes passed pretests, taking around 3s

→ Ответить

6 лет назад, # ^ |

+27

You can make things easier by noticing that there are 62 primes below 300, so you can store a single long long with a bitmask of primes available, and then have a single segment tree for all primes and do all updates/queries with bitwise operations.

→ Ответить

6 лет назад, # ^ |

Thanks.

→ Ответить

6 лет назад, # ^ |

One segment tree for product with range multiplication and the second one with bitsets for primes in range.

→ Ответить

6 лет назад, # ^ |

Segment tree got TLE with this idea. But BIT passed pretests. :(

→ Ответить

laplace_3

6 лет назад, # |

Now everybody knows who is the author of problem A. Of course, it's GreenGrape ;)

→ Ответить

mohamedeltair

6 лет назад, # |

Problem C Largest power of k in n!

→ Ответить

byene

6 лет назад, # ^ |

Yeah，I thought of the idea too, But I have not done that problem....sadT_T

→ Ответить

mohmahkho

6 лет назад, # |

what is wrong with my solution on C? 49728844

→ Ответить

nantf

6 лет назад, # ^ |

Try this. 9 36.The answer should be 2.

→ Ответить

mohmahkho

6 лет назад, # ^ |

I got that :( f *= f; always create a copy of f then multiply it in the loop. it should be like : f *= copy_f;

→ Ответить

IbragiMMamilov

6 лет назад, # |

+17

Я, конечно, понимаю, что далеко не всем известен Тимус, но, как вы объясните, что С лежит на Тимусе уже много лет? https://acmp.ru/index.asp?main=task&id_task=200

→ Ответить

unreal.eugene

6 лет назад, # ^ |

+42

Это не Тимус

→ Ответить

IbragiMMamilov

6 лет назад, # ^ |

+15

лол, да, сори, я даун. Но, проблема задачи остается той же

→ Ответить

6 лет назад, # |

20 minutes per problem? I want to think in deeper way, not just to be the fast-solving machine :( Why codeforces is pushing participants(in terms of time) so hard?

→ Ответить

6 лет назад, # ^ |

-12

noob

→ Ответить

6 лет назад, # ^ |

← Rev. 2 →

Don't insult, playboy. FYI I prepassed ABCDE in this contest.

→ Ответить

M.A.H.M.O.O.D

6 лет назад, # ^ |

pro

→ Ответить

6 лет назад, # ^ |

-8

FYI i dont give shit

→ Ответить

6 лет назад, # |

-17

C was gay af

→ Ответить

Darshan_Patel

6 лет назад, # |

what would be the ans in test case in problem C: 5 100?

→ Ответить

Heisenberg

6 лет назад, # ^ |

→ Ответить

Siberian

6 лет назад, # |

← Rev. 3 →

-58

I_hate_greengrape

→ Ответить

_overrated_

6 лет назад, # ^ |

I love GreenGrape. His problems are very beautiful.

→ Ответить

Siberian

6 лет назад, # ^ |

-12

NOOOOOOOO, all his problems are from clay. Mathematical clay.

→ Ответить

Siberian

6 лет назад, # ^ |

The best. I hate greengrape, and now i start hate all other people))

→ Ответить

MofK

6 лет назад, # |

+177

Wow what the fuck is wrong with those people bashing the authors for including anti rand() tests in pretest? If they weren't kind enough to make those pretests for you then surely someone would hack you in like 5 minutes. Do you guys seriously expect the authors to publicly announce Hurr durr just saying rand() is weak you should not use that but this problem is definitely not about random?

Maybe next time try to actually appreciate the knowledge you gained in contests.

→ Ответить

6 лет назад, # ^ |

-9

omfg fuck author rand() gave me WA on contest noob tests my code best >:(((

→ Ответить

eidan

6 лет назад, # |

+12

First time I actually enjoyed a GreenGrape contest.

→ Ответить

Found a perfect place for you to meet people of your kind :o

6 лет назад, # |

-34

dissapointed with the contest overall but the setters are some weebs so what to expect

→ Ответить

MofK

6 лет назад, # ^ |

+30

→ Ответить

6 лет назад, # ^ |

-7

sorry noob i dont get it

→ Ответить

MofK

6 лет назад, # ^ |

You will get it once you achieve something other than trolling for fake internet attention haha cheers ;)

→ Ответить

6 лет назад, # ^ |

how can attention be fake? and who said I am trolling? I generally think anime is bad cheers ;); ) ;)omg im cool kid;);):)

→ Ответить

laplace_3

6 лет назад, # ^ |

Yup! You are a "cool fool"

→ Ответить

6 лет назад, # ^ |

omg i use big words guys

→ Ответить

SugA

6 лет назад, # |

I think intersection enjoyed this contest!

→ Ответить

intersection

6 лет назад, # ^ |

Me too.

→ Ответить

6 лет назад, # ^ |

-22

how could you enjoy such a bad contest? it was so poorly made i am legitimately starting to wonder if it was a bad joke being played on us.

→ Ответить

WhaleVomit

6 лет назад, # |

turns out rand() has max value 32768 on CF... rip master

→ Ответить

hocky

6 лет назад, # |

← Rev. 3 →

+29

For those of you who are looking for a good and clear randomization implementation 49733774 Correct me if I'm wrong.

Thank you AkiLotus GreenGrape cdkrot neal

→ Ответить

6 лет назад, # |

WA#108 E... How to know did it fall due chance 1.86185·10^- 9?)

→ Ответить

STommydx

6 лет назад, # ^ |

I failed that too. It should be some hacks regrading std::random_device. I saw lots of submission failing 108 are using std::random_device.

→ Ответить

Riatre

6 лет назад, # ^ |

That's because the output sequence of std::random_device on Codeforces is deterministic, check this.

By the way, you are using std::random_device in wrong way, check this.

→ Ответить

proofbycontradiction

6 лет назад, # ^ |

Yeah, I failed on that test case too.

→ Ответить

6 лет назад, # |

+24

NO!!!! WHY????

→ Ответить

6 лет назад, # ^ |

+14

rank 2 to rank 128...

→ Ответить

6 лет назад, # ^ |

+18

Found you! Original rank 1 (8089 points):

→ Ответить

hmrockstar

6 лет назад, # |

What is wrong with this code.

→ Ответить

6 лет назад, # ^ |

flag might exceed the range of lld and without fortune it can be in range [0, n - 1] again.

→ Ответить

hmrockstar

6 лет назад, # ^ |

Thanks!

→ Ответить

Saat

6 лет назад, # ^ |

If you have a sufficiently big prime (say, greater than 5e9), flag will overflow during your while(n / flag > 0) cycle.

→ Ответить

hmrockstar

6 лет назад, # ^ |

Thanks!

→ Ответить

STommydx

6 лет назад, # |

+67

→ Ответить

6 лет назад, # ^ |

+10

Hacks on RANDOM-NUMBER-GENERATOR??!! That's pure evil!!

→ Ответить

proofbycontradiction

6 лет назад, # ^ |

← Rev. 2 →

Today I learned that pure evil is less than 2³². The funny thing is that random_device is deterministic on codeforces.

→ Ответить

https://codeforces.net/contest/1114/submission/49736873 https://codeforces.net/contest/1114/submission/49736886

6 лет назад, # |

-8

Auto comment: topic has been updated by AkiLotus (previous revision, new revision, compare).

→ Ответить

_asmah98

6 лет назад, # |

Why does using long double instead of long long worked for passing test case 10 in Q.C ?

→ Ответить

gratus907

6 лет назад, # ^ |

Even long long can have overflow issues dealing with big primes, something like 1e10 or so. 1e10 * 1e10 makes number even bigger than long long limit.

→ Ответить

Prakash_Gatiyala

6 лет назад, # |

why my Test Case 17 is failing: Problem B @Akikaze

Test: #17, time: 0 ms., memory: 140 KB, exit code: 0, checker exit code: 1, verdict: WRONG_ANSWER Input

69 9 5

-7 10 7 3 8 -9 9 -6 -5 -1 6 7 -3 10 2 3 -10 3 1 -7 -9 -10 7 2 -10 -7 -5 -5 -8 -7 4 3 10 -7 -8 7 4 6 -5 -6 8 -7 6 -5 -1 -4 0 -3 1 -2 -8 -3 -4 9 8 5 5 -5 -4 10 6 -6 -2 4 -6 -6 -3 -3 0

Output

136

12 27 41 52

Answer

136

13 32 47 57

Checker Log

wrong answer the sum of beauty in contestant's partition does not match with contestant's answer: expected sum = 136, found 130

→ Ответить

Keshi

6 лет назад, # ^ |

you are using the least in "bigger" numbers for several times. i got wrong on this test ,too. you should use a flag not to use it more.

→ Ответить

tataky

6 лет назад, # |

+37

Hello codeforces, I want some advice about my sysfailed code in problem E.

the only diffrenece between two codes is random function. the one with (rand()<<15)|rand() fails at test 101, but (rand()<<16)|rand() successfully passes all cases. I thought that if cpp rand() generates [0,32767] uniformly, then (rand()<<15)|rand() can generate [0,2^30] uniformly, but the result says it isn't.

Could anybody solve my curiosity? Thanks in advance.

→ Ответить

Motarack

6 лет назад, # ^ |

+43

rand()<<15|rand() does generate [0,2^30] uniformly.

I think that test 101 is an anti-test for rand(time(0)), or in other words all values of time(0) that start from somewhere around the end of the contest until a few hours after that, which is around 10800 values for 3 hours, so any code that uses srand(time(0)) and was judged during that time will fail, resubmitting should get AC.

rand()<<16|rand() most likely works because test 101 was based on rand()<<15|rand(), and no similar test was based on rand()<<16|rand().

All of what I said is might not be true, but I couldn't think of any other explanation.

→ Ответить

yp155136

6 лет назад, # ^ |

Yeah, that's right.

I did hacked rand()<<15|rand() and srand(time(0)); during the contest, and I generated 50000 values.

https://codeforces.net/contest/1114/hacks/536367/test

→ Ответить

SlowDecay

6 лет назад, # |

+29

Apparently, my this submission got WA on test 101 in contest time and now the same solution is getting AC.

WA Submission

AC Submission (added an extra space before the last line because they weren't allowing me to submit the same code twice).

→ Ответить

6 лет назад, # ^ |

← Rev. 2 →

AC submission doesn't have the line x ^= 16153382;. rand() is a bad random number generator in general, and using it multiple times actually makes it worse. Also, rand() on CF gives atmost 2¹⁵ - 1 anyway, so the lines x &= (1 << 15) - 1 and y &= (1 << 15) - 1 don't have any meaning.

→ Ответить

SlowDecay

6 лет назад, # ^ |

May be it's not the most ideal random number generator. But that's not the point. The point is I should get consistent verdicts if I submit the same code repeatedly. And it appears that basically using srand(time(0)); is what caused me that WA, which is frustrating because many other contestants also used it and got AC.

→ Ответить

idiot_owl

6 лет назад, # |

← Rev. 5 →

What will be the output of this test case for D:
5
6 7 6 8 6

→ Ответить

aboAdnan

6 лет назад, # ^ |

It's 3. My previous wrong solution was printing 2 for this test, because it wasn't take in consedirstion that the chosen start is unchangable, so it proceed your example like following:

7 -> 6

8 -> 6

But the correct process is:

If we choose the index 2 (with number 7) as a start, then we will change it to 6, so the array will be: 6 6 6 8 6, then we connot change the index 2, so the array should become: 8 8 8 8 6, then: 6 6 6 6 6, so the answer is 3.

→ Ответить

idiot_owl

6 лет назад, # ^ |

Thanks a lot! I too misunderstood the question. :D

→ Ответить

sherri_ice

6 лет назад, # |

Wow, cool song

→ Ответить

6 лет назад, # |

-34

alright, this is enough. i have so many times expressed my concern about programming problems being wrongfully, but intentionally mixed with math. problem C was a nightmare because it had useless math. why do you keep making these? mid problem set you think “i can’t make this hard in a challenging way so i’m just going to bombard it with some random useless stuff”? this is not okay.
also, seeing from the editorial you really didn’t care about the whole contest and/or about us either.. it was a joke. i had high hopes but they all fell short.

→ Ответить

dotorya

6 лет назад, # |

+36

Trying to make some rand(time(0)) code fail? Well, I'm not the great fan of that idea, but it can be an option if problemsetter can block every possible code that he can think of. The problem is that it's definitely impossible. If I use "rand() << 16 | rand()" instead of "rand() << 15 | rand()" by mistake, it will still work. If I use "for(int i = 1; i <= 5; i++) val = (val * RAND_MAX + rand()) % (1<<30)", which is my common random number generating code, it will still work too. If you can only make that exact random generating method, then what's the whole point of making those anti-rand tests? At this point, it's totally unfair to make some of the codes fail only by the reason that he used the same random number generator with the problemsetter.

→ Ответить

6 лет назад, # ^ |

Well, my initial idea was blocking srand() and its derivatives only. I have thought of time(0) stuff, but then I didn't go on with making such failed, because:

There'd be too many seeds to kill all of them.
Using current time from epoch has been a common method in choosing seeds for RNGs, thus causing such approach failed (for not being precise enough to be unpredictable) would be too unfair, even to me.

However, hacks are here and there. This kind of behaviours was unavoidable, and we still had to include such hacks into systest (tests with indices ≥ 97 were hacks), thus making things more unfair than what I wanted at first.

→ Ответить

Dr_Park

6 лет назад, # |

I keep getting Runtime Error on B :( What could be the problem? I checked the memory capacity, return value, and declared them in the global variables but nothing seems to work!

#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

vector<pair<int, int> > vec;
bool pick[2000001] = {0};
vector<int> vec2;

bool myfunc(pair<int, int> a, pair<int, int> b) {
	return (a.first >= b.first);
}

int main() {
	int n, m, k; scanf("%d %d %d", &n, &m, &k);
	for (int i = 1; i <= n; i++) {
		int a; scanf("%d", &a);
		vec.push_back({a, i});
	}
	sort(vec.begin(), vec.end(), myfunc);
	long long int ans = 0;
	for (int i = 1; i <= m * k; i++) {
		pick[vec[i-1].second] = true;
		ans += vec[i-1].first;
	}
	int bucket = 0;
	for (int i = 1; i <= n - 1; i++) {
		if (pick[i]) {
			bucket++;
		}
		if (bucket == m) {
			bucket = 0;
			vec2.push_back(i);
		}
	}
	printf("%lld\n", ans);
	for (int i = 1; i <= (int) vec2.size(); i++) {
		printf("%d ", vec2[i-1]);
	}
	return 0;
}

→ Ответить

Yl4682B5

6 лет назад, # ^ |

← Rev. 3 →

I think you made some mistake when you print the answer, have a try on this data :

6 1 4
4 3 2 2 1 1

your code has output 4 numbers in the second line, while the correct case should be 3. By the way, I suggest you use > instead of >= in myfunc() , it seems that c++ requires strictly lower or bigger.

→ Ответить

Dr_Park

6 лет назад, # ^ |

Thanks! Got an AC! Hope I don't make mistakes on indexing next time...haha^^;

→ Ответить

Yl4682B5

6 лет назад, # |

First time become blue in this round, feeling good ^_^ .

→ Ответить

HanaYukii

6 лет назад, # |

Wonder how to prevent hack of E by random generator

→ Ответить

ahshafi

6 лет назад, # |

In problem C, I m getting WA in test case 7 . But I m getting right answer in my compiler. but CF compiler is showing another output and giving me WA in test case 7 . I m using gnu g++ 14 . Can anybody have a look at my code ? https://codeforces.net/contest/1114/submission/49753432.

→ Ответить

portgas_d_raf

6 лет назад, # |

For Problem C where can i read the necessary properties of factorial to understand the logic behind the given editorial?? I cant understand how the problem was simplified to just that. AkiLotus

→ Ответить

GrandDaddy

6 лет назад, # ^ |

Consider the b-ary representation of n!. Let it be represented by the digits d1,d2,d3,d4,d5,d6 (I'm considering it consists of 6 digits. It's similar for any no. of digits). Suppose last 3 digits are zero. Then it's decimal representation will be num=d1*b^5+d2*b^4+d3*b^3. The rest terms are not considered because they are zero. Clearly num is divisible by b^3. Here 3 is the maximum power of b that divides n! which is also the no. of trailing zeros. Hence proving the solution. Satisfy yourself with some more examples.

→ Ответить

portgas_d_raf

6 лет назад, # ^ |

Got it man thanks a lot!!

→ Ответить

GrandDaddy

6 лет назад, # ^ |

No problem brother. Happy coding!

→ Ответить

ciwomuli

6 лет назад, # |

In problem C the system says that my code is similar xith xb2403/49705111, ciwomuli/49716822, XY_cpp/49725082;That is because C is similar with the problem P3927 and I use the solution which is last modified at 2017-10-15 14:46

→ Ответить

PengsenMao

6 лет назад, # |

can someone tell me why my solution is wrong?

code

→ Ответить

6 лет назад, # ^ |

Try to get gcd from a[x] - a[y] for all your selected x and y, not only x and max.

→ Ответить

PengsenMao

6 лет назад, # ^ |

Hey,

Thanks for replying

it is still broken...

Code

→ Ответить

6 лет назад, # ^ |

I think that there is a countertest on pure random_shuffle. (Might be hack?) And sorry, using Euclidean algorithm my first suggestion is useless. (gcd(a, b) = gcd(a, b + a))

→ Ответить