mahmoud_arafa's blog

Round 354 — Div. 2 — Problem B. Pyramid of Glasses
By mahmoud_arafa, history, 10 years ago, In English

Hi, I hope this blog entry finds you well and you are doing fine,

I was wondering if somebody can share with us a simple tutorial for the problem above. There doesn't exist a tutorial for this round.

  • Vote: I like it
  • +2
  • Vote: I do not like it

Comments Comments (4)
| Write comment?
»
10 years ago, hide # |
 
Vote: I like it +5 Vote: I do not like it

Click

→ Reply
»
10 years ago, hide # |
 
Vote: I like it +5 Vote: I do not like it

Since the number of glasses <=10 , this turns out to be a simple simulation problem. Let G[i][j] be the the champagne in jth glass of ith row,when we have processed 1->i-1 rows(note that this quantity may be greater than 1 as we have still not considered the overflow). Now you can see that the overflowing wine can fall into 2 glasses G[i+1][j] and G[i+1][j+1] . Thus the simulation can be performed using a 2-D array. You can see my solution for implementation details.

http://mirror.codeforces.com/contest/676/submission/18157256

→ Reply
  • »
    »
    10 years ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    While reading, I just caught this: "Since the number of glasses <=10 , this turns out to be a simple simulation problem".

    So if N is pretty large, can't we use this simulation method?

    → Reply
    • »
      »
      »
      10 years ago, hide # ^ |
       
      Vote: I like it 0 Vote: I do not like it

      well the simulation method takes a minimum of O(N*(N+1)/2) which is actually a good time if N doesn't exceed 4*10^4 approximately so No a simulation won't be preferred in the kind of a N=10^5 situation

      → Reply