AlgoYo‘l
Yo‘l xaritalari
Masalalar
Duel
Kontestlar
Reyting
Kompilyator
Do‘kon
UZ
Kirish
Ro‘yxatdan o‘tish
Yuklanmoqda…
⌂
Bosh
◈
Yo‘l
≡
Masala
⚔
Duel
◉
Profil
⋯
Ko‘proq
← Yo‘l xaritalari
▦
1000 → 2100 · 555 min
Data structures
Ma’lumotni tez so‘rash va yangilash.
Boshlash · Dynamic array (vector) ichki tuzilishi
0%
o‘zlashtirildi
0/19 bosqich
Mahorat 0/1000 · Boshlanmagan
Bosqich 1
0/5
01
1100 → 1300 · 15 min
Dynamic array (vector) ichki tuzilishi
Dinamik massiv (vector): capacity vs size, amortizatsiyalangan O(1) push_back va qachon qayta ajratish sodir bo‘ladi.
Quiz 0%
Problem —
▶
Hozirgi
02
1200 → 1400 · 17 min
Bog‘langan ro‘yxat
Bog‘langan ro‘yxat (linked list): tugun+pointer zanjiri, qachon haqiqatan kerak va CP da massiv nega ko‘pincha g‘olib.
Quiz 0%
Problem —
○
Ochiq
03
1200 → 1400 · 18 min
Stack va uning qo‘llanishlari
Stack (LIFO): amallar, qavslar balansi, ifoda hisoblash va rekursiya bilan bog‘liqligi.
Quiz 0%
Problem —
○
Ochiq
04
1200 → 1400 · 20 min
Queue va deque
Queue va deque: FIFO prinsipi, ikki tomondan O(1) amallar va BFS bilan bog‘liqligi.
Quiz 0%
Problem —
○
Ochiq
05
1200 → 1400 · 21 min
Monotonik stack va queue
Monotonik stack va queue: «keyingi katta/kichik element» va sliding window min/max ni O(n) da topish.
Quiz 0%
Problem —
○
Ochiq
Bosqich 2
0/5
06
1200 → 1400 · 23 min
Hashing: hash table ichki tuzilishi
Xeshlash: hash funksiyasi, to‘qnashuvlar (collisions), yuklama koeffitsiyenti va Codeforces’dagi anti-hash hujum.
Quiz 0%
Problem —
○
Ochiq
07
1300 → 1500 · 24 min
Set va map: tartiblangan kalitlar
set, map, multiset: tartiblangan kalitlar, lower_bound/upper_bound va chastota hisoblash.
Quiz 0%
Problem —
○
Ochiq
08
1400 → 1600 · 26 min
Binary heap va priority_queue
Binary heap va priority_queue: maksimal/minimal elementni O(log n) da chiqarib olish.
Quiz 0%
Problem —
○
Ochiq
09
1600 → 1800 · 28 min
Disjoint Set Union (DSU)
DSU (Disjoint Set Union): find/union, yo‘l siqish va o‘lcham bo‘yicha birlashtirish — deyarli O(1) da.
Quiz 0%
Problem —
○
Ochiq
10
1800 → 2000 · 29 min
DSU qo‘llanishlari va kengaytmalari
DSU kengaytmalari: og‘irlikli (weighted) DSU, komponent ma’lumotini saqlash va rollback bilan offline bog‘lanish.
Quiz 0%
Problem —
○
Ochiq
Bosqich 3
0/5
11
1800 → 2000 · 31 min
Sparse table: statik RMQ
Sparse table: o‘zgarmas massivda min/max/gcd oraliq so‘rovlarini O(n log n) tayyorgarlik bilan O(1) da berish.
Quiz 0%
Problem —
○
Ochiq
12
1800 → 2000 · 32 min
Fenwick tree (BIT) asoslari
Fenwick tree (BIT): sum(i) va add(i, x) O(log n) da; segment tree ga ixcham alternativ.
Quiz 0%
Problem —
○
Ochiq
13
1800 → 2000 · 34 min
Fenwick tree: oraliq yangilash va 2D BIT
Fenwick tree kengaytmasi: oraliq yangilash + nuqtaviy/oraliq so‘rov va ikki o‘lchamli (2D) BIT.
Quiz 0%
Problem —
○
Ochiq
14
2000 → 2200 · 36 min
Segment tree: qurish va oraliq so‘rov
Segment tree: qurish, oraliq so‘rov va nuqtaviy yangilash — istalgan (assotsiativ) amal uchun O(log n).
Quiz 0%
Problem —
○
Ochiq
15
2100 → 2300 · 37 min
Segment tree: lazy propagation
Segment tree: lazy propagation — [l, r] ga bir vaqtda yangilanishni O(log n) da qo‘llash.
Quiz 0%
Problem —
○
Ochiq
Bosqich 4
0/4
16
2100 → 2300 · 39 min
Segment tree variatsiyalari
Segment tree variatsiyalari: merge sort tree, qiymat bo‘yicha daraxt (segment tree on values) va persistent g‘oyaga kirish.
Quiz 0%
Problem —
○
Ochiq
17
2100 → 2300 · 40 min
Trie (prefix tree)
Trie (prefiks daraxti): satrlarni umumiy prefikslar orqali saqlash, qidirish va bitwise XOR trie.
Quiz 0%
Problem —
○
Ochiq
18
2100 → 2300 · 42 min
Sqrt dekompozitsiya
Sqrt dekompozitsiya: massivni √n uzunlikdagi bloklarga bo‘lib, oraliq so‘rovlarga O(√n) da javob berish.
Quiz 0%
Problem —
○
Ochiq
19
2100 → 2300 · 43 min
Qaysi tuzilmani tanlash
Bo‘limdagi barcha tuzilmalarni tizimga solish: masala bergan savolga qarab to‘g‘ri tuzilmani tanlashni o‘rganish.
Quiz 0%
Problem —
○
Ochiq