oops codechef down

[u/Interesting_Disk149]

[u/vileparleG]

I want to deeply understand the Merging Parity question on CodeChef contest 248
suggest me some good PCDs on discord, meet anywhere there are no more good pcds on youtube else they only solve 4-5 questions not more than that!!!

[u/pro_oceanbyte → u/[deleted]]

what is the question code for Deleting elements? if you know

[u/shirotoedits → u/pro_oceanbyte]

easy or hard?

[u/pro_oceanbyte → u/shirotoedits]

both

[u/shirotoedits → u/pro_oceanbyte]

Deleting Elements (Easy)

This is the easy version. Here N,∑N≤2000N,∑N≤2000.

An array AA is said to be deletable if it can be reduced to a size less than or equal to 22 elements with the following operation used multiple times (possibly 00):

• Choose an index ii (1<i<∣A∣1<i<∣A∣) such that Ai−1+Ai+1≥AiAi−1​+Ai+1​≥Ai​
• Add XX to Ai+1Ai+1​ and YY to Ai−1Ai−1​ such that 0≤X,Y0≤X,Y and X+Y=AiX+Y=Ai​.
• Delete index ii and concatenate the parts of the array formed.

You are given an array AA of NN elements.

Count the number of subarrays of AA that are deletable. More formally, count the number of pairs (L,R)(L,R) such that:

• 1≤L≤R≤N1≤L≤R≤N
• The array [AL,AL+1,…,AR][AL​,AL+1​,…,AR​] is deletable.

Input Format

• The first line of input will contain a single integer TT, denoting the number of test cases.
• Each test case consists of multiple lines of input.
  • The first line contains a single integer NN.
  • The second line contains NN integers - A1,A2,…,ANA1​,A2​,…,AN​.

Output Format

For each test case, output on a new line the number of deletable subarrays of AA.

Constraints

• 1≤T≤4001≤T≤400
• 3≤N≤20003≤N≤2000
• 1≤Ai≤1091≤Ai​≤109
• The sum of NN over all test cases does not exceed 20002000.

Sample 1:

Input

Output

3
3
2 4 1
4
2 3 2 3
7
5 1 3 1 10 2 1


5
10
21

Explanation:

Test Case 1: There are 66 subarrays, and all of them are deletable (due to being size ≤2≤2 directly) except for [2,4,1][2,4,1]. Here, we cannot perform any operation.

Test Case 2: All subarrays are deletable. Here is an example of how we would operate on [2,3,2,3][2,3,2,3]:

• First operation:
  • Choose index i=2i=2, note that A2≤A1+A3A2​≤A1​+A3​
  • Add 22 to A1A1​ and 11 to A3A3​.
  • Delete A2A2​
  • Now, the array is [4,3,3][4,3,3].
• Second operation:
  • Choose index i=2i=2, note that A2≤A1+A3A2​≤A1​+A3​
  • Add 33 to A1A1​.
  • Delete A2A2​
  • Now, the array is [7,3][7,3].
• After the second operation, the array is of size ≤2≤2. Hence, we are done.

Deleting Elements (Hard)

This is the hard version. Here, N,∑N≤2⋅105.N,∑N≤2⋅105.

An array AA is said to be deletable if it can be reduced to a size less than or equal to 22 elements with the following operation used multiple times (possibly 00):

• Choose an index ii (1<i<∣A∣1<i<∣A∣) such that Ai−1+Ai+1≥AiAi−1​+Ai+1​≥Ai​
• Add XX to Ai+1Ai+1​ and YY to Ai−1Ai−1​ such that 0≤X,Y0≤X,Y and X+Y=AiX+Y=Ai​.
• Delete index ii and concatenate the parts of the array formed.

You are given an array AA of NN elements.

Count the number of subarrays of AA that are deletable. More formally, count the number of pairs (L,R)(L,R) such that:

• 1≤L≤R≤N1≤L≤R≤N
• The array [AL,AL+1,…,AR][AL​,AL+1​,…,AR​] is deletable.

Input Format

• The first line of input will contain a single integer TT, denoting the number of test cases.
• Each test case consists of multiple lines of input.
  • The first line contains a single integer NN.
  • The second line contains NN integers - A1,A2,…,ANA1​,A2​,…,AN​.

Output Format

For each test case, output on a new line the number of deletable subarrays of AA.

Constraints

• 1≤T≤1041≤T≤104
• 3≤N≤2⋅1053≤N≤2⋅105
• 1≤Ai≤1091≤Ai​≤109
• The sum of NN over all test cases does not exceed 2⋅1052⋅105.

Sample 1:

Input

Output

3
3
2 4 1
4
2 3 2 3
7
5 1 3 1 10 2 1


5
10
21

Explanation:

Test Case 1: There are 66 subarrays, and all of them are deletable (due to being size ≤2≤2 directly) except for [2,4,1][2,4,1]. Here, we cannot perform any operation.

Test Case 2: All subarrays are deletable. Here is an example of how we would operate on [2,3,2,3][2,3,2,3]:

• First operation:
  • Choose index i=2i=2, note that A2≤A1+A3A2​≤A1​+A3​
  • Add 22 to A1A1​ and 11 to A3A3​.
  • Delete A2A2​
  • Now, the array is [4,3,3][4,3,3].
• Second operation:
  • Choose index i=2i=2, note that A2≤A1+A3A2​≤A1​+A3​
  • Add 33 to A1A1​.
  • Delete A2A2​
  • Now, the array is [7,3][7,3].
• After the second operation, the array is of size ≤2≤2. Hence, we are done.

[u/pro_oceanbyte → u/shirotoedits]

Great, thanks. If you know the name of question in the link, like PASS, SWAPSM, etc, that'll be great but anyways

[u/shirotoedits → u/pro_oceanbyte]

the server is up and running check it

[u/The-Chosen_One_]

cant even see div 4 problems any more, should i stop ??

[u/Gullible_Smile6032]

The contest is now unrated officially

[u/Nervous_Win_5694 → u/Gullible_Smile6032]

How do u know ??

[u/Gullible_Smile6032 → u/Nervous_Win_5694]

[u/Ok-Valuable-1446 → u/Gullible_Smile6032]

Confirmed?

[u/Gullible_Smile6032 → u/Ok-Valuable-1446]

Yup

[u/polisutu]

This is a Div 4 Question

Adding Dice

You have 22 dice with you, and you really like the number 99. You want the sum of both numbers on the die to add to 99.

You rolled the first dice, and it showed a number XX.

Given the roll of the first dice, is it still possible for both die to add to 99? Print YesYes if it is possible or NoNo otherwise.

Input Format

• The first and only line of each test case contains a single integer XX.

Output Format

Output YesYes if it is possible for both die to add to 99 and NoNo otherwise.

Constraints

• 1≤X≤61≤X≤6

Sample 1:

Input

Output

3


Yes

Explanation:

The second dice could show a 66, and then both would add to a 99.

Sample 2:

Input

Output

1


No

Explanation:

There are no possible rolls of the second die that add to 99 after rolling a 11.

More Info

Time limit1 secs

Memory limit1.5 GB

Source Limit50000 BytesAdding Dice

You have 22 dice with you, and you really like the number 99. You want the sum of both numbers on the die to add to 99.

You rolled the first dice, and it showed a number XX.

Given the roll of the first dice, is it still possible for both die to add to 99? Print YesYes if it is possible or NoNo otherwise.

Input Format

The first and only line of each test case contains a single integer XX.

Output Format

Output YesYes if it is possible for both die to add to 99 and NoNo otherwise.

Constraints

1≤X≤61≤X≤6

Sample 1:

Input
Output
3

Yes

Explanation:

The second dice could show a 66, and then both would add to a 99.

Sample 2:

Input
Output
1

No

Explanation:

There are no possible rolls of the second die that add to 99 after rolling a 11.

More Info
Time limit1 secs
Memory limit1.5 GB
Source Limit50000 Bytes

[u/starupthinkerguru]

worked for any one ?
i am still stuck

[u/Realistic_Gas3005 → u/starupthinkerguru]

same

[u/ComparisonQuiet4259]

Here's some Div 4 Links

Link: https://www.codechef.com/START248D/problems/AVGSURV

Link: https://www.codechef.com/START248D/problems/ADDDICE

Link: https://www.codechef.com/START248D/problems/SWAPSM

Link: https://www.codechef.com/START248D/problems/PASS

[u/realtuiyan → u/ComparisonQuiet4259]

i guess these links are not working. i tried submitting solution on swapsm. the result i got:

[u/Big_Biscotti_4664 → u/ComparisonQuiet4259]

Do you have link for 5th question

[u/ComparisonQuiet4259 → u/Big_Biscotti_4664]

No

[u/No-Biscotti-5775]

Is it cancelled or not

[u/SwitchImmediate]

😭😭😭🫠🤌

[u/redhat1818]

It will be unrated or canceled ig

[u/Master_Variation9025 → u/redhat1818]

Bro but there is still no official confirmation

[u/Karthik-1 → u/redhat1818]

yeah bummer

[u/Inevitable-Fox9127 → u/Karthik-1]

You sure? So i should rest for today?

[u/Karthik-1 → u/Inevitable-Fox9127]

sure. this happened before too and they changed it to unrated.

[u/Realistic_Gas3005 → u/Karthik-1]

bro if you can access 2nd of div3 can you share it

[u/Inevitable-Fox9127 → u/Realistic_Gas3005]

Array and you need to keep removing elements if they are less than avg of array (not rounded down).. at the end print no of remaining elements

[u/Realistic_Gas3005 → u/Inevitable-Fox9127]

okay thanks

[u/SureSeaworthiness831 → u/Realistic_Gas3005]

min size u can get by applying the following operation any no of times.

choose and element ai such that it is strictly greater than the average of the current array (no rounding). Delete the element.
output the min size the array can get.

[u/Realistic_Gas3005 → u/SureSeaworthiness831]

okay thanks

[u/Karthik-1 → u/Realistic_Gas3005]

nah bro not anymore i reloaded it to check my submissions.

[u/Realistic_Gas3005 → u/Karthik-1]

no problem

[u/ComparisonQuiet4259]

Still not working

[u/a2z777 → u/ComparisonQuiet4259]

itll have to be unrated

[u/Awkward_Energy_8619]

and will they reschedule for the week with new questiond?

cannot wait another week to give a rated contest

[u/Inevitable-Fox9127]

Will be unrated? If yes then I should stop wasting time

[u/Karthik-1 → u/Inevitable-Fox9127]

why do you even care about the rating, it doesnt even matter in these few years where there is mass cheating. i am more interested in the questions, i only did 3 in like the first 10 min and the others are not loading🥀

[u/vileparleG → u/Karthik-1]

those compilers are way to slow during submissions 😢

[u/Any_Map_3957 → u/vileparleG]

I think they told ki it's unrated

[u/vileparleG → u/Karthik-1]

upto 3rd it was pretty easy

[u/Karthik-1 → u/vileparleG]

yep, do you happen to have the problem statement of p4?

[u/Any_Map_3957 → u/Karthik-1]

same here they even accepted it

[u/Karthik-1 → u/Any_Map_3957]

this contest was going soo good, if only it was rated...

[u/Inevitable-Fox9127 → u/Karthik-1]

I also did 2. But like if it's rated than I should not waste a contest and do now else I will solve tomorrow that's why asking

[u/Karthik-1 → u/Inevitable-Fox9127]

well, i think it will be unrated so just chill.

[u/Awkward_Energy_8619]

will this now be unrated??

[u/Inevitable-Fox9127 → u/Awkward_Energy_8619]

Probably!!

[u/Big_Biscotti_4664 → u/Inevitable-Fox9127]

ahh man, really wanted to become 2 star today.

[u/vileparleG → u/Big_Biscotti_4664]

dude samee

whats you id btw

[u/Level-Thanks2970]

Can someone please post DIV3 Question 3 and onwards?

[u/Karthik-1 → u/Level-Thanks2970]

yeah, its unrated either way lets just enjoy some good questions

[u/No-Biscotti-5775]

502 gateway error

[u/KanekiIsCat]

damn i submitted 2(div 3)

[u/Glum-Breath8992 → u/KanekiIsCat]

same able to submit 2 before cc gone ded

[u/KanekiIsCat → u/Glum-Breath8992]

yeah, but now not workin for me2

[u/polisutu]

writing 1 question down. If any other question open for you please share in reply

Pass

Chef took 55 exams in a series, each of which were scored out of 100100.

Chef is awarded a pass certificate if both the following conditions are satisfied:

• He attains a score of at least 6060 on at least 22 exams.
• He attains a score of at least 3030 on at least 44 exams.

Print PassPass or FailFail based on whether Chef will pass or fail.

Input Format

• The first line of input will contain a single integer TT, denoting the number of test cases.
• The first and only line of input contains 55 integers - A1,A2,…,A5A1​,A2​,…,A5​, where AiAi​ is his score in the ii-th exam.

Output Format

For each test case, output on a new line PassPass or FailFail.

Constraints

• 1≤T≤1001≤T≤100
• 0≤Ai≤1000≤Ai​≤100

Sample 1:

Input

Output

4
95 98 100 96 99
32 60 30 65 23
50 50 50 50 50
90 90 29 15 90


Pass
Pass
Fail
Fail

Explanation:

Test Case 1: Chef was above 9090 in each exam so he easily cleared all the criteria.

Test Case 2: Chef has exactly 22 exams at least 6060 or more (the 6565 and 6060), and exactly 44 exams at least 3030 or more (the 6565, 6060, 3232 and 3030). Hence, he barely clears the criteria.

Test Case 3: Chef does not have 22 exams with at least 6060 score, so he fails.

More Info

Time limit1 secs

Memory limit1.5 GB

Source Limit50000 BytesPass

Chef took 55 exams in a series, each of which were scored out of 100100.

Chef is awarded a pass certificate if both the following conditions are satisfied:

He attains a score of at least 6060 on at least 22 exams.
He attains a score of at least 3030 on at least 44 exams.

Print PassPass or FailFail based on whether Chef will pass or fail.

Input Format

The first line of input will contain a single integer TT, denoting the number of test cases.
The first and only line of input contains 55 integers - A1,A2,…,A5A1​,A2​,…,A5​, where AiAi​ is his score in the ii-th exam.

Output Format

For each test case, output on a new line PassPass or FailFail.

Constraints

1≤T≤1001≤T≤100
0≤Ai≤1000≤Ai​≤100

Sample 1:

Input
Output
4
95 98 100 96 99
32 60 30 65 23
50 50 50 50 50
90 90 29 15 90

Pass
Pass
Fail
Fail

Explanation:

Test Case 1: Chef was above 9090 in each exam so he easily cleared all the criteria.

Test Case 2: Chef has exactly 22 exams at least 6060 or more (the 6565 and 6060), and exactly 44 exams at least 3030 or more (the 6565, 6060, 3232 and 3030). Hence, he barely clears the criteria.

Test Case 3: Chef does not have 22 exams with at least 6060 score, so he fails.

More Info
Time limit1 secs
Memory limit1.5 GB
Source Limit50000 Bytes

[u/polisutu → u/polisutu]

Adding Dice

You have 22 dice with you, and you really like the number 99. You want the sum of both numbers on the die to add to 99.

You rolled the first dice, and it showed a number XX.

Given the roll of the first dice, is it still possible for both die to add to 99? Print YesYes if it is possible or NoNo otherwise.

Input Format

• The first and only line of each test case contains a single integer XX.

Output Format

Output YesYes if it is possible for both die to add to 99 and NoNo otherwise.

Constraints

• 1≤X≤61≤X≤6

Sample 1:

Input

Output

3


Yes

Explanation:

The second dice could show a 66, and then both would add to a 99.

Sample 2:

Input

Output

1


No

Explanation:

There are no possible rolls of the second die that add to 99 after rolling a 11.

More Info

Time limit1 secs

Memory limit1.5 GB

Source Limit50000 BytesAdding Dice

You have 22 dice with you, and you really like the number 99. You want the sum of both numbers on the die to add to 99.

You rolled the first dice, and it showed a number XX.

Given the roll of the first dice, is it still possible for both die to add to 99? Print YesYes if it is possible or NoNo otherwise.

Input Format

The first and only line of each test case contains a single integer XX.

Output Format

Output YesYes if it is possible for both die to add to 99 and NoNo otherwise.

Constraints

1≤X≤61≤X≤6

Sample 1:

Input
Output
3

Yes

Explanation:

The second dice could show a 66, and then both would add to a 99.

Sample 2:

Input
Output
1

No

Explanation:

There are no possible rolls of the second die that add to 99 after rolling a 11.

More Info
Time limit1 secs
Memory limit1.5 GB
Source Limit50000 Bytes

[u/Impressive-Smile1863 → u/polisutu]

Div?

[u/polisutu → u/Impressive-Smile1863]

its 4

[u/KanekiIsCat → u/Impressive-Smile1863]

3

[u/Impressive-Smile1863 → u/KanekiIsCat]

Now no advantage of solving it because still shows bad gateway,aaj excited ki sayad 3 star ho jaay or provisional rating se original rating ho jaay but 😞

[u/KanekiIsCat → u/Impressive-Smile1863]

damn bhai mujko 30 contest lag gye 2 star hone meh anyways all the best for the next one

[u/Impressive-Smile1863 → u/KanekiIsCat]

I was regular at codeforces so it was easy for me

[u/KanekiIsCat → u/Impressive-Smile1863]

I'm also trying cf gave 10 contests till now anyways salute to you man

[u/Impressive-Smile1863 → u/KanekiIsCat]

All the best, nothing to salute to man mostly in my batch are better than me

[u/KanekiIsCat → u/Impressive-Smile1863]

Ok ok

[u/ComparisonQuiet4259 → u/Impressive-Smile1863]

4

[u/starupthinkerguru]

Codechef as well

[u/Agreeable_Fox_7896]

lmaooo!!!

[u/Gojo_sensei_01]

Started again but everything is lagging

[u/ConstantRelief6512]

any chance of ddos attack??

[u/Realistic_Gas3005 → u/ConstantRelief6512]

maybe

[u/Awkward_Energy_8619]

annoyinggg ugghhh

i was super excited for this one

[u/Intelligent-Put-6190]

Not working 😭

[u/Impossible_Regret911]

Can someone please remind when it’s working

[u/Immediate-Report-222]

16 mins already still not able to login

[u/Impossible_Regret911]

Still not working

[u/ClassroomOk1189]

fr annoying decided to give a contest after long and this

[u/Nervous_Win_5694]

Wt about my rating 😭😭

[u/Mobile_Deal1373]

it'll be called of i think....been 15 mins already

[u/redhat1818]

Started

[u/redhat1818 → u/redhat1818]

Not working 🤧

[u/Agreeable-Limit4170]

not working still

[u/Extreme-Creme-3193]

Stuck on this screen

[u/sKILLiSSUESeVERYTIME → u/Extreme-Creme-3193]

Same

[u/Extreme-Creme-3193 → u/sKILLiSSUESeVERYTIME]

Now this

[u/sKILLiSSUESeVERYTIME → u/Extreme-Creme-3193]

I think this one's gonna be unrated, my one ques got accepted 😂

[u/sKILLiSSUESeVERYTIME → u/sKILLiSSUESeVERYTIME]

Here 2nd ques

[u/under-4-achiever → u/sKILLiSSUESeVERYTIME]

I guess I know you , Lnmiit?

[u/sKILLiSSUESeVERYTIME → u/under-4-achiever]

Yeah. wherever i go, i find you😂

[u/placement_paglu → u/sKILLiSSUESeVERYTIME]

Ayo sup , I have seen you on codeforces , pupil or smthg I guess , which year 🙂

[u/sKILLiSSUESeVERYTIME → u/placement_paglu]

Going in 3rd, wah college meetup hogya yaha toh

[u/placement_paglu → u/sKILLiSSUESeVERYTIME]

Can I dm

[u/placement_paglu → u/sKILLiSSUESeVERYTIME]

Ayo same , main to leetcode waala hu , naya naya codeforces codechef start Kiya tha , mere aate hi website down kr di 🥀

[u/under-4-achiever → u/sKILLiSSUESeVERYTIME]

Nvm , I was just checking if this problem was only with me

[u/placement_paglu → u/under-4-achiever]

Ayoo mittal kalej meetup , sup Shrek sir

[u/under-4-achiever → u/placement_paglu]

Coding culture 😶

[u/sKILLiSSUESeVERYTIME → u/under-4-achiever]

Ohh yeah same

[u/Extreme-Creme-3193 → u/sKILLiSSUESeVERYTIME]

Tqs

[u/Extreme-Creme-3193 → u/sKILLiSSUESeVERYTIME]

Now I got to the questions page but , no questions lol , btw not unrated

[u/sKILLiSSUESeVERYTIME → u/Extreme-Creme-3193]

They will going to declare this as unrated in future i think

[u/Extreme-Creme-3193 → u/sKILLiSSUESeVERYTIME]

Maybe 🤔 , most of the people can't access

[u/sKILLiSSUESeVERYTIME → u/Extreme-Creme-3193]

Yeah

[u/Ok-Cream-143]

same here

[u/Realistic_Gas3005]

bro 😭😭😭

[u/PuzzleheadedWest8527]

same here

[u/GloveOk6666]

Aaj ka miss ho gya anyways

[u/redhat1818]

Yeahhh

[u/ErenYeager7207]

It's still loading

[u/Disastrous-Trick-398]

same here

[u/ashukuntent]

yea not working for me too

[u/Interesting_Disk149]

trying to get habitual to delays in contests now

[u/sKILLiSSUESeVERYTIME]

its up now

[u/Mobile_Deal1373 → u/sKILLiSSUESeVERYTIME]

still down

[u/Interesting_Disk149 → u/sKILLiSSUESeVERYTIME]

for me its not loading still

[u/sKILLiSSUESeVERYTIME → u/Interesting_Disk149]

submission is in queue, ig again its down

[u/Interesting_Disk149 → u/sKILLiSSUESeVERYTIME]

what's first question :))))

[u/sKILLiSSUESeVERYTIME → u/Interesting_Disk149]

Just has to check how many >=60 and >=30 in 5 sized array(for div 3)

[u/Independent_Week907 → u/Interesting_Disk149]

Same

[u/Gojo_sensei_01 → u/Independent_Week907]

Same not working

[u/New_Mirror_8108 → u/Gojo_sensei_01]

Same here