Can anyone help me with how to approach this problem?
I am completely blank on how to proceed.
I tried reading the editorial but couldn't understand it.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3821 |
3 | Benq | 3736 |
4 | Radewoosh | 3631 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3388 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Can anyone help me with how to approach this problem?
I am completely blank on how to proceed.
I tried reading the editorial but couldn't understand it.
Name |
---|
The key idea is that if the adjacent characters are equal, then we can untangle them. So if a sequence of length n exists, we can change it to a sequence of length n-2 by deleting the adjacent ones.
For example, (-++-) -> (--) -> ()
I used a stack to do this.
If the stack is empty, push the current character onto the stack.
Else if the top symbol is same as the current one, pop it off the stack.
Else push it onto the stack.
Finally check if the stack is empty or not.
code
Thanks for this, the official editorial is very confusing.