Hello everyone! I am red_black boy!!

8 years ago, # ^ |

+50

Are you five years old??

→ Reply

moskalenco_a

8 years ago, # ^ |

+77

If you are red_black boy, what can you do in O(log N) ? :)

→ Reply

8 years ago, # ^ |

+10

→ Reply

notAboAlmanalAnyMore

8 years ago, # |

-67

why in each time when GlebsHP helps preparing the contest , problem C be easy :p

→ Reply

OmaeWaMouShenDeiru

8 years ago, # ^ |

+22

He is now codeforces coordinator, so he helps in every codeforces round, that has nothing to do with Problem C :D

→ Reply

ch_egor

8 years ago, # ^ |

+45

Are you sure? Look at this round and at this problem.

→ Reply

8 years ago, # |

+28

Div. 2 only contest, which means loads of fake new accounts of Div. 1 people... :(

→ Reply

chessmaster

8 years ago, # ^ |

This is bad. Those who are in Division 2 will not be able to rise, as will constantly play fake members of the first division.

→ Reply

chessmaster

8 years ago, # ^ |

+14

the people from the first division. Please participate only out of the competition!

→ Reply

wrdsaj

8 years ago, # ^ |

+17

That's not true anymore. After the rating revolution the number of fake accounts decreased significantly. There was less than 30 new accounts in top-1000 in the last two div2 only rounds, and most of these are not fake for sure.

→ Reply

8 years ago, # ^ |

Although there are just 30 new accounts, but many contestants of div1 have many accounts which had rated. So there aren't only 30 people of div1 use div2 account to participate this round.

→ Reply

8 years ago, # ^ |

Why?They can also participate with asterisk.

→ Reply

trunghai95

8 years ago, # ^ |

+11

Maybe because they love the feelings when their ratings make a big jump (who doesn't, right?)

→ Reply

H0D0R

8 years ago, # ^ |

Like me :)

→ Reply

Mister.bit

8 years ago, # |

← Rev. 3 →

unlucky , i can't participate in this contest because the electricity power cut off from my home at start time of this contest .

→ Reply

Nodare

8 years ago, # ^ |

+20

Sad story.

→ Reply

luka25

8 years ago, # ^ |

+14

Maybe that's good for your rating...

→ Reply

Mister.bit

8 years ago, # ^ |

and maybe not

→ Reply

8 years ago, # |

It maybe my first contest in codeforces, good luck to everyone.

→ Reply

8 years ago, # ^ |

← Rev. 2 →

Good luck, I think you are excellent and beautiful.

→ Reply

SlowDecay

8 years ago, # ^ |

+72

Friend-zoned people everywhere ^

→ Reply

8 years ago, # ^ |

Thank you.

→ Reply

8 years ago, # ^ |

← Rev. 2 →

-14

I have a feeling you will rank the top.

Let's see if I am right after contest.

→ Reply

magdy.hasan

8 years ago, # ^ |

-10

Just a feeling , take a look at his submissions and you'll be sure :D.

→ Reply

8 years ago, # ^ |

You must take a mistake, and I am a newbie.

→ Reply

8 years ago, # ^ |

You must be joking.

I found you using advanced techniques in ur submissions.

→ Reply

8 years ago, # ^ |

Mo's algorithm, I don't think a newbie know this algorithm.

→ Reply

8 years ago, # ^ |

Do you mean the mo's algorithm is advanced technique? I really just start to study Algorithm for one month....

→ Reply

8 years ago, # ^ |

Okay...

Good luck to you, xiao ai.

→ Reply

Navara

8 years ago, # ^ |

Good luck. My first contest as well. :)

→ Reply

8 years ago, # ^ |

Good luck to you.

→ Reply

8 years ago, # ^ |

This my 4th time to take a round. But it's my first time to find the round announcement before the contest... I wonder Why their is not a link to this announcement in the contest page...

→ Reply

farizazmip

8 years ago, # |

+50

Is Delinur still a translator in Codeforces? I feel I haven't see her name in a round announcement for a long time.

→ Reply

JIBANCANYANG

8 years ago, # ^ |

-28

Unable to parse markup [type=CF_TEX]

→ Reply

C137

8 years ago, # |

+32

Oh god, I have two university exams tomorrow :(

But wait a second, stupid university exams won't help me reach the AMC-ICPC :V :V :V

I'm in :D :D :D

→ Reply

8 years ago, # ^ |

Now back to the exams :)

→ Reply

C137

8 years ago, # ^ |

Exams are stupid, they can still wait :3

→ Reply

8 years ago, # |

-12

This contest may become my debut. I looked at your profile and I saw you make contests with more than 5 tasks. Will this hold for today because I want to solve as many problems as possible?

→ Reply

8 years ago, # |

Can't wait to be a candidate master.

→ Reply

8 years ago, # ^ |

So am I. Best wished to us. Good luck & have fun.

→ Reply

8 years ago, # ^ |

+16

Congratulations! You did it

→ Reply

8 years ago, # ^ |

Thank you

→ Reply

8 years ago, # ^ |

You guys are pretty close becoming a candidate master. I still got a a lot of work to do! Best of luck!

→ Reply

ooOOOOoooOOOOo

8 years ago, # |

+14

Good luck to everyone:)

Hope you all have a great leap in your ratings(which is impossible)

→ Reply

8 years ago, # ^ |

+15

→ Reply

RedNextCentury

8 years ago, # ^ |

Challenge Failed, Congratulations!

→ Reply

8 years ago, # ^ |

→ Reply

ehsanoo

8 years ago, # |

← Rev. 2 →

My memories of usual Codeforces' rounds are fading... Usual time? haha! BTW I like contests being held at 8PM MSK. It's a good time for me. I wish it was the usual time.

→ Reply

8 years ago, # ^ |

I wish it wasn't, 8PM MSK is 1:00AM in my local. It's very bad.

→ Reply

CodeForceps

8 years ago, # ^ |

At least you can sleep less and participate, in my country it's 12:05pm. I normally work at that time. I wish it were at 1:00am, I would participate a lot more!

→ Reply

c4cheats

8 years ago, # ^ |

I like this time too. I have high school students work on it and it is 11 am EST which is when the class is. It was perfect!

→ Reply

TripleM5da

8 years ago, # |

Study for Exams or Codeforces Round? why am i even thinking about this :D I am in

→ Reply

8 years ago, # ^ |

Good Decision! A few weeks ago I had the same problem. I decided to go for CF. Got 80+ ratings :)

→ Reply

shahidul_brur

8 years ago, # |

Though I have an exam at University, I am not thinking about this. Absence in a CF round give me much pain than getting less mark in exam.

→ Reply

8 years ago, # |

Damn I have 4 exams tomorrow... Shit I forgot I finished school

→ Reply

shadowfax

8 years ago, # |

-7

wow! problem D, E got the same score? D must be hard.

→ Reply

_Ramtin_

8 years ago, # ^ |

+48

or E might be easy

→ Reply

ace_pocket

8 years ago, # ^ |

or both

→ Reply

mraron

8 years ago, # ^ |

or none of them :D

→ Reply

8 years ago, # |

+27

→ Reply

GiveMinus

8 years ago, # |

very easy problems

→ Reply

8 years ago, # ^ |

Seems fine — only 249 people solved D and 105 solved E.

→ Reply

Hold_The_Door

8 years ago, # |

← Rev. 6 →

-9

Nice contest.

→ Reply

GiveMinus

8 years ago, # ^ |

solve E ! it's the best problem also easy as E

→ Reply

-is-this-fft-

8 years ago, # ^ |

E is easy if you know a thing or two about polynomials (namely, that the remainder when dividing f(x) by x - k is f(k)).

However, I didn't find any non-annoying ways to check whether f(x) is divisible by x - k if all the coefficients are already known...

→ Reply

8 years ago, # ^ |

You can calculate it modulo a couple of random numbers or primes. That will nearly always work.

I don't know if there is a nice way to do it without randomisation though.

→ Reply

nitegazer

8 years ago, # ^ |

To check if f(k) = 0, note that f(k) = a0 (mod k). So a0 must be a multiple of k or f(k) cannot equal 0. So you can add a0/k to a1. Call this a1'. But then the new a1' must be a multiple of k or f(k) cannot equal 0. So now you can add a1'/k to a2.. and so on.

→ Reply

8 years ago, # ^ |

Are you using floating point for this? Does that not give you issues with precision? Or alternatively, give you very large fractions?

→ Reply

Superty

8 years ago, # ^ |

If a_i is not a multiple of k, the algorithm terminates. You only divide a_i by k if a_i mod k is 0.

→ Reply

Goldsmith94

8 years ago, # ^ |

I don't know if it worked... but I just used python and did it in O(n) :D (python handles big integers)

→ Reply

-is-this-fft-

8 years ago, # ^ |

I'd love to see Python handling 10000¹⁰⁰⁰⁰⁰ in one second...

→ Reply

8 years ago, # ^ |

If he used Python2, the multiplication would have just overflowed, and he may have been lucky that it worked.

→ Reply

Whistle

8 years ago, # ^ |

Hodor :v :p

→ Reply

zlobber

8 years ago, # |

how to solve B?

→ Reply

8 years ago, # ^ |

← Rev. 4 →

Create 2D array for your glasses, put T * CONST (e.g. 2048) water in first one.

Iterate from top to bottom, layer by layer. For each glass substract all water that left (higher than your const), split it by 2 and add to two glasses on the bottom layer.

Count how many glasses have >= const water in it. O(N).

We use CONST to avoid of float computations. It should be power of 2, enough to fill all levels.

→ Reply

Obk

8 years ago, # ^ |

-7

Ээх, я не додумался, что через T * CONST можно все к int-ам свести.

→ Reply

8 years ago, # ^ |

I put 1024 water in the first one and used the similar approach that you told. Is there any problem with 1024? Since the first and last glasses of the last(10th) row will receive 1 unit.

→ Reply

8 years ago, # ^ |

It should be enough. But you should put T * 1024, not just 1024.

→ Reply

-emli-

8 years ago, # ^ |

← Rev. 2 →

I use double,is my solution wrong?

→ Reply

8 years ago, # ^ |

Well it depends how you implemented it. With double and division operation you could get wrong comparisons. With integers it will be always correct :)

→ Reply

sofrondr

8 years ago, # ^ |

For what I know, such dividing by 2 cannot cause precision problems with double (it behaves the same way as bit shift), so it was safe in this task. But its a bad habit for sure, I agree.

→ Reply

8 years ago, # ^ |

Ya I meant for each second I passed 1024 units on the first glass and then repeated the process for T time

→ Reply

8 years ago, # |

Hack testcase of E?

→ Reply

8 years ago, # ^ |

I think K=0.

→ Reply

8 years ago, # ^ |

i handled it still it got hacked

→ Reply

flashmt

8 years ago, # ^ |

There are still different cases when K = 0. Think about the case where all A_i = 0 but one is '?'

→ Reply

8 years ago, # ^ |

is there any case for K = 0 other than
* a[0] is already 0 "Yes"
* a[0] is nonzero but not '?' "No"
* a[0] is '?' and its human's turn "Yes"
* a[0] is '?' and its computer's turn "No"
?

→ Reply

flashmt

8 years ago, # ^ |

If all A_i are 0 then it should be "No"

→ Reply

8 years ago, # ^ |

the question says P(x) is divisible by Q(x) if there exists a representation P(x) = B(x)Q(x) . if all A[i]'s are 0 , then if we make B(x) also a polynomial with all coefficient's as 0 , then wouldn't P(x) be a multiple of Q(x) as well?

→ Reply

shas19

8 years ago, # ^ |

How did you handle overflow? with modulo of some prime?

→ Reply

8 years ago, # ^ |

i just took 4 prime modulos

→ Reply

Apptica

8 years ago, # ^ |

Share your approach for C. Your code is pretty simple ! @rajat1603

→ Reply

8 years ago, # ^ |

← Rev. 3 →

Take the Case when we want every element of the subarray to be equal to a . (For other case just change all a to b and b to a and run the same algorithm again).
Now consider a to be 0 and b to be 1.
We want to select the longest subarray with sum ≤ K .
So we take a right pointer and move it from 1 to N .
We also maintain a left pointer denoting the left endpoint of the longest subarray ending here. When sum exceeds K , we move the left pointer 1 step ahead.
So now we have longest subarray with sum ≤ K ending at every index.

→ Reply

Apptica

8 years ago, # ^ |

Thanks !

→ Reply

8 years ago, # ^ |

Any fixed prime modulus can be hacked.

→ Reply

8 years ago, # |

Huh! 10 seconds left, i submitted. The result on final page: Pending system testing DAMMMMMMMMMMMN. Now i don't know whether i should be happy or sad in case it passes after i submit later on :\

→ Reply

8 years ago, # ^ |

I think it will be counted if your submission is in queue before the contests ends

→ Reply

8 years ago, # ^ |

Now it isn't in my submissions too. Though i got redirected to some link with some token value at the end but probably there was a bit of lag b/w my submission and before server received it. :(

→ Reply

8 years ago, # |

Is there a nice way to solve E without randomization?

→ Reply

AGrigorii

8 years ago, # ^ |

Gorner's way)

→ Reply

8 years ago, # ^ |

Gorners?

→ Reply

Superty

8 years ago, # ^ |

Other than my reply to your other comment, one more option is to observe that if the absolute value of the partial sum becomes greater than some small value (roughly 10^4 / k-1 or 10^4*n if k is 1) then it's impossible for it to come back to zero. So you can just terminate if that happens, and otherwise proceed as normal, so you'll never get overflow.

→ Reply

DoubleNy

8 years ago, # |

It was a good contest with easy problem, but I could solve only A :D , i couldnt find the formula for B(i think it's something bounded with pascal's triangle ). How you solved B and C ?

→ Reply

c4cheats

8 years ago, # ^ |

That is what I thought, but I found to many exceptions in it. So I just simulated it.

→ Reply

8 years ago, # ^ |

It is easier to just use dynamic programming approach to solve it in O(N): http://codeforces.me/blog/entry/45031?#comment-295709

→ Reply

8 years ago, # |

I have three big critiques. Problem C was given before and I could hack it easily. But I didn't. Problem D is awful and easy to come up with a solution. Nobody likes such problems. Problem E is easy.

→ Reply

CodeForceps

8 years ago, # ^ |

Ok, so you know that problem C was given before, even though this 5 problems are the first that you solve in Codeforces? Suspicious...

→ Reply

8 years ago, # ^ |

Illuminati?

→ Reply

8 years ago, # ^ |

What I want to say is that the problem is a common use of 2-index technique, I don't mean it was on Codeforces. I don't solve Codeforces, I only solve hard problems and this contest was just to test my level.

→ Reply

rhezo

8 years ago, # |

I was trying to hack A and I wrote the exact same code of other contestant and tested it on custom invocation. It gave a wrong answer but I got unsuccessful hacking attempt. Anyone knows why?

→ Reply

rhezo

8 years ago, # ^ |

Sorry, my bad! Everything is ok!

→ Reply

8 years ago, # |

+12

I solved D and found contest just finished for a few seconds...

→ Reply

8 years ago, # ^ |

+15

→ Reply

8 years ago, # ^ |

I hope my solution has some bug so that I won't be so sad...

BTW, D is easy to come up with a solution but not easy to code it, I don't like such problems.

→ Reply

dantrag

8 years ago, # ^ |

-6

Well, if you are experienced enough, there's nothing to struggle with:

30 lines of switch-case to rotate a symbol clockwise 20 lines of creating edges to adjacent cells given a symbol 40 lines of bfs + misc to read/write

In total, not too much if you know what you are doing.

What I usually do — I just start coding, and quite often it appears that it is not so hard as I expected it to be :)

→ Reply

8 years ago, # ^ |

you are right, I'm not so experienced in program competition. When I write a solution having code above 100 lines, it often contain some bug(maybe stupid typing error like typing i for j ...), I need to do more coding. This is a nice platform :)

→ Reply

8 years ago, # ^ |

You should check some solutions out. E.g. mine uses only 1 line to do rotation and 5 lines to generate neighbors.

→ Reply

8 years ago, # ^ |

Mine failed, so yeah all cool now :P. 2 silly mistakes. I wrote somewhere 'V' and somewhere as 'v' and other i didn't checked that to go from a to b, a path from b->a and a->b must both exist.

→ Reply

8 years ago, # |

+19

Who the hell thought it would be a good idea to put problem D -_- like... What's the purpose of it??
with all due respect to authors

→ Reply

8 years ago, # ^ |

It's a good exercise in implementation.

→ Reply

8 years ago, # ^ |

Well, I kinda don't like it too. Easy algo (just BFS), but requires careful implementation of all cases.

→ Reply

trunghai95

8 years ago, # ^ |

Ways to optimize implementation
Carefulness

That's the purpose

→ Reply

svg_af

8 years ago, # ^ |

pretty ugly ruined my round because of a silly mistake :/

→ Reply

skavurskaa

8 years ago, # |

Anyone else got WA'd / TLE'd in D test case 10?

→ Reply

pavelost

8 years ago, # ^ |

I got WA too.

→ Reply

8 years ago, # ^ |

Well I did get it, but fixed later. I've used too much memory :)

→ Reply

skavurskaa

8 years ago, # ^ |

Did you use NxM matrix to store distance for each state in shortest path algorithm or NxMx4 matrix? I used both, with NxMx4 i got TLE and NxM got WA :(

→ Reply

8 years ago, # ^ |

← Rev. 3 →

In last submission I used NxMx4 matrix of int64 to store distances. Plus one matrix NxMx4 of int8 to store direction flags. Plus three queue's of int32 to queue positions. Around 50 Mb total.

I used simple BFS.

Just got it AC after systest, 1500ms and 50Mb.

→ Reply

skavurskaa

8 years ago, # ^ |

I guess the problem is that i used Dijkstra's then. Never thought about state graph being unweighted

→ Reply

mrgreen

8 years ago, # ^ |

I don't think the size of the array is the problem. I used 4 * N * M and it was fine.

→ Reply

HeartBreak

8 years ago, # |

← Rev. 5 →

sad...fst 2 problem..

→ Reply

RetiredAmrMahmoud

8 years ago, # |

-6

Why GlebsHP accepts rounds with such classic problems like those in today's C, D?. I thought the round will be cool because fcspartakm is the problem setter but found only one good problem. :D

→ Reply

GlebsHP

8 years ago, # ^ |

+159

Please, wake me up if the problems of Div. 1 contests will become easy and classic for you.

→ Reply

Omar_Mekkawy

8 years ago, # ^ |

+39

even for a div2 contestant, i spent 3/4 the contest time coding / debugging instead of thinking , i didn't enjoy this contest at all, the only good problem is the E and didn't have time to read it tho

→ Reply

8 years ago, # ^ |

Just read D and E and the same time. It often happens that one is harder on implementation and the other is harder on the idea.

→ Reply

RetiredAmrMahmoud

8 years ago, # ^ |

+21

I'm not saying they were easy or they should be hard. Just saying it'd be better if they were kinda unique.

→ Reply

dush1729

8 years ago, # |

Just when I saw C has more submissions than B, I knew something was fishy. And it turned out it was similar to Hard Process(ER 11) and Repair road. Problem B was also based on how good you are at google search(But I was unable to solve it :P).

→ Reply

oculto

8 years ago, # ^ |

I solved hard process today only :D

→ Reply

Joeization

8 years ago, # |

how to solve pC?
i choose odd ones to connect left even one and right even one.
scan odd ones from left to right
then choose even ones like odd ones
but stuck at pretest 12

→ Reply

naresh7406

8 years ago, # ^ |

If we divide the problem in two parts and return the max of both:

Maximum length of substring consisting of a's with at most k changes.
Maximum length of substring consisting of b's with at most k changes.

After that two pointer approach can be used to solve each subproblem.

→ Reply

dush1729

8 years ago, # ^ |

Fill consecutive gaps of A OR Fill consecutive gaps of B. Find maximum among both.

→ Reply

anta

8 years ago, # |

← Rev. 7 →

+43

In problem E, if you use fixed modulus then you can get hacked. For example, if you use 10⁹ + 7 and 10⁹ + 9 as modulus, write (10⁹ + 7) × (10⁹ + 9) = 1000000016000000063 in base-10000 number system so we get "4 10000\n63\n0\n160\n0\n100" as a hack case.

→ Reply

shas19

8 years ago, # ^ |

Now I came to know that my solution will fail in system test!

→ Reply

NibNalin

8 years ago, # |

Can someone debug this code for D?

My logic should be fine, but I get WA on #10(hate implementations) Logic is to BFS the graph with 4 states for each node(representing number of rotations).

Code

#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
using namespace std;

const int inf = 1707050917;

//UP = 0, RIGHT = 1, DOWN = 2, LEFT = 3.

int n, m;
int xx[4] = {-1, 0, 1, 0};
int yy[4] = {0, 1, 0, -1};

int opp[4] = {2, 3, 0, 1};

inline bool valid(int x, int y)
{
	return (x+1)&&(y+1)&&(x<n)&&(y<m);
}

inline int INTMOD(int a, int b)
{
	return ((a%b)+b)%b;
}

int main(void)
{
	int xt, yt, xm, ym;
	scanf("%d%d", &n, &m);
	vector<vector<vector<int>>> A(n, vector<vector<int>>(m, vector<int>(4)));
	vector<vector<vector<int>>> D(n, vector<vector<int>>(m, vector<int>(4, inf)));
	vector<string> S(n);
	for(int i = 0;i < n;i++)
	{
		cin >> S[i];
		for(int j = 0;j < m;j++)
		{
			if(S[i][j] == '+')
			{
				for(int k = 0;k < 4;k++) A[i][j][k] = 1;
			}
			else if(S[i][j] == '|')
			{
				A[i][j][0] = 1; A[i][j][2] = 1;
			}
			else if(S[i][j] == '-')
			{
				A[i][j][1] = 1; A[i][j][3] = 1;
			}
			else if(S[i][j] == '^')
			{
				A[i][j][0] = 1;
			}
			else if(S[i][j] == '>')
			{
				A[i][j][1] = 1;
			}
			else if(S[i][j] == 'V')
			{
				A[i][j][2] = 1;
			}
			else if(S[i][j] == '<')
			{
				A[i][j][3] = 1;
			}
			else if(S[i][j] == 'L')
			{
				for(int k = 0;k < 4;k++) A[i][j][k] = 1;
				A[i][j][3] = 0;
			}
			else if(S[i][j] == 'R')
			{
				for(int k = 0;k < 4;k++) A[i][j][k] = 1;
				A[i][j][1] = 0;
			}
			else if(S[i][j] == 'U')
			{
				for(int k = 0;k < 4;k++) A[i][j][k] = 1;
				A[i][j][0] = 0;
			}
			else if(S[i][j] == 'D')
			{
				for(int k = 0;k < 4;k++) A[i][j][k] = 1;
				A[i][j][2] = 0;
			}
		}
	}

	/*for(auto it: A)
	{
		for(auto gt: it)
		{
			for(auto kt: gt) cout << kt << " ";
			cout << "n";
		}
		cout << "n";
	}*/

	scanf("%d%d%d%d", &xt, &yt, &xm, &ym);
	xt--; yt--; xm--; ym--;
	queue<vector<int>> Q;
	D[xt][yt][0] = 0;
	Q.push({0, xt, yt, 0});
	//dist, x, y, dir

	while(!Q.empty())
	{
		vector<int> top = Q.front();
		/*cout << "top ";
		for(auto it: top) cout << it << " ";
		cout << "n";*/
		Q.pop();
		int x = top[1], y = top[2], d = top[0], rot = top[3]%4;

		if(D[x][y][(rot+1)%4] == inf)
		{
			D[x][y][(rot+1)%4] = d+1;
			Q.push({d+1, x, y, (rot+1)%4});
		}

		for(int ai = 0;ai < 4;ai++)
		{
			if(valid(x+xx[ai], y+yy[ai]))
			{
				//cout << x << " " << y << " " << x+xx[ai] << " " << y+yy[ai] << " " << ai << " " << rot << "n";
				if(A[x][y][INTMOD(ai-rot, 4)] && A[x+xx[ai]][y+yy[ai]][opp[INTMOD(ai-rot, 4)]])
				{
					//cout << x << " " << y << " " << x+xx[ai] << " " << y+yy[ai] << " " << ai << " " << rot << "n";
					if(D[x+xx[ai]][y+yy[ai]][rot] == inf)
					{
						D[x+xx[ai]][y+yy[ai]][rot] = d+1;
						Q.push({d+1, x+xx[ai], y+yy[ai], rot%4});
					}
				}
			}
		}
	}

	int res = inf;
	for(auto it: D[xm][ym]) res = min(res, it);

	if(res < inf) printf("%dn", res);
	else printf("-1n");
}

I know, the implementation is pretty messed up, but I did comment a little bit if that helps

→ Reply

Knight_of_Thirteen

8 years ago, # |

18085379 Why do I get WA? Anyone care to help me???

→ Reply

latvian

8 years ago, # ^ |

Your recursive Fill function does not exit early enough, it continues "pouring" water past the n-th level. Change if (i>9 || j>i) return; to if (i>=n || j>i) return; . Then it passes all tests: 18093994

→ Reply

Navara

8 years ago, # |

Can you see the standing without the starred people from div 1?

→ Reply

dush1729

8 years ago, # ^ |

Just untick show unofficial located on top — right corner of standings page. :)

→ Reply

fcspartakm

8 years ago, # |

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

→ Reply

baobab

8 years ago, # |

-11

About D: You know what "X" and "Y" usually mean on a 2D grid? You have some idea, right? I can not imagine why the problem statement for D was written with the exact OPPOSITE meaning for those letters. Got WA for this, upsolved after swapping X and Y when reading input. Is Codeforces supposed to be a reading competition?

→ Reply

dantrag

8 years ago, # ^ |

I agree, a painful mistake. For me it has always been misleading — we store 2D maps and grids as arrays of rows, so if you want to access column X and row Y, you should call Array[Y][X] <-- counterintuitive, isn't it?

What works for me: just change your perception and think of X as of the first coordinate and of Y as of the second one — then array item access becomes logical — and meets the problem author's expectations.

→ Reply

the_art_of_war

8 years ago, # ^ |

+15

In my memory in the majority of tasks which has x,y in GRID in statement it is alwasy that X — row, Y — column.

→ Reply

8 years ago, # ^ |

My memory is the opposite.

→ Reply

NibNalin

8 years ago, # |

-15

When this happens

→ Reply

Te4NIK

8 years ago, # ^ |

when I see such large pictures, I shit bricks...

→ Reply

8 years ago, # ^ |

You guess that you can change your 'V' into 'v'.I have made a same mistake.

→ Reply

NibNalin

8 years ago, # ^ |

Holy fuck you're right. I have never been so stupid in my life. :/

→ Reply

dantrag

8 years ago, # |

+10

Thanks a lot guys for your efforts and splendid problems :) AGrigorii, an awesome start! — looking forward to see your next rounds in future.

→ Reply

xen

8 years ago, # |

Problem C is a bit more sophisticated version of 645C - Enduring Exodus. Same idea, but instead of finding the minimum, you ought to find two maxima and compare them. There is also a possibility of k being 0 in today's one (many solutions got hacked/WA'd because of that).

→ Reply

renadeen

8 years ago, # ^ |

It's exactly the same as C from EDU11 that happened less than two months ago.

→ Reply

Branimir

8 years ago, # |

Why there are no precision errors for problem B with solutions based on double data type?

For example in my room, 18074368 solution.

Sorry for my poor English.

→ Reply

ChrisWu

8 years ago, # ^ |

All the numbers are dyadic rationals, which can be represented exactly by doubles.

→ Reply

Branimir

8 years ago, # ^ |

I suspected that, thanks for confirming.

→ Reply

8 years ago, # |

Wow, next contest is also Div.2 Only. And it's only after a whole week.

→ Reply

8 years ago, # ^ |

I find no reason for a Div 2 only round. It simply encourages more fake accounts.

→ Reply

8 years ago, # ^ |

Here's a reason: It takes more time to prepare a Div 1 round.

→ Reply

otaviocv

8 years ago, # |

+13

When the ratings are calculated?

→ Reply

8 years ago, # ^ |

+34

Your question is NP-hard

→ Reply

antracod

8 years ago, # |

I participated to this contest , but when i go to my profile, my rating is still 0 and the contest it's not showing in the contests tab on my profile. Please help !

→ Reply

hell_hacker

8 years ago, # ^ |

Wait for some time. The ratings are not yet updated.

→ Reply