Can someone help me solving this problem Link problem statement is very simple
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | SecondThread | 145 |
9 | pajenegod | 145 |
Name |
---|
I think we need to make DAG with weights of edges 0/1. If u->v has weight 0 it means that a[v] >= a[u] + 0 and if u->v has weight 1 a[v] > a[i] (<=> a[v] >= a[u] + 1). If we have this graph it is easy to build the initial matrix. But i don't know how to build it and how to find out if there are no such graphs, so i also want to read the solution.