Invitation to D'Code 2023 from Amalthea, IIT Gandhinagar

→ Обратите внимание

До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
17:33:32
Зарегистрироваться »

*есть доп. регистрация

→ Трансляции

Leetcode BiWeekly Contest 144 — Solution Discussion

Shayan

До начала 19:03:30

Codeforces CodeTON Round 9 (Div 1 + Div 2) — Solution Discussion

Shayan

До начала 20:33:30

Всё →

→ Лидеры (рейтинг)

№	Пользователь	Рейтинг
1	tourist	4009
2	jiangly	3823
3	Benq	3738
4	Radewoosh	3633
5	jqdai0815	3620
6	orzdevinwang	3529
7	ecnerwala	3446
8	Um_nik	3396
9	ksun48	3390
10	gamegame	3386

Страны | Города | Организации

Всё →

→ Лидеры (вклад)

№	Пользователь	Вклад
1	cry	167
2	Um_nik	163
3	maomao90	162
3	atcoder_official	162
5	adamant	159
6	-is-this-fft-	158
7	awoo	157
8	TheScrasse	154
9	Dominater069	153
9	nor	153

Всё →

→ Найти пользователя

→ Прямой эфир

Детальнее →

Блог пользователя crap_the_coder

Invitation to D'Code 2023 from Amalthea, IIT Gandhinagar

Автор crap_the_coder, история, 13 месяцев назад, По-английски

Hello everyone! Hope you're all doing well.

Guess what? The next edition of D'Code by IIT Gandhinagar is here!

We have 6 algorithmic problems prepared for you to put your mind to test your problem solving skills.
The contest starts today at 9 PM IST and has a duration of 2 hours. Link of the contest: https://www.codechef.com/DCDE2023

Need an incentive? We've got you covered. There are exciting prizes worth ₹26,000 for the top performers!
NOTE: You need to register here, to be eligible for prizes.

Setters/Testers: mshandilya, crap_the_coder, nishuz, Karan-Gandhi, dewansh461.

Good luck for the contest and we hope you all have fun! :D

codechef, contest, invitation

crap_the_coder
13 месяцев назад
25

Комментарии (22)

Показать архивные | Написать комментарий?

crap_the_coder

13 месяцев назад, # |

Auto comment: topic has been updated by crap_the_coder (previous revision, new revision, compare).

→ Ответить

willgax

13 месяцев назад, # |

+20

problems not loading

→ Ответить

komi_

13 месяцев назад, # ^ |

I got problem links from standings

→ Ответить

crap_the_coder

13 месяцев назад, # ^ |

No idea what happened. There seems to have been an issue with CodeChef, but it should be fixed now.

→ Ответить

softwiz

13 месяцев назад, # |

Clashes with Meta Hacker cup. Pls reschedule.

→ Ответить

crap_the_coder

13 месяцев назад, # ^ |

← Rev. 2 →

Due to the technical summit events in our college, we couldn't have it at a different time. Sorry about the clash :(

→ Ответить

willgax

13 месяцев назад, # |

Status: Wrong Answer Submission ID: 1028653819 Memory: 3.7M Sub-Task Task # Result (time) 1 0 Correct (0.00) Subtask Score: 100% Result — Correct Total Score = 100%

Sorry, i am not familiar with the platform. Total Score is 100% while Wrong Answer! How does it work?

→ Ответить

crap_the_coder

13 месяцев назад, # ^ |

Hey, sorry. We are trying to figure this out, but the verdict will be "Correct" if your code is correct.

→ Ответить

Snapper_001

13 месяцев назад, # ^ |

This happens with me also

→ Ответить

Pirate_King

13 месяцев назад, # |

bruh wtf is the time limit for D ??

→ Ответить

somerandomaltacc3034

13 месяцев назад, # |

nishuz orz

→ Ответить

ExplodingFreeze

13 месяцев назад, # |

← Rev. 2 →

Is there a mistake with this idea for Trade Center? Or is it just a mistake in my implementation?

Goods from city $$$x$$$ will always travel on the shortest path from $$$x$$$ to $$$t$$$.
The shortest path routes represent a tree rooted at $$$t$$$ (since it is "guaranteed that there exists exactly one cheapest path between the Trade Center and any other node")
Query 1 is equivalent to $$$w_{u} \cdot dist_{u}$$$.
Query 2 is equivalent to $$$\sum_{x \in subtree_{u}} {w_{x}}$$$ in this new tree.
Query 3 is equivalent to $$$lca(a, b)$$$ in this new tree.

Query $$$1, 2, 4$$$ can be handled by using any point update, range sum query data structure on the dfs order of the tree since $$$subtree_{x}$$$ represents a contigious range $$$[in_{x}, out_{x}]$$$ in the dfs order. LCA can be calculated normally by your choice of implementation.

→ Ответить

Karan-Gandhi

13 месяцев назад, # ^ |

Yes, your solution is correct; there might be a bug in the implementation.

→ Ответить

gultai4ukr

13 месяцев назад, # |

Posting announcement 3 hours before the contest? Do you think people live on CF or what?

→ Ответить

willgax

13 месяцев назад, # |

How to solve break stick? I used gnu pbds but it gave me TLE.

Also where can the editorial be found?

→ Ответить

adityagamer

13 месяцев назад, # ^ |

Gnu pbds has high constant factor. Here, Use Fenwick tree, it is very fast.

→ Ответить

willgax

13 месяцев назад, # ^ |

← Rev. 2 →

Hi can i use lazy segment tree? for range updates

→ Ответить

adityagamer

13 месяцев назад, # ^ |

Why do you want to range update? Just do point update and range query

→ Ответить

Pirate_King

13 месяцев назад, # ^ |

https://www.codechef.com/viewsolution/1028659335 ???

→ Ответить

adityagamer

13 месяцев назад, # ^ |

I don't have access to your submission. My ordered set soln was also giving TLE.

→ Ответить

Pirate_King

13 месяцев назад, # ^ |

I tried this after failing with seg tree and ordered set and still got TLE

code

struct FenwickTree {
    vector<int> bit;  // binary indexed tree
    int n;

    FenwickTree(int n) {
        this->n = n;
        bit.assign(n, 0);
    }

    FenwickTree(vector<int> const &a) : FenwickTree(a.size()) {
        for (size_t i = 0; i < a.size(); i++)
            add(i, a[i]);
    }

    int sum(int r) {
        int ret = 0;
        for (; r >= 0; r = (r & (r + 1)) - 1)
            ret += bit[r];
        return ret;
    }

    int sum(int l, int r) {
        return sum(r) - sum(l - 1);
    }

    void add(int idx, int delta) {
        for (; idx < n; idx = idx | (idx + 1))
            bit[idx] += delta;
    }
};
void solve(){
    int n,k;
    cin>>k>>n;
    vector<int>a(n),b(n);
    fill(a);
    fill(b);
    FenwickTree ft(k+1);
    for(int i=0;i<n;i++){
        ft.add(a[i],1);
        int ind=ft.sum(0,b[i]-1);
        cout<<ind+1<<endl;
    }

}

→ Ответить

adityagamer

13 месяцев назад, # ^ |

Where are you submitting your code? The problems are not available for submit for practice for me.

My AC code

struct FenwickTreeOneBasedIndexing {
  vector<int> bit; // binary indexed tree
  int n;

  FenwickTreeOneBasedIndexing(int n){
    this->n = n+1;
    bit.assign(n+1, 0);
  }

  FenwickTreeOneBasedIndexing(vector<int> a) : FenwickTreeOneBasedIndexing(a.size()){
    for(size_t i = 0; i < a.size(); i++){
      add(i, a[i]);
    }
  }

  int sum(int idx){
    int ret = 0;
    for(++idx; idx > 0; idx -= idx & -idx) ret += bit[idx];
    return ret;
  }

  int sum(int l, int r){
    if(l > r) return 0;
    return sum(r)-sum(l-1);
  }

  void add(int idx, int delta){
    for(++idx; idx < n; idx += idx & -idx) bit[idx] += delta;
  }

  // FOR LOWER BOUND IN LOGN check: https://mirror.codeforces.com/blog/entry/61364
};

int n = -inf, m = -inf;

void solve(){
    int k;
    cin >> n >> k;
    FenwickTreeOneBasedIndexing ft(n+5);
    vi a(k), c(k);
    cin >> a >> c;
    forn(i,k){
        ft.add(a[i],1);
        print(1+ft.sum(c[i]-1));
    }
}

→ Ответить

Соревнования по программированию 2.0

Время на сервере: 23.11.2024 00:01:30 (j3).

Десктопная версия, переключиться на мобильную.

При поддержке