Hello codeforces community . I am trying to solve this problem : but dont understand which topics' problem is this . Can anyone tell me ?
Is this a DP problem ?
Problem link : http://agc005.contest.atcoder.jp/tasks/agc005_b
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
7 | SecondThread | 150 |
9 | orz | 146 |
10 | pajenegod | 145 |
Hello codeforces community . I am trying to solve this problem : but dont understand which topics' problem is this . Can anyone tell me ?
Is this a DP problem ?
Problem link : http://agc005.contest.atcoder.jp/tasks/agc005_b
Hello codeforces community , can you please suggest me some Bitmask beginner problems ? I am beginner at bitmask . Just Bitmask problems , not Bitmask Dp . Hope someone will suggest me . :)
Hello codeforces community , i am getting TLE . My logic is : First i store those edges node to set those which color are different , then i put a simple dfs on each of the node stored in set which will be exact for root i break the loop and print it . If i aint found a node , print no . Now I understand for which case i got TLE . If i can stop calling dfs again and again , i can reduce TLE . But can find the logic .
Problem : https://toph.co/p/keep-moving What is the logic of problem KEEP MOVING . Can you please explain ? My logic is : I am leveling the graph , using adjacent of X as a source node . If i got a odd level node and this node has no adjacent node Gobu wins , if for all possible there has no node such that odd level node and this node has no adjacent node i am printing gobu cant win .
My code: Code
I think codeforces should add notification option . Because suppose i commented on a blog 2 month ago , nobody replied my comment on that time . After 1 month 1 people answered my comment , and suppose this comment was effective and helpful for others . I forgot about that blog and topic which i commented so i didn't again visit that blog .[ But since there has no notification option so i didn't get such that " user replied to your comment on users blog " . ]
If there was a notification option a can be notified about that blog when someone commented .or reply my comment .
what happended ?
Supppose somenone give me an array up to 10^6 elements . Then gave some quiries up to 3000 , quries will like that from I index to J index sort in descending , or Ascending order . If 1 ascending , if 2 descending . After quiry how will look the array ? Print the array .
There has a problem like that -> Report . But i want not from 0 index i want from any I to J index .
How i can solve this problem without using STL sort . In efficient way .
Name |
---|