|
|
вернуться в форумIt seems that TL is ridiculously strict. Послано MVM 29 мар 2015 19:49 Is it because O(nm log (n + m)) solutions are not supposed to pass or something like that? My solution has relatively high constant, but O(nm(n + m)) or O(nm log^2 (n + m)) solutions probably won't pass even if TL was bigger, I think. Edited by author 29.03.2015 20:20 Re: It seems that TL is ridiculously strict. No comments. Re: It seems that TL is ridiculously strict. usigned int +hash get Accept |
|
|