Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

ret array stores the same thing as q #276

Merged

Conversation

lrvideckis
Copy link
Contributor

No description provided.

@simonlindholm
Copy link
Member

Neat! The comments about priority queues are a lot more confusing now, maybe we should just remove them? I've never needed them and it feels like an easy thing to derive from scratch.

@lrvideckis
Copy link
Contributor Author

just removed the comments

Comment on lines 18 to 19
int j = 0;
while (j < sz(q)) {
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

this can use rep(j,0,sz(q))

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

done

@simonlindholm simonlindholm merged commit 3a59551 into kth-competitive-programming:main Oct 23, 2024
1 check passed
Aplietexe pushed a commit to IvanRenison/kactlpp that referenced this pull request Oct 28, 2024
@lrvideckis lrvideckis deleted the golf_toposort branch November 18, 2024 18:39
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants