Saving Ms. W SOLUTIONS
Ms. W has been snatched by A Sloth Monster. Presently, as her beau, its the obligation of Mr. S to spare her.
To vanquish The Slothy Monster, and spare Ms. W from turning into a sloth animal, he needs to reach at the specific degree of battling aptitude.
As of now, he is at the X’th level and he needs to arrive at the Y’th level of battling expertise.
There are distinctive progress strategy accessible.
On the off chance that you pick i’th progress strategy it will take you from Ai level to Bi level with the expense of Zi measure of stamina(Reverse is likewise evident).
Also, in the event that he is at ability level I, he can eat a specific Devil Fruit explicit to that level which will make him rest for Hi hours and after that make his endurance equivalent to Ci.
(Note the endurance level changes to Ci, not added to the current endurance level).
Despite the fact that, it’s his decision to eat the Fruit or not. He can decide not to eat the products of the soil with the current endurance level.
Note that there can be distinctive approach starting with one ability level then onto the next aptitude level with various or same expense of rest.
Presently Mr. S need your assistance to discover least time he needs to rest to arrive at a definitive expertise level and spare his sweetheart.
On the off chance that it is extremely unlikely to spare her, print – 1.
Beginning endurance level is 0.
Info FORMAT :
The principal line contains N(Number of expertise levels) , M(Number of fesible changes) , A(Initial ability level) , B(Ultimate aptitude level).
Next M lines contains 3 whole number X , Y , Z each , appearing from Xth structure he can change in Yth structure and the require endurance Z.
Next N lines contains 2 number each , Ci, Hi, that implies , at ith structure , he can Change his endurance level to Ci with the expense of Hi measure of rest.
Yield FORMAT :
Single Line Cointaing Minimum time he have to squander on rest to change structure Initial level to the Ultimate level.
1 <= N <= 1000
0 <= M <= 1000
1 <= Inital_Form , Ultimate_Form <= N
1 <= Xi , Yi <= N
1 <= Zi <= 10^9
1 <= Ci, Hi <= 10^9
3 1 3
3 2 1
First he will eat the villain natural product at level 1 and rest for 7 hours and get endurance of 2.
At that point will trasnform to level 2, with cost of 2 endurance.
Once more, he will eat the demon natural product at level 2 and rest for 7 hours and get endurance of 2.
At that point, will arrive at level 3 with cost of 1 endurance.
All out = 7 + 7 = 14 hours of rest.
March Long Challenge 2021 Solutions
- An Interesting Sequence ISS SOLUTION
- Tree House THOUSES SOLUTION
- Valid Paths VPATH SOLUTION
- Modular Equation MODEQ SOLUTION
- Tic Tac Toe TCTCTOE SOLUTION
- Xor Equality XOREQUAL SOLUTION
- Golf LKDNGOLF SOLUTION
- Solubility SOLBLTY SOLUTION
April Long Challenge 2021 Solutions
- Chef and Dice SDICE Solution
- Worthy Matrix KAVGMAT Solution
- Binary String MEX MEXSTR Solution
- Boolean Game BOOLGAME Solution
- Tree Permutations TREEPERM Solution
- Destroy the EMP Chip CHAOSEMP Solution
- Chef and Pair Flips PAIRFLIP Solution
- String Power STRPOW Solution
- Brahma and Shiva SHRINES Solution
- Water Sort Puzzle (Challenge) WTRSORT Solution
- World Record BOLT Solution
- Strong Language SSCRIPT Solution
- Valid Pair SOCKS1 Solution
Codechef Long Challenge Solutions
February Long Challenge 2021
January Long Challenge 2021
- Chef and Division 3 DIVTHREE SOLUTION Code Chef
- Encoded String DECODEIT SOLUTION Code Chef
- Point Of Impact BILLRD SOLUTION Code Chef
- Fair Elections FAIRELCT SOLUTION Code Chef
- Watching CPL WIPL SOLUTION Code Chef
- Chef and Ants ANTSCHEF SOLUTION Code Chef
- Blackjack BLKJK SOLUTION Code Chef
- And-Or Game ORAND SOLUTION Code Chef
- Stack-Queue Sort (Challenge) SQSORT SOLUTION Code Chef
- Expected Number of SCCs RCTEXSCC SOLUTION Code Chef
- Curious Matrix CURMAT SOLUTION Code Chef
- Cool Subsets COOLSBST SOLUTION Code Chef
- Sequence Creation ARCRT SOLUTION Code Chef
- Greedy Students GRDSTD SOLUTION Code Chef
November Challenge 2020 SOLUTION CodeChef
- Ada and Dishes SOLUTION ADADISH
- Iron Magnet and Wall SOLUTION FEMA2
- Magical Candy Store SOLUTION CNDYGAME
- Unusual Queries SOLUTION UNSQUERS
- Red-Black Boolean Expression SOLUTION RB2CNF
- Chef and the Combination Lock SOLUTION CHEFSSM
- Scalar Product Tree SOLUTION SCALSUM
- Connect on a Grid (Challenge) SOLUTION CONGRID
October Lunchtime 2020 CodeChef SOLUTIONS
- AND Plus OR SOLUTION ANDOR
- Chef and Subtree MEXs SOLUTION SUBMEXS
- Chef Likes Good Sequences SOLUTION GSUB
- Cute Chef Gift SOLUTION COPAR
- Chef Is Just Throwing Random Words SOLUTION SSO
- Counting Spaghetti SOLUTION CDSUMS
- Chef and Edge Flipping SOLUTION EFLIP
- Top Best Keylogger in Python 3 Make One
- What is Hacking?
- Secrets of the Deep Dark Web
- CODECHEF September Lunchtime 2020 SOLUTIONS
- August Lunchtime 2020 SOLUTIONS
- A. Shandom Ruffle SOLUTION
- B. Pear TreaP SOLUTION
- C. Sneetches and Speeches 3 SOLUTION
- D. The Grim Treaper SOLUTION
- Y. Sneetches and Speeches 1 SOLUTION
- Z. Trick or Treap SOLUTION
- A. Floor Number SOLUTION CODE FORCES
- B. Symmetric Matrix SOLUTION CODE FORCES
- C. Increase and Copy SOLUTION CODE FORCES
- D. Non-zero Segments SOLUTION CODE FORCES
- E. Rock, Paper, Scissors SOLUTION CODE FORCES
- F. Number of Subsequences SOLUTION CODE FORCES
- Chef and Easy Queries SOLUTIONS CHEFEZQ
- Covid Run SOLUTIONS CVDRUN OCTOBER CHALLENGE
- Positive AND SOLUTIONS POSAND
- Replace for X SOLUTIONS REPLESX
- Village Road Network SOLUTIONS VILLNET
- Random Knapsack SOLUTIONS RANDKNAP
- D-Dimensional MST SOLUTIONS DDIMMST
- Compress all Subsegments SOLUTIONS SEGCOMPR
- Adding Squares SOLUTIONS ADDSQURE
- Inversions SOLUTIONS INVSMOD2 OCOTBER CHALLENGE
- Rooted Minimum Spanning Tree SOLUTIONS ROOTMST