Common Board @ Timus Online Judge

Shabalin Anatoliy I have WA 2. // Problem 1489. Points on a Parallelepiped 29 May 2009 17:22

GhostMaster I dont't know why~~ [2] // Problem 1710. Boris, You Are Wrong! 4 Apr 2009 15:25

Algorist Could someone explain me the statement of the problem?(+) [11] // Problem 1191. Catch the thief! 5 Mar 2002 03:33

Where do the intervals start from? And why doesn't it matter the
legth of the tram travels? I mean, it must matter for the interval of
the trams....... Explain PLZ

Sam Green Hmm... (+) [8] // Problem 1191. Catch the thief! 5 Mar 2002 05:29

any time the robber come to the i-th stop, he have to wait for ti (time
interval) minutes ,a tram will come and the interval starts.

most of problems in this contest are very ambigious, i had to guest
many times to know what they want.

please explain me about 1190

Algorist About 1190 // Problem 1191. Catch the thief! 5 Mar 2002 14:25

First, 10x about the explanation. I'll try to solve it having that in
mind.
About 1190-> I had problems with understanding it, too. Maybe you
should read the comments on board 1190. Some people helped me there.
You should have these in mind :
0) Percents should be non-increasing, not strictly decreasing
1) Names contain no intervals
2) Try both the possiblities-> the maximum one and the minimum one.
If the maximum is less than 10000, then NO. If the minimum is more
than 10000 than NO again. If the percents are not non-increasing->
NO. Otherwise-> YES.

You should get AC with that.

Algorist More questions. Please help(+) [6] // Problem 1191. Catch the thief! 5 Mar 2002 15:08

and what about the policeman? does he have to wait ti as well?
Because, if the counting for him starts with the arrival of the
robber at the tram stop, then it DOES matter the length of the
route... So, does the policeman have to wait ti minutes as well?
Another question-> If the distance (the lag-> L) is 2, and t1 is 2,
does the policeman catch the robber

Sam Green I should explain with sample input case (+) [5] // Problem 1191. Catch the thief! 5 Mar 2002 20:53

15 4
7 3 13 6

1st stop
robber is here at time 0
and he go out when time 0+7
police is here at time 15
the next tram will come at time 21 (trams come at 7,14,21)

the length of route doesn't matter the time lag at all because their speed
are always equal. so i'll assume that it's 0.
2nd stop
robber arrive at 7
robber go 7+3=10
police arrive 21
police go 22 (10,13,16,19,22)

3rd stop
robber go 10+13 = 23
police come 22 and arrest the robber here before he can go

Algorist Then where is the mistake in my source? (+) [4] // Problem 1191. Catch the thief! 5 Mar 2002 22:45

#include <stdio.h>

int main() {
int cop,n,ti,rob,i,st,ost,tmp;
    scanf("%d %d",&cop,&n);
    for (i=1;i<=n;i++) {
        scanf("%d",&ti);
        st=rob;
        rob+=ti;
       if (rob>=cop) {
           printf("YES\n");
           return 0;
        }
        st=cop-st;
        ost=st%ti;
        if (ost==0) ost=ti;
        cop+=(ti-ost);
    }
    printf("NO\n");
    return 0;
}

I tried with if (rob>cop) but I got WA. I tried to compare the
leaving times(i mean, compare the time when the cop catches the tram
and the time the robber catches the tram, and if they are the same or
the cop can catch an earlier tram, then YES... but WA too. What I do
is just implementing stepwisely what you told me-> in 'cop' i keep
the time of the cop, and in 'rob' the time of the robber... But WA.
Help plz?

Sam Green (+) [3] // Problem 1191. Catch the thief! 6 Mar 2002 01:01

> #include <stdio.h>
>
> int main() {
> int cop,n,ti,rob,i,st,ost,tmp;
>     scanf("%d %d",&cop,&n);
>     for (i=1;i<=n;i++) {
>         scanf("%d",&ti);
>         st=rob;
>         rob+=ti;
>        if (rob>=cop) {
>            printf("YES\n");
>            return 0;
>         }
>         st=cop-st;
>         ost=st%ti;
>         if (ost==0) ost=ti;
>         cop+=(ti-ost);
>     }
>     printf("NO\n");
>     return 0;
> }

1.) initialize the variable rob to be 0!
2.) problem statement says "the policeman will have luck to overtake the
robber. For instance, if L *****<***** K1, then it may happen that
the policeman will reach the first stop, when the robber is still waiting
for the tram there." this implies that , if police reach the stop when the
robber is leaving , he just have to wait from the next tram.
so use condition "rob>cop" and comment "if (ost==0) ost=ti;" and you'll
get AC!

Algorist 10x... I owe you a big 10x :) And if you need help on something I have solved-> never hesitate to ask! [1] // Problem 1191. Catch the thief! 6 Mar 2002 01:25

Sam Green Thank you in advance :) (-) // Problem 1191. Catch the thief! 6 Mar 2002 04:55

>

test Re: (+) // Problem 1191. Catch the thief! 3 Apr 2004 19:32

Thank you very much!

为了血蹄的荣耀 Re: Could someone explain me the statement of the problem?(+) // Problem 1191. Catch the thief! 26 Oct 2007 07:50

好像不是这样的吧？
我WA#3

zbwmqlw Re: Could someone explain me the statement of the problem?(+) // Problem 1191. Catch the thief! 29 May 2009 08:16

I don't think the statement is clearly, it may mislead someone like me...

Herushion Wrong Answer test 1 WHY??? [2] // Problem 1001. Reverse Root 7 May 2009 02:07

BOBUR_OG'O!!! i can't understand BFS, what is it??? [3] // Problem 1073. Square Country 25 Dec 2007 21:49

SerailHydra Some questions [1] // Problem 1696. Salary for Robots 18 Mar 2009 05:36

bond WA#6 [3] // Problem 1018. Binary Apple Tree 27 Jul 2007 20:14

Despise_Me Can I send others message? 28 May 2009 13:02

Marginean Ciprian WA# 3 [1] // Problem 1647. Divide an Island! 7 Mar 2009 19:36

Friends WA#7 [1] // Problem 1370. Magician 24 Oct 2008 18:18

Leonid (SLenik) Andrievskiy TL 24 [1] // Problem 1439. Battle with You-Know-Who 26 May 2009 21:20

Arthas Can you tell me what is the test10 about this problem? [3] // Problem 1482. Triangle Game 26 May 2009 15:46

HeypaBHoBeceH If you have WA3 // Problem 1481. Winning Chances 26 May 2009 13:55

benia program using recursion, Please help [3] // Problem 1196. History Exam 13 May 2009 13:14

Al.Cash help please [3] // Problem 1703. Robotic Arm 5 Apr 2009 00:37

sasha To Admins !! [3] // Problem 1218. Episode N-th: The Jedi Tournament 23 May 2009 02:27

Dimitrije Question [1] // Problem 1536. Delights of Pipe-weed 13 May 2009 05:08

Programmer Output Limit 1 (-). What is the first test? // Problem 1004. Sightseeing Trip 23 May 2009 16:27

18446744073709551615 Wa10 Come in,I hope I can solve your problem [1] // Problem 1067. Disk Tree 7 Apr 2009 14:42

Arthas What's the answer for k=1000000 [2] // Problem 1368. Goat in the Garden 3 22 May 2009 15:23