with bitset<2001> bits[1000][1000];
what time complexity of operation shifting ( =<< or =>> ) !!
and what is Memory ?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 155 |
7 | djm03178 | 151 |
7 | adamant | 151 |
9 | luogu_official | 150 |
10 | awoo | 146 |
with bitset<2001> bits[1000][1000];
what time complexity of operation shifting ( =<< or =>> ) !!
and what is Memory ?
can any one explain me how get problems from website IOI and submit my solution ?
why my this code 118446438 get Time limit exceeded and this code 118446206 get accepted in problem 1535C - Unstable String
any hint
Название |
---|