Distributing Candies

문제

Aunty Khong is preparing $nn$ boxes of candies for students from a nearby school. The boxes are numbered from $00$ to $n-1n\; -\; 1$ and are initially empty. Box $ii$ ($0\le i\le n-10\; \backslash le\; i\; \backslash le\; n\; -\; 1$) has a capacity of $c[i]c[i]$ candies.

Aunty Khong spends $qq$ days preparing the boxes. On day $jj$ ($0\le j\le q-10\; \backslash le\; j\; \backslash le\; q\; -\; 1$), she performs an action specified by three integers $l[j]l[j]$, $r[j]r[j]$ and $v[j]v[j]$ where $0\le l[j]\le r[j]\le n-10\; \backslash le\; l[j]\; \backslash le\; r[j]\; \backslash le\; n\; -\; 1$ and $v[j]\mathrm{\ne }0v[j]\; \backslash ne\; 0$. For each box $kk$ satisfying $l[j]\le k\le r[j]l[j]\; \backslash le\; k\; \backslash le\; r[j]$:

• If $v[j]>0v[j]\; >\; 0$, Aunty Khong adds candies to box $kk$, one by one, until she has added exactly $v[j]v[j]$ candies or the box becomes full. In other words, if the box had $pp$ candies before the action, it will have $\min (c[k],p+v[j])\backslash min\{(c[k],\; p\; +\; v[j])\}$ candies after the action.
• If , Aunty Khong removes candies from box $kk$, one by one, until she has removed exactly $-v[j]-v[j]$ candies or the box becomes empty. In other words, if the box had $pp$ candies before the action, it will have $\max (0,p+v[j])\backslash max\{(0,\; p\; +\; v[j])\}$ candies after the action.

Your task is to determine the number of candies in each box after the $qq$ days.