Этот раунд рейтинговый? Просто в тексте не было информации об этом!

I practice for typing when I am grade 6. Who bless my childhood? please!

G0D_FaTHER what were we doing when we were in 6th class ? I remember spending time in school ground!

some of this students are red on codeforces. for example voidmax he is 9 grade btw (he was red)

Man ,I didn't have PC when I was in the sixth grade :(

I started learning programming at 5th grade because our "modern" PC died and qBasic was about the best "game" I managed to find for the older one xD

LOL
this isn't the blog of the round #400

The contest time is bounded by the time of onsite competition. It should start after the onsite competition has started and finish before it has finished. I'm sorry, but there is no way we can change the competition time.

The round is not for Muslims.

Email says 5.

Then do not pray.

Why aren't you in the same situation as the others?

I wanna take a moment of silence to thank god who created me an atheist so i can peacefully take part in today's round :D

Why canada?

Please, keep in mind that Codeforces always tries to vary competitions time to give more people an opportunity to participate in at least some of the contests.

But when most of competitions carry out in night time for east regions, it's ok for you and you don't have any problems. Think about others sometimes.

Hey!!!

Only one problemset :D

Before writing such comments, pls read the previous comments about it! There are only 39+1 comments till now.

P.S sorry for my poor English :)

Yes this round will be rated....

Come from back and do this : string s = v[i]; while(s > v[i+1])s.pop_back(); v[i] = s; I don't know whether this will pass sys tests

Iterate from (n-1)th string to 1st string, go on comparing with next string and trim this string till it is not greater than the next one.

If RoyalWyvern above is correct I agree. Had only 13 minutes left after A, B and C. Normally I quit, but I thought what the heck... Past pretests on D... |-)

Make a set of a,b,h using set < pair<ll,pair<ll,ll> > >
where first element of pair is b and second is pair(a,h)
then sort the set.
Then apply dp a[next_i] < b[i]

check for the maximum possible height.

Sort by B values. Then dp[i]=dp[next[i]]+height[i] where next[i] is the nearest ring to the i'th ring such that a[next[i]]<b[i]. Incase no such next[i] exists then dp[i]=height[i].

Then the answer is the maximum of dp[i] where i varies from 1 to n.

not needed ... keep the last string as it is... then greedily check the max prefix you can keep from bottom to top

Same with me.

First test may be different from the first example.

It may be because the way you outputed the strings. Initially i was changing all the characters that shouldn't be outputed to '\0' and it didn't work,but the next time I just printed the characters I had to and ignored the others(and passed the pretests)

I disagree. For me it was Div 1.89 =)

After sync_with_stdio(false), you cannot mix cout and stdout. Calling fflush(stdout) might be the problem

EDIT: Nevermind, it seems to be another problem

Cannot agree more. Even E is easier than C

I used segment trees with range max query and it passed pretests.

For each row i calculate min row that can be reached, call it mni. Then if mnr <= l then answer is yes else no.

p[i] — the first index where an increasing sequence begins, which comes to the i (this sequence can go on). Then check

if (p[r] <= l) answer is Yes;

You can store in the array the ranges with the maximum size, that contain sorted column.

int range[100100]; // range[left] gives right side of the range: int right = range[left]

...

while (k--)
{
  int l, r;
  cin >> l >> r;

  bool inside = range[l] >= r;

  cout << (inside ? "Yes" : "No") << '\n';
}

I solved it by just traversing the 2d array
and maintaining a index of minimum and maximum element
http://mirror.codeforces.com/contest/777/submission/24969962

You can use Dynamic Programming. You have dp[i][j]-the longest non-decreasing subsegment(continous subarray) of the j-th column that ends in the i-th line.To get it,you simply look in dp[i-1][j] and check if a[i-1][j]<=a[i][j]. If it's true,dp[i][j]=dp[i-1][j]+1,else dp[i][j]=1. Also,you need best[i]=the maximum of dp[i][k] with k in range 1..m At each query,you check if best[r]>=r-l+1 and print the answer depeding on the condition.

store in one dimension array

3 cases: 1) n==1 YES for all requests 2) m<=1000 you can over 1000 colomns all one in O(1) * 100 000=k so it take O(10^8) 3)m>1000 ,so n<= 100 so I just build table answer[100][100] for all possilble l and r

http://mirror.codeforces.com/contest/777/submission/24975294

If you haven't made any submissions, your rating will not change.

Your rating wont be effected if you dont submit anything.

Unless you have at least one submission you are not taken into consideration for rating changes.

Can you please highlight an instance ?

sorting by bi > bj, ai < aj not ai > aj

Write generator.

ha ha... 5 codes and 4 different templates :p They could've atleast used the same template.

It's not server's fault. You have UB somewhere.

You are blue, but u talk like a complete newbie. By now, you should know that compiler versions differ on different Online platforms, and thus produce different outputs.

Don't u feel like taking a second off and thinking about what may have gone wrong before blaming the CF server and taging all admins ?

This is sheer stupidity, and complete newbie attitude. How many times have we seen this same query from multiple multiple people ?

You used the memory returned by malloc without initializing it, which may behave differently by environments.

Really? How? I used segment tree + heap, but I'm pretty sure BIT can be used instead of segment tree.