Yandex programming contest: Alarms





.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{
margin-bottom:0;
}








17














$begingroup$


I've tried to solve this challenge about 4 hours during the contest, but all my attempts exceeded the time limit. I tried to solve it with min-heap, but can't pass all the tests. How it can be solved within given time and space requirements?




Problem statement



Programmer Alexey likes to work at night and does not like to come to
work late. In order to precisely wake up in the morning, Alexey every
evening starts $N$ alarm clocks on his phone. Each alarm clock is
arranged in such a way that it rings every $X$ minutes from the time
at which it was turned on.



For example, if the alarm clock was started at the moment of time
$t_i$, then it will ring at the moments of time $t_i, t_i + X, t_i + 2 * X$ and so on. Moreover, if some two alarms begin to ring at one time, only one of them is displayed.



It is known that before waking up, Alexey listens every morning to
exactly $K$ alarm clocks, and then wakes up. Determine the point in
time when Alex wakes up.



Input format



Input format The first line contains three integers. $N, X$ and $K$ $(1 ≤ N ≤10^5, 1≤X, K≤10^9)$ - the number of alarms, the frequency of
calls and the number of alarms that need to be turned off in order for
Alex to wake up. The second line contains N integers - the points in
time at which the alarm clocks were entered.



Requirements



Time limit: 2 seconds
Memory limit: 256Mb


Examples



Example 1



Input



6 5 10
1 2 3 4 5 6


Output 10



Example 2



Input



5 7 12
5 22 17 13 8


Output 27



Notes



In the second example, there are 5 alarm clocks with a frequency of 7
calls. For example, the first alarm clock will ring at times 5, 12,
19, 26, 33, etc. If you look at all the alarms at the same time, they
will ring at the following times: 5, 8, 12, 13, 15, 17, 19, 20, 22
(2nd and 5th alarm clocks at the same time), 24, 26, 27, 29,…. On the
12th call Alexey must wake up, What corresponds to the point in time
27.




My solution



Classified as "time limit exceeded"



import heapq


def main():
n, x, k = map(int, input().split(" "))
times = list(map(int, input().split(" ")))

heapq.heapify(times)

answers =

while k:
v = heapq.heappop(times)
heapq.heappush(times, v + x)

if len(answers) == 0 or answers[len(answers)-1] != v:
answers.append(v)
k -= 1

print(answers[k-1])


if __name__ == "__main__":
main()









share|improve this question











$endgroup$












  • 1




    $begingroup$
    Did you write this for Python 2 or 3?
    $endgroup$
    – Mast
    May 28 at 18:12






  • 1




    $begingroup$
    I used Python 3.7
    $endgroup$
    – maksadbek
    May 28 at 18:30


















17














$begingroup$


I've tried to solve this challenge about 4 hours during the contest, but all my attempts exceeded the time limit. I tried to solve it with min-heap, but can't pass all the tests. How it can be solved within given time and space requirements?




Problem statement



Programmer Alexey likes to work at night and does not like to come to
work late. In order to precisely wake up in the morning, Alexey every
evening starts $N$ alarm clocks on his phone. Each alarm clock is
arranged in such a way that it rings every $X$ minutes from the time
at which it was turned on.



For example, if the alarm clock was started at the moment of time
$t_i$, then it will ring at the moments of time $t_i, t_i + X, t_i + 2 * X$ and so on. Moreover, if some two alarms begin to ring at one time, only one of them is displayed.



It is known that before waking up, Alexey listens every morning to
exactly $K$ alarm clocks, and then wakes up. Determine the point in
time when Alex wakes up.



Input format



Input format The first line contains three integers. $N, X$ and $K$ $(1 ≤ N ≤10^5, 1≤X, K≤10^9)$ - the number of alarms, the frequency of
calls and the number of alarms that need to be turned off in order for
Alex to wake up. The second line contains N integers - the points in
time at which the alarm clocks were entered.



Requirements



Time limit: 2 seconds
Memory limit: 256Mb


Examples



Example 1



Input



6 5 10
1 2 3 4 5 6


Output 10



Example 2



Input



5 7 12
5 22 17 13 8


Output 27



Notes



In the second example, there are 5 alarm clocks with a frequency of 7
calls. For example, the first alarm clock will ring at times 5, 12,
19, 26, 33, etc. If you look at all the alarms at the same time, they
will ring at the following times: 5, 8, 12, 13, 15, 17, 19, 20, 22
(2nd and 5th alarm clocks at the same time), 24, 26, 27, 29,…. On the
12th call Alexey must wake up, What corresponds to the point in time
27.




My solution



Classified as "time limit exceeded"



import heapq


def main():
n, x, k = map(int, input().split(" "))
times = list(map(int, input().split(" ")))

heapq.heapify(times)

answers =

while k:
v = heapq.heappop(times)
heapq.heappush(times, v + x)

if len(answers) == 0 or answers[len(answers)-1] != v:
answers.append(v)
k -= 1

print(answers[k-1])


if __name__ == "__main__":
main()









share|improve this question











$endgroup$












  • 1




    $begingroup$
    Did you write this for Python 2 or 3?
    $endgroup$
    – Mast
    May 28 at 18:12






  • 1




    $begingroup$
    I used Python 3.7
    $endgroup$
    – maksadbek
    May 28 at 18:30














17












17








17


4



$begingroup$


I've tried to solve this challenge about 4 hours during the contest, but all my attempts exceeded the time limit. I tried to solve it with min-heap, but can't pass all the tests. How it can be solved within given time and space requirements?




Problem statement



Programmer Alexey likes to work at night and does not like to come to
work late. In order to precisely wake up in the morning, Alexey every
evening starts $N$ alarm clocks on his phone. Each alarm clock is
arranged in such a way that it rings every $X$ minutes from the time
at which it was turned on.



For example, if the alarm clock was started at the moment of time
$t_i$, then it will ring at the moments of time $t_i, t_i + X, t_i + 2 * X$ and so on. Moreover, if some two alarms begin to ring at one time, only one of them is displayed.



It is known that before waking up, Alexey listens every morning to
exactly $K$ alarm clocks, and then wakes up. Determine the point in
time when Alex wakes up.



Input format



Input format The first line contains three integers. $N, X$ and $K$ $(1 ≤ N ≤10^5, 1≤X, K≤10^9)$ - the number of alarms, the frequency of
calls and the number of alarms that need to be turned off in order for
Alex to wake up. The second line contains N integers - the points in
time at which the alarm clocks were entered.



Requirements



Time limit: 2 seconds
Memory limit: 256Mb


Examples



Example 1



Input



6 5 10
1 2 3 4 5 6


Output 10



Example 2



Input



5 7 12
5 22 17 13 8


Output 27



Notes



In the second example, there are 5 alarm clocks with a frequency of 7
calls. For example, the first alarm clock will ring at times 5, 12,
19, 26, 33, etc. If you look at all the alarms at the same time, they
will ring at the following times: 5, 8, 12, 13, 15, 17, 19, 20, 22
(2nd and 5th alarm clocks at the same time), 24, 26, 27, 29,…. On the
12th call Alexey must wake up, What corresponds to the point in time
27.




My solution



Classified as "time limit exceeded"



import heapq


def main():
n, x, k = map(int, input().split(" "))
times = list(map(int, input().split(" ")))

heapq.heapify(times)

answers =

while k:
v = heapq.heappop(times)
heapq.heappush(times, v + x)

if len(answers) == 0 or answers[len(answers)-1] != v:
answers.append(v)
k -= 1

print(answers[k-1])


if __name__ == "__main__":
main()









share|improve this question











$endgroup$




I've tried to solve this challenge about 4 hours during the contest, but all my attempts exceeded the time limit. I tried to solve it with min-heap, but can't pass all the tests. How it can be solved within given time and space requirements?




Problem statement



Programmer Alexey likes to work at night and does not like to come to
work late. In order to precisely wake up in the morning, Alexey every
evening starts $N$ alarm clocks on his phone. Each alarm clock is
arranged in such a way that it rings every $X$ minutes from the time
at which it was turned on.



For example, if the alarm clock was started at the moment of time
$t_i$, then it will ring at the moments of time $t_i, t_i + X, t_i + 2 * X$ and so on. Moreover, if some two alarms begin to ring at one time, only one of them is displayed.



It is known that before waking up, Alexey listens every morning to
exactly $K$ alarm clocks, and then wakes up. Determine the point in
time when Alex wakes up.



Input format



Input format The first line contains three integers. $N, X$ and $K$ $(1 ≤ N ≤10^5, 1≤X, K≤10^9)$ - the number of alarms, the frequency of
calls and the number of alarms that need to be turned off in order for
Alex to wake up. The second line contains N integers - the points in
time at which the alarm clocks were entered.



Requirements



Time limit: 2 seconds
Memory limit: 256Mb


Examples



Example 1



Input



6 5 10
1 2 3 4 5 6


Output 10



Example 2



Input



5 7 12
5 22 17 13 8


Output 27



Notes



In the second example, there are 5 alarm clocks with a frequency of 7
calls. For example, the first alarm clock will ring at times 5, 12,
19, 26, 33, etc. If you look at all the alarms at the same time, they
will ring at the following times: 5, 8, 12, 13, 15, 17, 19, 20, 22
(2nd and 5th alarm clocks at the same time), 24, 26, 27, 29,…. On the
12th call Alexey must wake up, What corresponds to the point in time
27.




My solution



Classified as "time limit exceeded"



import heapq


def main():
n, x, k = map(int, input().split(" "))
times = list(map(int, input().split(" ")))

heapq.heapify(times)

answers =

while k:
v = heapq.heappop(times)
heapq.heappush(times, v + x)

if len(answers) == 0 or answers[len(answers)-1] != v:
answers.append(v)
k -= 1

print(answers[k-1])


if __name__ == "__main__":
main()






python algorithm python-3.x programming-challenge time-limit-exceeded






share|improve this question















share|improve this question













share|improve this question




share|improve this question



share|improve this question








edited May 29 at 5:49









Mast

7,9727 gold badges39 silver badges93 bronze badges




7,9727 gold badges39 silver badges93 bronze badges










asked May 27 at 12:52









maksadbekmaksadbek

1917 bronze badges




1917 bronze badges











  • 1




    $begingroup$
    Did you write this for Python 2 or 3?
    $endgroup$
    – Mast
    May 28 at 18:12






  • 1




    $begingroup$
    I used Python 3.7
    $endgroup$
    – maksadbek
    May 28 at 18:30














  • 1




    $begingroup$
    Did you write this for Python 2 or 3?
    $endgroup$
    – Mast
    May 28 at 18:12






  • 1




    $begingroup$
    I used Python 3.7
    $endgroup$
    – maksadbek
    May 28 at 18:30








1




1




$begingroup$
Did you write this for Python 2 or 3?
$endgroup$
– Mast
May 28 at 18:12




$begingroup$
Did you write this for Python 2 or 3?
$endgroup$
– Mast
May 28 at 18:12




1




1




$begingroup$
I used Python 3.7
$endgroup$
– maksadbek
May 28 at 18:30




$begingroup$
I used Python 3.7
$endgroup$
– maksadbek
May 28 at 18:30










2 Answers
2






active

oldest

votes


















13
















$begingroup$

Not all counting problems require enumerating the items being counted. If you were asked to count how many sheep there are in total if there are $n$ trucks with $k$ sheep each, you could write something like:



total_sheep = 0
for truck in range(n):
for sheep in range(k):
total_sheep += 1


Or you could cut to the chase and compute it as:



total_sheep = n * k


The problem you are trying to solve is more subtle, but can be attacked in a similar fashion. Modular arithmetic will be your friend in doing this. Rather than looking at the setting times as single numbers, convert them to tuples of (quotient, remainder) after dividing by $X$. This would e.g. convert the list of times for the second example into:



 5 --> (0, 5)
22 --> (3, 1)
17 --> (2, 3)
13 --> (1, 6)
8 --> (1, 1)


We can use this information to prune the list of alarms: if any two alarms have the same remainder, they will ring at the same time, so we only need to keep the smaller one. This would convert the above list, after also sorting it, into:



 5 --> (0, 5)
8 --> (1, 1)
13 --> (1, 6)
17 --> (2, 3)


Those two numbers tell us in which of the $X$ minute periods the alarm sounds for the first time, and at what offset into that period does it first go off. So we can process it sequentially and know that:




  • at the end of the first (0) period, 1 alarm has sounded for the first time, a total of 1 alarm will sound in every subsequent period, and the total number of alarms sounded is also 1.

  • at the end of the second (1) period, 2 alarms have sounded for the first time, 3 alarms will sound in every subsequent period, and the total number of alarms sounded is 4.

  • at the end of the third (2) period, 1 new alarm has sounded, 4 alarms will sound every period, and a total of 8 alarms will have sounded.


Since there are no more alarms to process, we have 8 alarms so far, 4 more sounding each period, and want to reach a total of 12, some simple math tells us that this will happen during the fourth (3) period, and that it will be the last of the alarms that will reach it.



To make the math more clear, lets imagine that we wanted to reach a total of 14 alarms instead. Since 8 have already sounded, we have 14 - 8 = 6 more to go. Since 4 alarms will sound in each period, and the quotient and remainder of 6 divided by 4 are 1 and 2, we know that we will reach our target after 1 full more period, plus 2 of the four alarms in the next period. This translates to 4 full periods, plus the time for the second alarm in that period to sound. The time of 4 full periods is 7 * 4 = 28. We need to add the offset of the second alarm when sorting them by offset, not by start time, so we need to add 3, not 1, and the end result would be 31.



This general outline omits many gruesome details, like what to do if we reach the target number of alarms before we finish processing the list. And the math described above is hard to get right in all corner cases, as there are many chances for off-by-one errors. I'm not going to spoil the fun for you by coding it up: give a try, and I'll be happy to review your next version.






share|improve this answer










$endgroup$











  • 7




    $begingroup$
    Yes, math is the way. I believe the condition "K < 10^9" was intended as a subtle hint that iteration is not a viable approach. A billion alarms to wake up: that's my hero :)
    $endgroup$
    – IMil
    May 28 at 0:05










  • $begingroup$
    This looks like a nice exercise for learning to handle data structures in python.
    $endgroup$
    – JollyJoker
    May 28 at 8:59



















10
















$begingroup$

The minheap approach seems correct. The problem is in the answers. It may grow quite large (up to $10^9$). All the reallocations due to its growth are very costly.



However you don't need it at all. You only care about the time of the most recent alarm. Just one value:



    while k:
v = heapq.heappop(times)
heapq.heappush(times, v + x)

if last_alarm != v:
last_alarm = v
k -= 1


That said, an idiomatic way to access the last element of the list is answers[-1].






share|improve this answer










$endgroup$











  • 2




    $begingroup$
    Exactly! But, I suppose iterating over k is not a right approach too: for i in range(10 ** 9): pass takes more than 2s.
    $endgroup$
    – maksadbek
    May 27 at 14:32













Your Answer






StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "196"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/4.0/"u003ecc by-sa 4.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});















draft saved

draft discarded
















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f221113%2fyandex-programming-contest-alarms%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown


























2 Answers
2






active

oldest

votes








2 Answers
2






active

oldest

votes









active

oldest

votes






active

oldest

votes









13
















$begingroup$

Not all counting problems require enumerating the items being counted. If you were asked to count how many sheep there are in total if there are $n$ trucks with $k$ sheep each, you could write something like:



total_sheep = 0
for truck in range(n):
for sheep in range(k):
total_sheep += 1


Or you could cut to the chase and compute it as:



total_sheep = n * k


The problem you are trying to solve is more subtle, but can be attacked in a similar fashion. Modular arithmetic will be your friend in doing this. Rather than looking at the setting times as single numbers, convert them to tuples of (quotient, remainder) after dividing by $X$. This would e.g. convert the list of times for the second example into:



 5 --> (0, 5)
22 --> (3, 1)
17 --> (2, 3)
13 --> (1, 6)
8 --> (1, 1)


We can use this information to prune the list of alarms: if any two alarms have the same remainder, they will ring at the same time, so we only need to keep the smaller one. This would convert the above list, after also sorting it, into:



 5 --> (0, 5)
8 --> (1, 1)
13 --> (1, 6)
17 --> (2, 3)


Those two numbers tell us in which of the $X$ minute periods the alarm sounds for the first time, and at what offset into that period does it first go off. So we can process it sequentially and know that:




  • at the end of the first (0) period, 1 alarm has sounded for the first time, a total of 1 alarm will sound in every subsequent period, and the total number of alarms sounded is also 1.

  • at the end of the second (1) period, 2 alarms have sounded for the first time, 3 alarms will sound in every subsequent period, and the total number of alarms sounded is 4.

  • at the end of the third (2) period, 1 new alarm has sounded, 4 alarms will sound every period, and a total of 8 alarms will have sounded.


Since there are no more alarms to process, we have 8 alarms so far, 4 more sounding each period, and want to reach a total of 12, some simple math tells us that this will happen during the fourth (3) period, and that it will be the last of the alarms that will reach it.



To make the math more clear, lets imagine that we wanted to reach a total of 14 alarms instead. Since 8 have already sounded, we have 14 - 8 = 6 more to go. Since 4 alarms will sound in each period, and the quotient and remainder of 6 divided by 4 are 1 and 2, we know that we will reach our target after 1 full more period, plus 2 of the four alarms in the next period. This translates to 4 full periods, plus the time for the second alarm in that period to sound. The time of 4 full periods is 7 * 4 = 28. We need to add the offset of the second alarm when sorting them by offset, not by start time, so we need to add 3, not 1, and the end result would be 31.



This general outline omits many gruesome details, like what to do if we reach the target number of alarms before we finish processing the list. And the math described above is hard to get right in all corner cases, as there are many chances for off-by-one errors. I'm not going to spoil the fun for you by coding it up: give a try, and I'll be happy to review your next version.






share|improve this answer










$endgroup$











  • 7




    $begingroup$
    Yes, math is the way. I believe the condition "K < 10^9" was intended as a subtle hint that iteration is not a viable approach. A billion alarms to wake up: that's my hero :)
    $endgroup$
    – IMil
    May 28 at 0:05










  • $begingroup$
    This looks like a nice exercise for learning to handle data structures in python.
    $endgroup$
    – JollyJoker
    May 28 at 8:59
















13
















$begingroup$

Not all counting problems require enumerating the items being counted. If you were asked to count how many sheep there are in total if there are $n$ trucks with $k$ sheep each, you could write something like:



total_sheep = 0
for truck in range(n):
for sheep in range(k):
total_sheep += 1


Or you could cut to the chase and compute it as:



total_sheep = n * k


The problem you are trying to solve is more subtle, but can be attacked in a similar fashion. Modular arithmetic will be your friend in doing this. Rather than looking at the setting times as single numbers, convert them to tuples of (quotient, remainder) after dividing by $X$. This would e.g. convert the list of times for the second example into:



 5 --> (0, 5)
22 --> (3, 1)
17 --> (2, 3)
13 --> (1, 6)
8 --> (1, 1)


We can use this information to prune the list of alarms: if any two alarms have the same remainder, they will ring at the same time, so we only need to keep the smaller one. This would convert the above list, after also sorting it, into:



 5 --> (0, 5)
8 --> (1, 1)
13 --> (1, 6)
17 --> (2, 3)


Those two numbers tell us in which of the $X$ minute periods the alarm sounds for the first time, and at what offset into that period does it first go off. So we can process it sequentially and know that:




  • at the end of the first (0) period, 1 alarm has sounded for the first time, a total of 1 alarm will sound in every subsequent period, and the total number of alarms sounded is also 1.

  • at the end of the second (1) period, 2 alarms have sounded for the first time, 3 alarms will sound in every subsequent period, and the total number of alarms sounded is 4.

  • at the end of the third (2) period, 1 new alarm has sounded, 4 alarms will sound every period, and a total of 8 alarms will have sounded.


Since there are no more alarms to process, we have 8 alarms so far, 4 more sounding each period, and want to reach a total of 12, some simple math tells us that this will happen during the fourth (3) period, and that it will be the last of the alarms that will reach it.



To make the math more clear, lets imagine that we wanted to reach a total of 14 alarms instead. Since 8 have already sounded, we have 14 - 8 = 6 more to go. Since 4 alarms will sound in each period, and the quotient and remainder of 6 divided by 4 are 1 and 2, we know that we will reach our target after 1 full more period, plus 2 of the four alarms in the next period. This translates to 4 full periods, plus the time for the second alarm in that period to sound. The time of 4 full periods is 7 * 4 = 28. We need to add the offset of the second alarm when sorting them by offset, not by start time, so we need to add 3, not 1, and the end result would be 31.



This general outline omits many gruesome details, like what to do if we reach the target number of alarms before we finish processing the list. And the math described above is hard to get right in all corner cases, as there are many chances for off-by-one errors. I'm not going to spoil the fun for you by coding it up: give a try, and I'll be happy to review your next version.






share|improve this answer










$endgroup$











  • 7




    $begingroup$
    Yes, math is the way. I believe the condition "K < 10^9" was intended as a subtle hint that iteration is not a viable approach. A billion alarms to wake up: that's my hero :)
    $endgroup$
    – IMil
    May 28 at 0:05










  • $begingroup$
    This looks like a nice exercise for learning to handle data structures in python.
    $endgroup$
    – JollyJoker
    May 28 at 8:59














13














13










13







$begingroup$

Not all counting problems require enumerating the items being counted. If you were asked to count how many sheep there are in total if there are $n$ trucks with $k$ sheep each, you could write something like:



total_sheep = 0
for truck in range(n):
for sheep in range(k):
total_sheep += 1


Or you could cut to the chase and compute it as:



total_sheep = n * k


The problem you are trying to solve is more subtle, but can be attacked in a similar fashion. Modular arithmetic will be your friend in doing this. Rather than looking at the setting times as single numbers, convert them to tuples of (quotient, remainder) after dividing by $X$. This would e.g. convert the list of times for the second example into:



 5 --> (0, 5)
22 --> (3, 1)
17 --> (2, 3)
13 --> (1, 6)
8 --> (1, 1)


We can use this information to prune the list of alarms: if any two alarms have the same remainder, they will ring at the same time, so we only need to keep the smaller one. This would convert the above list, after also sorting it, into:



 5 --> (0, 5)
8 --> (1, 1)
13 --> (1, 6)
17 --> (2, 3)


Those two numbers tell us in which of the $X$ minute periods the alarm sounds for the first time, and at what offset into that period does it first go off. So we can process it sequentially and know that:




  • at the end of the first (0) period, 1 alarm has sounded for the first time, a total of 1 alarm will sound in every subsequent period, and the total number of alarms sounded is also 1.

  • at the end of the second (1) period, 2 alarms have sounded for the first time, 3 alarms will sound in every subsequent period, and the total number of alarms sounded is 4.

  • at the end of the third (2) period, 1 new alarm has sounded, 4 alarms will sound every period, and a total of 8 alarms will have sounded.


Since there are no more alarms to process, we have 8 alarms so far, 4 more sounding each period, and want to reach a total of 12, some simple math tells us that this will happen during the fourth (3) period, and that it will be the last of the alarms that will reach it.



To make the math more clear, lets imagine that we wanted to reach a total of 14 alarms instead. Since 8 have already sounded, we have 14 - 8 = 6 more to go. Since 4 alarms will sound in each period, and the quotient and remainder of 6 divided by 4 are 1 and 2, we know that we will reach our target after 1 full more period, plus 2 of the four alarms in the next period. This translates to 4 full periods, plus the time for the second alarm in that period to sound. The time of 4 full periods is 7 * 4 = 28. We need to add the offset of the second alarm when sorting them by offset, not by start time, so we need to add 3, not 1, and the end result would be 31.



This general outline omits many gruesome details, like what to do if we reach the target number of alarms before we finish processing the list. And the math described above is hard to get right in all corner cases, as there are many chances for off-by-one errors. I'm not going to spoil the fun for you by coding it up: give a try, and I'll be happy to review your next version.






share|improve this answer










$endgroup$



Not all counting problems require enumerating the items being counted. If you were asked to count how many sheep there are in total if there are $n$ trucks with $k$ sheep each, you could write something like:



total_sheep = 0
for truck in range(n):
for sheep in range(k):
total_sheep += 1


Or you could cut to the chase and compute it as:



total_sheep = n * k


The problem you are trying to solve is more subtle, but can be attacked in a similar fashion. Modular arithmetic will be your friend in doing this. Rather than looking at the setting times as single numbers, convert them to tuples of (quotient, remainder) after dividing by $X$. This would e.g. convert the list of times for the second example into:



 5 --> (0, 5)
22 --> (3, 1)
17 --> (2, 3)
13 --> (1, 6)
8 --> (1, 1)


We can use this information to prune the list of alarms: if any two alarms have the same remainder, they will ring at the same time, so we only need to keep the smaller one. This would convert the above list, after also sorting it, into:



 5 --> (0, 5)
8 --> (1, 1)
13 --> (1, 6)
17 --> (2, 3)


Those two numbers tell us in which of the $X$ minute periods the alarm sounds for the first time, and at what offset into that period does it first go off. So we can process it sequentially and know that:




  • at the end of the first (0) period, 1 alarm has sounded for the first time, a total of 1 alarm will sound in every subsequent period, and the total number of alarms sounded is also 1.

  • at the end of the second (1) period, 2 alarms have sounded for the first time, 3 alarms will sound in every subsequent period, and the total number of alarms sounded is 4.

  • at the end of the third (2) period, 1 new alarm has sounded, 4 alarms will sound every period, and a total of 8 alarms will have sounded.


Since there are no more alarms to process, we have 8 alarms so far, 4 more sounding each period, and want to reach a total of 12, some simple math tells us that this will happen during the fourth (3) period, and that it will be the last of the alarms that will reach it.



To make the math more clear, lets imagine that we wanted to reach a total of 14 alarms instead. Since 8 have already sounded, we have 14 - 8 = 6 more to go. Since 4 alarms will sound in each period, and the quotient and remainder of 6 divided by 4 are 1 and 2, we know that we will reach our target after 1 full more period, plus 2 of the four alarms in the next period. This translates to 4 full periods, plus the time for the second alarm in that period to sound. The time of 4 full periods is 7 * 4 = 28. We need to add the offset of the second alarm when sorting them by offset, not by start time, so we need to add 3, not 1, and the end result would be 31.



This general outline omits many gruesome details, like what to do if we reach the target number of alarms before we finish processing the list. And the math described above is hard to get right in all corner cases, as there are many chances for off-by-one errors. I'm not going to spoil the fun for you by coding it up: give a try, and I'll be happy to review your next version.







share|improve this answer













share|improve this answer




share|improve this answer



share|improve this answer










answered May 27 at 15:27









JaimeJaime

6,16714 silver badges29 bronze badges




6,16714 silver badges29 bronze badges











  • 7




    $begingroup$
    Yes, math is the way. I believe the condition "K < 10^9" was intended as a subtle hint that iteration is not a viable approach. A billion alarms to wake up: that's my hero :)
    $endgroup$
    – IMil
    May 28 at 0:05










  • $begingroup$
    This looks like a nice exercise for learning to handle data structures in python.
    $endgroup$
    – JollyJoker
    May 28 at 8:59














  • 7




    $begingroup$
    Yes, math is the way. I believe the condition "K < 10^9" was intended as a subtle hint that iteration is not a viable approach. A billion alarms to wake up: that's my hero :)
    $endgroup$
    – IMil
    May 28 at 0:05










  • $begingroup$
    This looks like a nice exercise for learning to handle data structures in python.
    $endgroup$
    – JollyJoker
    May 28 at 8:59








7




7




$begingroup$
Yes, math is the way. I believe the condition "K < 10^9" was intended as a subtle hint that iteration is not a viable approach. A billion alarms to wake up: that's my hero :)
$endgroup$
– IMil
May 28 at 0:05




$begingroup$
Yes, math is the way. I believe the condition "K < 10^9" was intended as a subtle hint that iteration is not a viable approach. A billion alarms to wake up: that's my hero :)
$endgroup$
– IMil
May 28 at 0:05












$begingroup$
This looks like a nice exercise for learning to handle data structures in python.
$endgroup$
– JollyJoker
May 28 at 8:59




$begingroup$
This looks like a nice exercise for learning to handle data structures in python.
$endgroup$
– JollyJoker
May 28 at 8:59













10
















$begingroup$

The minheap approach seems correct. The problem is in the answers. It may grow quite large (up to $10^9$). All the reallocations due to its growth are very costly.



However you don't need it at all. You only care about the time of the most recent alarm. Just one value:



    while k:
v = heapq.heappop(times)
heapq.heappush(times, v + x)

if last_alarm != v:
last_alarm = v
k -= 1


That said, an idiomatic way to access the last element of the list is answers[-1].






share|improve this answer










$endgroup$











  • 2




    $begingroup$
    Exactly! But, I suppose iterating over k is not a right approach too: for i in range(10 ** 9): pass takes more than 2s.
    $endgroup$
    – maksadbek
    May 27 at 14:32
















10
















$begingroup$

The minheap approach seems correct. The problem is in the answers. It may grow quite large (up to $10^9$). All the reallocations due to its growth are very costly.



However you don't need it at all. You only care about the time of the most recent alarm. Just one value:



    while k:
v = heapq.heappop(times)
heapq.heappush(times, v + x)

if last_alarm != v:
last_alarm = v
k -= 1


That said, an idiomatic way to access the last element of the list is answers[-1].






share|improve this answer










$endgroup$











  • 2




    $begingroup$
    Exactly! But, I suppose iterating over k is not a right approach too: for i in range(10 ** 9): pass takes more than 2s.
    $endgroup$
    – maksadbek
    May 27 at 14:32














10














10










10







$begingroup$

The minheap approach seems correct. The problem is in the answers. It may grow quite large (up to $10^9$). All the reallocations due to its growth are very costly.



However you don't need it at all. You only care about the time of the most recent alarm. Just one value:



    while k:
v = heapq.heappop(times)
heapq.heappush(times, v + x)

if last_alarm != v:
last_alarm = v
k -= 1


That said, an idiomatic way to access the last element of the list is answers[-1].






share|improve this answer










$endgroup$



The minheap approach seems correct. The problem is in the answers. It may grow quite large (up to $10^9$). All the reallocations due to its growth are very costly.



However you don't need it at all. You only care about the time of the most recent alarm. Just one value:



    while k:
v = heapq.heappop(times)
heapq.heappush(times, v + x)

if last_alarm != v:
last_alarm = v
k -= 1


That said, an idiomatic way to access the last element of the list is answers[-1].







share|improve this answer













share|improve this answer




share|improve this answer



share|improve this answer










answered May 27 at 14:08









vnpvnp

43.6k2 gold badges37 silver badges112 bronze badges




43.6k2 gold badges37 silver badges112 bronze badges











  • 2




    $begingroup$
    Exactly! But, I suppose iterating over k is not a right approach too: for i in range(10 ** 9): pass takes more than 2s.
    $endgroup$
    – maksadbek
    May 27 at 14:32














  • 2




    $begingroup$
    Exactly! But, I suppose iterating over k is not a right approach too: for i in range(10 ** 9): pass takes more than 2s.
    $endgroup$
    – maksadbek
    May 27 at 14:32








2




2




$begingroup$
Exactly! But, I suppose iterating over k is not a right approach too: for i in range(10 ** 9): pass takes more than 2s.
$endgroup$
– maksadbek
May 27 at 14:32




$begingroup$
Exactly! But, I suppose iterating over k is not a right approach too: for i in range(10 ** 9): pass takes more than 2s.
$endgroup$
– maksadbek
May 27 at 14:32



















draft saved

draft discarded



















































Thanks for contributing an answer to Code Review Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f221113%2fyandex-programming-contest-alarms%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown









Popular posts from this blog

Færeyskur hestur Heimild | Tengill | Tilvísanir | LeiðsagnarvalRossið - síða um færeyska hrossið á færeyskuGott ár hjá færeyska hestinum

He _____ here since 1970 . Answer needed [closed]What does “since he was so high” mean?Meaning of “catch birds for”?How do I ensure “since” takes the meaning I want?“Who cares here” meaningWhat does “right round toward” mean?the time tense (had now been detected)What does the phrase “ring around the roses” mean here?Correct usage of “visited upon”Meaning of “foiled rail sabotage bid”It was the third time I had gone to Rome or It is the third time I had been to Rome

Slayer Innehåll Historia | Stil, komposition och lyrik | Bandets betydelse och framgångar | Sidoprojekt och samarbeten | Kontroverser | Medlemmar | Utmärkelser och nomineringar | Turnéer och festivaler | Diskografi | Referenser | Externa länkar | Navigeringsmenywww.slayer.net”Metal Massacre vol. 1””Metal Massacre vol. 3””Metal Massacre Volume III””Show No Mercy””Haunting the Chapel””Live Undead””Hell Awaits””Reign in Blood””Reign in Blood””Gold & Platinum – Reign in Blood””Golden Gods Awards Winners”originalet”Kerrang! Hall Of Fame””Slayer Looks Back On 37-Year Career In New Video Series: Part Two””South of Heaven””Gold & Platinum – South of Heaven””Seasons in the Abyss””Gold & Platinum - Seasons in the Abyss””Divine Intervention””Divine Intervention - Release group by Slayer””Gold & Platinum - Divine Intervention””Live Intrusion””Undisputed Attitude””Abolish Government/Superficial Love””Release “Slatanic Slaughter: A Tribute to Slayer” by Various Artists””Diabolus in Musica””Soundtrack to the Apocalypse””God Hates Us All””Systematic - Relationships””War at the Warfield””Gold & Platinum - War at the Warfield””Soundtrack to the Apocalypse””Gold & Platinum - Still Reigning””Metallica, Slayer, Iron Mauden Among Winners At Metal Hammer Awards””Eternal Pyre””Eternal Pyre - Slayer release group””Eternal Pyre””Metal Storm Awards 2006””Kerrang! Hall Of Fame””Slayer Wins 'Best Metal' Grammy Award””Slayer Guitarist Jeff Hanneman Dies””Bullet-For My Valentine booed at Metal Hammer Golden Gods Awards””Unholy Aliance””The End Of Slayer?””Slayer: We Could Thrash Out Two More Albums If We're Fast Enough...””'The Unholy Alliance: Chapter III' UK Dates Added”originalet”Megadeth And Slayer To Co-Headline 'Canadian Carnage' Trek”originalet”World Painted Blood””Release “World Painted Blood” by Slayer””Metallica Heading To Cinemas””Slayer, Megadeth To Join Forces For 'European Carnage' Tour - Dec. 18, 2010”originalet”Slayer's Hanneman Contracts Acute Infection; Band To Bring In Guest Guitarist””Cannibal Corpse's Pat O'Brien Will Step In As Slayer's Guest Guitarist”originalet”Slayer’s Jeff Hanneman Dead at 49””Dave Lombardo Says He Made Only $67,000 In 2011 While Touring With Slayer””Slayer: We Do Not Agree With Dave Lombardo's Substance Or Timeline Of Events””Slayer Welcomes Drummer Paul Bostaph Back To The Fold””Slayer Hope to Unveil Never-Before-Heard Jeff Hanneman Material on Next Album””Slayer Debut New Song 'Implode' During Surprise Golden Gods Appearance””Release group Repentless by Slayer””Repentless - Slayer - Credits””Slayer””Metal Storm Awards 2015””Slayer - to release comic book "Repentless #1"””Slayer To Release 'Repentless' 6.66" Vinyl Box Set””BREAKING NEWS: Slayer Announce Farewell Tour””Slayer Recruit Lamb of God, Anthrax, Behemoth + Testament for Final Tour””Slayer lägger ner efter 37 år””Slayer Announces Second North American Leg Of 'Final' Tour””Final World Tour””Slayer Announces Final European Tour With Lamb of God, Anthrax And Obituary””Slayer To Tour Europe With Lamb of God, Anthrax And Obituary””Slayer To Play 'Last French Show Ever' At Next Year's Hellfst””Slayer's Final World Tour Will Extend Into 2019””Death Angel's Rob Cavestany On Slayer's 'Farewell' Tour: 'Some Of Us Could See This Coming'””Testament Has No Plans To Retire Anytime Soon, Says Chuck Billy””Anthrax's Scott Ian On Slayer's 'Farewell' Tour Plans: 'I Was Surprised And I Wasn't Surprised'””Slayer””Slayer's Morbid Schlock””Review/Rock; For Slayer, the Mania Is the Message””Slayer - Biography””Slayer - Reign In Blood”originalet”Dave Lombardo””An exclusive oral history of Slayer”originalet”Exclusive! Interview With Slayer Guitarist Jeff Hanneman”originalet”Thinking Out Loud: Slayer's Kerry King on hair metal, Satan and being polite””Slayer Lyrics””Slayer - Biography””Most influential artists for extreme metal music””Slayer - Reign in Blood””Slayer guitarist Jeff Hanneman dies aged 49””Slatanic Slaughter: A Tribute to Slayer””Gateway to Hell: A Tribute to Slayer””Covered In Blood””Slayer: The Origins of Thrash in San Francisco, CA.””Why They Rule - #6 Slayer”originalet”Guitar World's 100 Greatest Heavy Metal Guitarists Of All Time”originalet”The fans have spoken: Slayer comes out on top in readers' polls”originalet”Tribute to Jeff Hanneman (1964-2013)””Lamb Of God Frontman: We Sound Like A Slayer Rip-Off””BEHEMOTH Frontman Pays Tribute To SLAYER's JEFF HANNEMAN””Slayer, Hatebreed Doing Double Duty On This Year's Ozzfest””System of a Down””Lacuna Coil’s Andrea Ferro Talks Influences, Skateboarding, Band Origins + More””Slayer - Reign in Blood””Into The Lungs of Hell””Slayer rules - en utställning om fans””Slayer and Their Fans Slashed Through a No-Holds-Barred Night at Gas Monkey””Home””Slayer””Gold & Platinum - The Big 4 Live from Sofia, Bulgaria””Exclusive! Interview With Slayer Guitarist Kerry King””2008-02-23: Wiltern, Los Angeles, CA, USA””Slayer's Kerry King To Perform With Megadeth Tonight! - Oct. 21, 2010”originalet”Dave Lombardo - Biography”Slayer Case DismissedArkiveradUltimate Classic Rock: Slayer guitarist Jeff Hanneman dead at 49.”Slayer: "We could never do any thing like Some Kind Of Monster..."””Cannibal Corpse'S Pat O'Brien Will Step In As Slayer'S Guest Guitarist | The Official Slayer Site”originalet”Slayer Wins 'Best Metal' Grammy Award””Slayer Guitarist Jeff Hanneman Dies””Kerrang! Awards 2006 Blog: Kerrang! Hall Of Fame””Kerrang! Awards 2013: Kerrang! Legend”originalet”Metallica, Slayer, Iron Maien Among Winners At Metal Hammer Awards””Metal Hammer Golden Gods Awards””Bullet For My Valentine Booed At Metal Hammer Golden Gods Awards””Metal Storm Awards 2006””Metal Storm Awards 2015””Slayer's Concert History””Slayer - Relationships””Slayer - Releases”Slayers officiella webbplatsSlayer på MusicBrainzOfficiell webbplatsSlayerSlayerr1373445760000 0001 1540 47353068615-5086262726cb13906545x(data)6033143kn20030215029