Does anyone know what this could be related to?

#include<stdio.h>
#include<math.h>

int main()
{
    int n,k,i=1,s=1,t=0,temp=0;
    scanf("%d %d",&n,&k);

    while(i<k)
    {
        s=s+i;
        i=2*i;
        t++;

        if(s>=n)
            break;
    }
    while(s<n)
    {
        s=s+k;
        t++;
    }

    printf("%d",t);
    return 0;
}

I got AC for maximum temas using Kosaraju.
and for minimum I started with nodes with no incoming edge and searched until it hit previously found node (cycle) this is 1 team.
For disconnected cycles, run dfs in similar fashion incrementing teams by 1.

This question requires knowledge of Strongly Connected Component. If you don't know read about it.

Good Luck !!!

Hi,

I have submitted one solution with:
new String("0").repeat(n) => n is one number, and the system not know repeat method for Java 1.8, what's about that?! It's core Java.

Thanks,
Jose

> They fall until the total weight of the fallen stones exceeds k kilograms

So weight of fallen rocks should be at least k + 1

Hi!

Could you please check the next test case:

```
3 2
1 2
1 3
3 1 2
```

result should be `no`, but 4 my case i have `yes`. Despite this i had AC.

Thanks in advance!

Edited by author 13.05.2020 22:47

Edited by author 13.05.2020 22:47

Instead of searching for answer for m, search for sum - m

Does anybody know what is so special about test no 29? I am positive that my solution is correct (which is obviously not the case) but it gets WA 29. I even compared it with a slow solution (BFS) but I did not find any differences.

robbers dont know the path, so at each point take farthest node from robbers.do these fo for the length of shortest path and in the end take minimum of these.

for lazy node propagation I did tree[n]+=(end-start+1)*lazy[n];
when start and end were integers. tree[n]+=(end-start+1)*(1ll)*lazy[n]; corrected error.

i got TLE 21

To all of you who cannot overcome #3 !!!

All the suggestions about redundant '\n' and about that the dictionary may have repeated words have nothing to do with WA #3 (read condition carefully).

If you use any kind of backward tracking, be it recursion or DFS, check the "no luck" condition attentively. First i used checking the next letter to be '\0' at the beginning of my recursion function, and if so returned 'true'. This is wrong! You must make word-end check BEFORE you make the next step, otherwise you may get "deadlock" "there is no direction to go" though there is no need to go anymore!!!

Test word for the example table
rabadaabracabrac: YES
(starting from [3,1] in C-like indices).

similar to strictly increasing subsequnce of length k just query and update BIT in reverse.

Clang++ 4.0.1 - 0.39s - Accepted
G++ 7.1 - 0.421 - Accepted
Visual C++ 2017 - 1.029 - Time limit exceeded

rofl

in general i noticed that for the most problems clang is usually faster then g++ or ms c++


Edited by author 21.08.2018 03:53

For WA3 try this:
3
1 2 1
Ans:
1
For WA12 try this:
5 1 2 3 1 5
Ans:
1 5

I had maintained dis[n+1][2] for distance. But visited array was vis[n+1], changed it to
vis[n+1][2] and simple bfs.

I have WA #2 ..

Can somebody give me some tests, please ?:)


Edited by author 13.03.2010 14:57