| Show all threads Hide all threads Show all messages Hide all messages |
| easy bfs | 👑TIMOFEY👑 | 1700. Awakening | 26 Sep 2023 21:27 | 2 |
|
| Easy on python | andreyDagger | 1700. Awakening | 4 Jan 2023 20:54 | 2 |
This can be easily done on python |
| Пишите краткое содержание в таких задачах | 👑OmegaLuL230👑 | 1700. Awakening | 30 May 2020 02:23 | 1 |
В задачах с условием, на прочтение которых уходит 10 минут (или более) предлагаю писать краткое содержание в форуме! |
| What is test3? | yuyan | 1700. Awakening | 28 Apr 2020 09:32 | 4 |
Can somebody give me some tests?
I can;t find what's wrong with my prog.
Thanks a lot. oh... very stupid error. you should use .clone() in java.
now TLE 10
Edited by author 21.02.2010 18:22 10 years have passed) I hope it will help somebody. I had WA3, i forgot to clear vector after set intersection, very stupid mistake
Edited by author 24.03.2019 23:54
Edited by author 24.03.2019 23:54 this test helped me:
2
a: fuck it
b: fuck this shit
1
a b
answer: fuck
reason: I indexed the words from 0, but I should from 1 |
| STL is fast enough | Mahilewets | 1700. Awakening | 8 Jul 2017 23:54 | 1 |
Use unordered map and unordered set.
max_load_factor(0.25)
reserve (1<<x) |
| How to pass TL. test #10 | tanas | 1700. Awakening | 28 Jan 2014 20:57 | 3 |
I used such variables:
map<string,int> id;
set<string> list[1003];
map<string,int> mp;
vector<string> res;
but got TL test 10. Can i get AC with same solution? Yes if instead string use
struct{
int num;
int row;
int poz1;
int poz2;
};
to have deal with segments of char S[1000][125] to pass test 10 you must do
1) compare hash codes instead of string compare
2) use vectors+sort. In this case vector is way faster than std::set
3) fast I/O.
4) fast list intersection
good luck! |
| To Admins. Weak hashing tests. | d3m0n1c | 1700. Awakening | 19 Jun 2013 19:17 | 1 |
Words can be easily hashed like:
int hash = 0;
while(..){ hash = hash * 31 + 'readed byte' }
So equals will looks like:
@Override
public boolean equals(Object o) {
return this.hash == o.hashCode();
} |
| WA 6. Give me some tests, please | Nafania | 1700. Awakening | 12 Apr 2013 20:40 | 1 |
On my data program works fine, but got WA. Help me, please :(
I can't understand where is trouble in my code |
| TL on test 9.I use C++ with STL. | Narek X | 1700. Awakening | 17 Nov 2009 19:29 | 2 |
Do not make many copies of strings where you can use only pointers on them. |
| Wa test 13 | Serg | 1700. Awakening | 26 Aug 2009 17:49 | 2 |
what is this - test 13
Edited by author 24.08.2009 15:46 sort. :-)
Edited by author 26.08.2009 17:50
Edited by author 26.08.2009 17:51 |
| Shit Happen's | NickSergeev[MSU MindCraft] | 1700. Awakening | 31 Jul 2009 17:06 | 1 |
Почему нет общего ограничения на количество всех вместе взятых ассоциаций, моя прога использует этот факт, как оказалось их даже больще чем 10000!) Придется переписывать( |
| why crash on test 9? | RedRick[TSOGU] | 1700. Awakening | 19 Apr 2009 19:47 | 2 |
i found my mistake, now AC |
| WA Test 2 | ZeleninAA | 1700. Awakening | 8 Apr 2009 18:28 | 1 |
|
