RoboContest.UZ

📊
Codeforces Round 1062 (Div. 4)
🇺🇿
O'zbekistonlik
maktab o'quvchilari
tuzgan Codeforces roundda qatnashing! Bu Codeforcesda 10 yillik tanaffusdan so'ng ikkinchi "o'zbekcha" contest hisoblanadi.
Contest boshlanish vaqti:
28-oktyabr, 19:35
Davomiyligi: 2 soat 15 daqiqa
Reyting cheklovi: <1400 (Div. 4)
Codeforces blog:
https://codeforces.com/blog/entry/147412
Contest:
https://codeforces.com/contests/2167
🧑‍💻
@cp_uz

🚀
Lumora Regional Tour 2: IT Case Competitions
We're excited to announce that
Lumora
is bringing its IT Case Competition to
6 cities
across Uzbekistan! Join us in this exciting journey to discover and nurture the brightest tech talents in the country.
🤝
Our partner is
Robocontest
, leading programming education platform in Central Asia. So far, it has organized more than 250 official high-level contests, attracting more than 40,000 participants.
👥
Teams:
4–5 students or solo
🔖
Application deadline:
October 23rd
🔍
For:
University and high school students
🏆
What Awaits You
:
⭐️
Top teams across cities will receive internship from
Robocontest
⭐️
Receive official certificates and honors
⭐️
Winners from each region will compete in the
national stage
of
Lumora IT Case Competition
.
🌏
Regional Rounds & Application Details:
📍
Andijan
🗓
Date: 26th October
📄
Apply here
📍
Qarshi
🗓
Date: 26th October
📄
Apply here
📍
Bukhara
🗓
Date: 26th October
📄
Apply here
📍
Samarqand
🗓
Date: 26th October
📄
Apply here
📍
Nukus
🗓
Date: 26th October
📄
Apply here
📍
Tashkent
🗓
Date: 26th October
📄
Apply here
💴
Participation fee: 30,000 UZS
for EACH team
member
(For Coffee-break)
Don't miss this opportunity to showcase your skills and advance your tech career!
📱
Telegram
|
📱
LinkedIn

🚀
Bizning yangi loyihamiz ishga tushmoqda!
Do‘stlar, nihoyat sizlarga bir necha oylik mehnatimiz natijasini ulashish vaqti keldi — biz MultiMock platformasini ishga tushirishga tayyormiz!
📅
Rasmiy start sanasi: 2025-yil 20-oktabr
Bugundan esa siz eksklyuziv kutish ro‘yxati (Waitlist) ga yozilishingiz mumkin!
🎁
Kutish ro‘yxatiga qo‘shilganlarga,
bepul mock unitlar
– amaliy sinovlar orqali o‘z bilimlarini sinash imkoniyati beriladi
💡
MultiMock — bu IELTS, CEFR va boshqa imtihonlarga tayyorgarlikni zamonaviy va interaktiv shaklda o‘tishga yordam beruvchi platforma.
Hozirda IELTS imtihoni ishga tushiryapmiz, IELTSga tayyorlanayotgan do'stlaringizga yuborib qoyinglar, 20-oktabr bepul kirib sinashlari mumkin bo'ladi.
Loyiha haqida batafsil:
@multimock
Obuni bo'lishni unutmang
🤝
https://t.me/multimock/6
@adizbek_ergashev

😀
Yandex Cup 2025
Yandex
kompaniyasidan dasturlash musobaqasi. Musobaqaning
"Algorithm"
yo'nalishi ikki bosqichdan iborat:
-
Saralash
: 2-noyabr, onlayn. Eng yaxshi 20ta ishtirokchi final bosqichiga yo'llanma oladi.
-
Final
: 5-7 dekabr,
🇹🇷
Istanbul, Turkiya.
Shuningdek, Yandex Contest sistemasini sinab ko'rish uchun 20-29 oktyabr oralig'ida Trial Round'da ham qatnashishingiz mumkin.
Sovrin jamg'armasi
:
- Algorithm yo'nalishi uchun
1.5 million rubl
.
🚀
Registratsiya
:
-
https://yandex.com/cup/algorithm
P.S.
Yandex Cup musobaqasida "Machine Learning", "Mobile Development", "Frontend", "Backend", hamda "Analytics" kabi boshqa yo'nalish ham bor. Ularga ham ushbu
link
orqali ro'yxatdan o'tish mumkin.
🧑‍💻
@cp_uz

Assalom aleykum huratli foydalanuvchilar. Tizimda texnik ishlar olib borilmoqda.

Assalom aleykum huratli foydalanuvchilar. Tizimda texnik ishlar olib borilmoqda.

🔥
Pekin va Tsinghua universitetlari tadqiqotchilari 70 yildan beri eng samarali bo'lgan Dijkstra algoritmidan tezroq ishlaydigan yangi algoritm yaratishdi.
Muammo nimada edi?
Dijkstra algoritmi yo‘l qidirishda doim eng yaqin nuqtani tanlab, prioritet navbat orqali ishlaydi. Bu navbatni doimiy tartibda ushlab turish — eng katta sekinlashtiruvchi qadam.
Yangi yondashuv – BMSSP:
1. Distance bounding – hisoblashni faqat ma’lum maksimal masofagacha (distance threshold) cheklash.
2. Frontier compression – chegaradagi vertex’lar to‘plamidan faqat eng muhimlari (pivotal vertices) qoldirish.
3. Recursive processing – faqat pivotal vertices va ularning adjacent vertices ustida recursive ishlash, to‘liq saralashdan qochish.
4. Multi-pass edge relaxation – qolgan vertex’lar masofasini yangilash. Relaxation bu: agar A dan C ga B orqali o‘tish masofasi avval topilgan masofadan qisqaroq bo‘lsa, masofani yangilash amali. Bu Bellman–Ford algoritmidagi kabi barcha yo‘llarni bir necha marta tekshirish orqali amalga oshiriladi.
5. Iterative distance refinement – masofalarni bosqichma-bosqich yanada aniqlashtirish.
Murakkablik taqqoslanishi:
Deykstra → O(n + m log m)
BMSSP → O(m log^(2/3) n)
Amaliy tezlik yutug‘i (siyrak graflar uchun):
n = 1 million → taxminan 2.7 marta tezroq
n = 1 milliard → taxminan 3 marta tezroq
Eslatma: Zich graflarda (m ~ n²) yutug‘ingiz kichikroq bo‘lishi mumkin.
Batafsil:
https://arxiv.org/pdf/2504.17033
🤖
@robocontest

Assalamu alaykum,
Robocontest loyihasi bo'yicha sizlarni katta yangiliklarimiz kutmoqda!
https://www.linkedin.com/company/robocontest
- birinchilardan xabardor bo'lish uchun, LinkedIn sahifamizga obuna bo'lishni unutmang
🇺🇿
@robocontest

Assalom aleykum hurmatli do'stlar.
IOI 2025 ning yopilish marosimi translyatsiya havolasi.
https://www.facebook.com/share/1HiLB282QC/

IOI 2025
🏆
Ikkinchi kun yakunlandi.
Norasmiy
natijalarga ko'ra,
🇺🇿
O'zbekistonlik o'quvchilar 2ta medalni qo'lga kiritishdi.
🥈
Kumush medal —
Asilbek Sunnatov
, Muhammad al-Xorazmiy maktabi, 11-sinf
🥉
Bronza medali —
Ulug'bek Rahmatullayev
, Namangan Prezident maktabi, 10-sinf
Yakuniy natijalar
ertaga
, umumiy yig'ilishda tasdiqlanganidan so'ng e'lon qilinadi.
🧑‍💻
@cp_uz