AtCoder Beginner Contest 155 Announcement

5 years ago, # ^ |

-46

wish ,i had visited this comment before the contest ended ...

→ Reply

aryanc403

5 years ago, # ^ |

+39

Sakhiya07 You should wait for contest to end before pasting source of problem. Its just ABC and I expect repeated problems for educational purpose.

wish ,i had visited this comment before the contest ended ...

forget_it What would you get by copy pasting? I challenge you to copy paste one of that GYM's AC submission now and get AC. If you have access to that problem's submissions.

→ Reply

5 years ago, # ^ |

What type of challenge you want me too complete? I didn't understand...

→ Reply

aryanc403

5 years ago, # ^ |

Open one of AC submission of this problem (made before start of today's atcoder contest) and submit it on atcoder.

→ Reply

5 years ago, # ^ |

← Rev. 2 →

-35

Stop Disliking my comment

→ Reply

box

5 years ago, # ^ |

← Rev. 2 →

no, because all you care about is your score and not what you learn

→ Reply

dunjen_master

5 years ago, # |

How to solve E and F ?

→ Reply

towhid1zaman

5 years ago, # |

How to Solve D ?

→ Reply

5 years ago, # ^ |

+15

Binary search (from -1e18 to 1e18). Then, once you set the guess for K, do another binary search to find out how many pairs are less than the guess.

Final runtime: O(N * (logN)^2)

→ Reply

Zain

5 years ago, # ^ |

+10

You can do the checking process by two pointers, I think it is easier to code and faster.

→ Reply

oldos

5 years ago, # ^ |

How can you solve it with two pointers?

→ Reply

pr3pony

5 years ago, # ^ |

like this

→ Reply

blobugh

5 years ago, # |

+67

→ Reply

Gary2005

5 years ago, # ^ |

+30

It must be:

Difficulty

→ Reply

blobugh

5 years ago, # ^ |

I agree. I expressed a bit simply. :)

→ Reply

5 years ago, # |

+12

Contest is over!

Difficulty on D was misplaced. Implementation wise, it was much harder than E.

→ Reply

wasa855

5 years ago, # |

This round really made me autistic(cross out) self-close

→ Reply

v-O_O-v

5 years ago, # |

← Rev. 4 →

I guess this is one of the difficult ABC to me. (even though I got better rank than other contests just by solving A-B-C ).

→ Reply

RaunaqRoxx

5 years ago, # |

← Rev. 2 →

Can anyone tell me the mistake I did in D, the first two samples are working and out of 72 TCs, almost half of them are working. I did a Binary Search from -10^18 to 10^18 and found out how many products will be less than the mid, and accordingly shift the high and low by comparing with k. https://atcoder.jp/contests/abc155/submissions/10161880 Also, do we require BigInt in E or is it doable without them? If yes, then can anyone tell me how?

→ Reply

RNR

5 years ago, # ^ |

We can do E without using BigInt too.

→ Reply

5 years ago, # ^ |

E doesn't need BigInt. In fact, I recommend you solve the problem by turning the String into an array of integers, then doing an O(N) sweep from right to left).

→ Reply

5 years ago, # ^ |

I didn't find the bug but I have some suggestions.

You don't need long doubles. If a is a integer, a <= x is the same as a <= floor(x) and a >= x is the same as a >= ceil(x). You just have to be careful with negative values.
I found it easier to compute 2*(the number of pairs) and then divide it by 2 instead of just compute it directly.
I didn't understand why you count the number pairs with equal and smaller products in two different variables and use them differently. Shouldn't you always use their sum?

I coded the same solution. https://atcoder.jp/contests/abc155/submissions/10145988

→ Reply

RaunaqRoxx

5 years ago, # ^ |

Thank you for these suggestions, and for having a look at my code. I was coding it without using doubles but I was having a difficulty as some point so I thought it would be easier using doubles. I thought of calculating both values because I thought that if kth product was not unique then I might miss it because if I calculate all the products lesser than mid, it would be less than k and all the products less than and equal to mid would be greater than k. I couldn't come up with a justification why their sum would be used, can you help me with that too?

→ Reply

5 years ago, # ^ |

Let f(x) = number of pairs with product <= x. The answer is the smallest X such that f(X) >= k.

To have a intuition I think its enough to look at the first sample. $$$f(-13) = 0, f(-12) = 2$$$. So the answer for $$$k = 1$$$ is the same as $$$k = 2$$$ (-12).

$$$f(-7) = 2, f(-6) = 4$$$, so the answer for $$$k = 3$$$ is the same as $$$k = 4$$$(-6).

$$$f(7) = 4, f(8) = 5$$$, so the answer for $$$k = 5$$$ is 8.

There is no need to compute < x and = x, just <= x.

→ Reply

RaunaqRoxx

5 years ago, # ^ |

Thank you so much for this clear explanation, I would incorporate these changes in my code, and will try to get an AC.

→ Reply

ac1dxtrem

5 years ago, # ^ |

Hi Nson, could you please explain the div_floor and div_ceil functions as well as why do you need them?

→ Reply

5 years ago, # ^ |

div_floor($$$a$$$, $$$b$$$) = $$$\lfloor \frac{a}{b} \rfloor$$$ and div_ceil($$$a$$$, $$$b$$$) = $$$\lceil \frac{a}{b} \rceil$$$.

I wanted to count the number of elements $$$x$$$ such that $$$a_i * x \leq lim$$$, this is:

$$$x \leq \frac{lim}{a_i}$$$, if $$$a_i > 0$$$
$$$x \geq \frac{lim}{a_i}$$$, if $$$a_i < 0$$$

And then I used floor and ceil to only work with integers.

→ Reply

ac1dxtrem

5 years ago, # ^ |

← Rev. 2 →

I see! Any particular reason why you coded these functions (floor, ceil) yourself and not used the ones from std?

→ Reply

5 years ago, # ^ |

To use the floor or ceil I would have to compute $$$\frac{lim}{a_i}$$$ using doubles and that's what I was trying to avoid.

I always don't use floating-point numbers when I can to avoid any precision issues.

→ Reply

ac1dxtrem

5 years ago, # ^ |

Also could you please explain where does the -1 come from in the following two lines:

if(i < id) ans += id - 1;
else ans += id;

and

if(i >= id) ans += n - id - 1;
else ans += n - id;

→ Reply

5 years ago, # ^ |

For $$$a_i > 0$$$ I want to count the number of $$$a_j$$$ such that $$$a_j \leq \frac{lim}{a_i}$$$.

As the array $$$a$$$ is sorted, this is a prefix of it and with upper_bound I can find the size of this prefix. There is just one problem, if $$$i$$$ is in this prefix then I don't want to count the pair $$$(i, i)$$$ at the answer, but its enough to just remove 1 element(the $$$i$$$) from this prefix.

For $$$a_i < 0$$$ it's basically the same thing, but the answer is a suffix of $$$a$$$.

→ Reply

v-O_O-v

5 years ago, # |

← Rev. 2 →

Can E be solved using DP? If yes DP transitions, please :)

→ Reply

5 years ago, # ^ |

The solution for E is greedy.

Technically you could use DP, but there is no point. At every state there is only one move you should do.

→ Reply

Gary2005

5 years ago, # ^ |

Hint:"Simulate the subtraction process"

→ Reply

Gary2005

5 years ago, # ^ |

And digit dp.

→ Reply

rohit_goyal

5 years ago, # ^ |

Yes, a simple N*2 digit dp would do

→ Reply

slime_

5 years ago, # ^ |

Can you please elaborate ?

→ Reply

WinstonWolf

5 years ago, # ^ |

← Rev. 2 →

dp[idx][carry] is the minimum number of banknotes we (you and the cashier) used after processing all numbers starting from 0 to idx-1, such that we have carry = 1 or 0

So, we start from the right, and decrease the idx as we go through the number N, the transition will look like this:

dp[idx][carry] = min( dp[idx-1][0] + N[idx] , dp[idx-1][1] + (10 — N[idx]) )

corner case: the first option can't be done when N[idx]==9 and carry==1

in the base case we should return carry value

submission: https://atcoder.jp/contests/abc155/submissions/10167311

→ Reply

yesnomaybe

5 years ago, # ^ |

Hi,

Can you/someone please elaborate solution a bit more? As in what does dp state denote (what does carry mean?). What is the intuition/logic behind it and what are we trying to do?

Sorry, my peanut brain is unable to understand it. Any help would be appreciated.

→ Reply

Elegy_No_Programmer

5 years ago, # ^ |

You can check this code.

Code

→ Reply

yesnomaybe

5 years ago, # ^ |

Can you please explain what does your dp state denote? And what does dp transitions denote?

→ Reply

Elegy_No_Programmer

5 years ago, # ^ |

← Rev. 2 →

dp(i,0)-no. of notes if the transaction is exact(it means that you don't have any carry or in simple words you paid the exact amount upto i)

dp(i,1)-no. of notes if you gave one extra note

Now since at ith position banker has option to give you the remaining amount which was carried.

So dp(i,0)=min(dp(i-1,0)+num(i),dp(i-1,1)+10-num(i))

for other state consider giving more than required to the banker so we add one note.

So dp(i,1)=min(dp(i-1,0)+1+num(i),dp(i-1,1)+10-num(i)-1).

→ Reply

yesnomaybe

4 years ago, # ^ |

← Rev. 7 →

Hi,

Am sorry to bug you again. I thought I understood, but no.

So for example, we are trying to solve for ...689 and let i be at '6'.

dp[i,0] (689) =  6*100 (num[i]) + 89(dp[i-1, 0]) 
              =. Can you write the second state...?

dp[i,1] (689) =  ...?

→ Reply

TheNR

4 years ago, # ^ |

Does 'one note' here refer to a note with value=1. Or can the value be anything? If it's the latter, then in our transition state, why have we used dp[i][0]=min(dp[i-1][0]+num[i], dp[i-1][1]+10-num[i]);

→ Reply

oldos

5 years ago, # |

Can someone tell me the exact solution of D?

→ Reply

shim1998

5 years ago, # ^ |

Binary search from -1e18 to +1e18. Then you take a guess of k and perform binary search for the number of numbers below that number. I would say this question was harder than E. ;_;

→ Reply

https://atcoder.jp/contests/abc155/submissions/10157539

5 years ago, # ^ |

← Rev. 2 →

Are those, wordings of Agnimandur ?

→ Reply

doraemonrobocat

5 years ago, # ^ |

← Rev. 2 →

For those Who still Didn't uunderstand D.Agnimandur Explained in CPC

basically split the input into the positive numbers and the negative numbers, and then sort them. call the positive array POS, and the negative array array NEG.

then binary search from -1e18 to 1e18. let the "guess" of the binary search be G. if (G < 0), then iterate over all of the negative numbers. For each negative number, do a binary search over all the positive numbers, and find the largest positive number such that the product is <= G.

If G > 0, then all of the negative * positives work. Then, iterate over NEG and at each index i do another binary search from i+1 to the end to find the number of pairs of negative numbers that have a product less than G. Do the same thing over POS.

In total, after you iterate over the lists, if you've found X pairs less than G, and X is less than K, then G must be too small. Otherwise it works, and you transition the binary search accordingly

→ Reply

MihailoT

5 years ago, # ^ |

← Rev. 2 →

thx, well explained!

→ Reply

Hipster_

5 years ago, # ^ |

Why for G -ve we have to check product<=G and for +ve we want product<G

→ Reply

MarwanNabil

5 years ago, # ^ |

you wanna count all pair such that their product is below their G to validate whether G is the answer or not.

→ Reply

Savior-of-Cross

5 years ago, # |

Why doesn't ABC get updated on Atcoder calendar anymore? I rely on the calendar for contest participations and I've missed like all the ABCs recently because of it.

→ Reply

WinstonWolf

5 years ago, # ^ |

Same here

→ Reply

xiaoshizhan

5 years ago, # ^ |

use this insteadgoole canlendar link

→ Reply

MyK_00L

5 years ago, # ^ |

I suggest you use clist

→ Reply

doraemonrobocat

5 years ago, # |

what is wrong in My E?

https://atcoder.jp/contests/abc155/submissions/10162814

TIA

→ Reply

https://atcoder.jp/contests/abc155/submissions/10169630

5 years ago, # ^ |

Try 5.

→ Reply

liuweih

5 years ago, # |

How to solve F?

→ Reply

Ari

5 years ago, # ^ |

+34

Sort the A_i, so every operation concerns a subsegment of indices. Let D_i be the xor between B_i and B_{i-1}, where we consider that B_0 = 0. Our objective is to make D[] = 0. Notice that now every operation amounts to flipping the state of at most two elements of D.

Build a graph on 1..n where indices i and j have an edge between them if an operation affects both. Notice that if we have a simple cycle x_1, x_2, ..., x_k then flipping the edge from x_1 to x_k has the same effect as flipping the other k-1 edges, so it's enough to take a spanning tree of each component. Now we can root each tree arbitrarily and greedily go from leaf to root, doing the correct operations to do everything except possibly the root equal to 0. If at the end the root is 0 we have to flip a single element in the tree in order to fix it. If no operation does that then it is impossible.

→ Reply

liuweih

5 years ago, # ^ |

Thank you !

→ Reply

Huah

5 years ago, # ^ |

Thank you !

→ Reply

Radhesh

5 years ago, # |

← Rev. 2 →

Was this streamed yesterday ? They are solutions to today's contest . It shows to be streamed on 15th Feb 2020 https://www.youtube.com/watch?v=SG60Cp9pSog is this Scam ?

→ Reply

hetp111

5 years ago, # |

Why cant they provide editorial in english when the majority is not from japan :/

→ Reply

Juney

5 years ago, # ^ |

maybe the majority of the problem writers are japanese

→ Reply

ranger2k

5 years ago, # |

← Rev. 2 →

Can anybody explain what's wrong with this submission for problem E?

→ Reply

5 years ago, # ^ |

In the case 955 I believe the answer is 10(955, 956, 957, 958, 959, 960, 970, 980, 990, 1000, 0) but your code outputs 11.

→ Reply

ranger2k

5 years ago, # ^ |

Yeah, i got it thx man.

→ Reply

wyb0412

5 years ago, # |

I'm much weaker than you all, could you tell me how to solve Problem C?

→ Reply

5 years ago, # ^ |

← Rev. 2 →

Count the occurrence of each string then output all those strings which have highest number of occurrences. For counting I used map, and in order to output in lexicographical order I sort them using vector of string.

Here is my solution

→ Reply

Running_Vortex

5 years ago, # ^ |

Why do you need to sort in lexicographical order..? Map sorts the strings and stores the count of each string right? You do not need any vector to sort again...

→ Reply

https://atcoder.jp/contests/abc155/submissions/10152047

5 years ago, # ^ |

YES. I know that, but in the moment I couldn't think of it. I was in hurry.

→ Reply

skicean

5 years ago, # |

when will the English Solution be published?`\

→ Reply

amrzd

5 years ago, # |

← Rev. 2 →

I appreciate if someone tells me what is wrong with this submission. It works fine with small tests, but gives wrong answer for the long one:

For the test 314159265358979323846264338327950288419716939937551058209749445923078164062862089986280348253421170 it returns 249 instead of 243.

the code is this:

int main()
{
    string s;
    cin >> s;
    
    int sum = 0;
    int last = 0;
    for(int i = s.length() - 1; i >= 0; i--) {
        int current = s[i] - '0';
        if(last)
            current++;

        if(current > 5) {
            current = 10 - current;
            last = 1;
        }
        else
            last = 0;

        sum += current;
    }
    sum += last;
 
    cout << sum << endl;
 
    return 0;
}

→ Reply

Mucosolvan

5 years ago, # ^ |

Your solution for test '555' gives answer 15 instead of 14 (1000 — 400 — 40 — 5)

→ Reply

MyK_00L

5 years ago, # ^ |

← Rev. 2 →

Greedy approach does not work for this problem, for example if N=555, your program outputs 15, but you can obtain 14 (1*1000 — 4*100 — 4*10 -5*1) wish comments would auto refresh, so this does not happen when I try to answer someone.

→ Reply

IWMG

5 years ago, # ^ |

I think this https://atcoder.jp/contests/abc155/submissions/10180380 is greedy one. Isnt?

→ Reply

kartikey30

5 years ago, # |

please write the solutions in English too and provide setters/editorial writers code along with it. giving contests without having access to proper editorials is kinda frustrating.

→ Reply

MyK_00L

5 years ago, # ^ |

"For International Readers: English editorial will be published in a few days" They're doing a great work, give them some time. Also often you can understand the solution if you copy-paste the editorial into an automatic translator and read that.

→ Reply

5 years ago, # |

Please Publish Editorials in english also ,so that non Japanese can understand....

→ Reply