Problem LINK I am not able to understand the DP solution of this problem.What does the state represent ? Some solution Links using this DP First Second Third
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | Dominater069 | 154 |
8 | awoo | 154 |
10 | luogu_official | 150 |
Problem LINK I am not able to understand the DP solution of this problem.What does the state represent ? Some solution Links using this DP First Second Third
Plain and simple. Here, calling all the mad--brain-sleep-deprived-ambitious-genius coders and alike who just can’t live without coding their day in and day out. Don’t worry if you don’t fit in the above description, because coding skills are all that is needed at the online Mega Event — Novice Programming Challenge. Lots of prizes to be won and lots of ranks to be achieved to brag about ! [prizes only for indian contestant]
contest link:
Time : Time
I am trying to solve this I learned about euler path . I understood how we make a edge between s[0]s[1]->s[1]s[2] and we have calculated whether a euler path exist or not . if it exist we did dfs i can't understand this type of dfs . if somebody can help me solving this somebody's accepted code
Question : RRFRNDS I used brute force to solve this and was expecting a TLE but got a WA instead Somebody provide me some hints to solve this
Name |
---|