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

C++ solution for Sleepy Cow Sorting #5107

Open
wants to merge 19 commits into
base: master
Choose a base branch
from
Open

Conversation

Sosuke23
Copy link
Contributor

@Sosuke23 Sosuke23 commented Feb 7, 2025

Place an "x" in the corresponding checkbox if it is done or does not apply to this pull request.

  • I have tested my code.
  • I have added my solution according to the steps here.
  • I have followed the code conventions mentioned here.
    • I understand that if it is clear that I have not attempted to follow these conventions, my PR will be closed.
    • If changes are requested, I will re-request a review after addressing them.
  • I have linked this PR to any issues that it closes.

closes: #5106

AC (BIT)
Screenshot from 2025-02-07 14-38-04

AC (Seg Tree)
Screenshot from 2025-02-07 14-38-24

@Sosuke23 Sosuke23 changed the title C++ solution for Sleepy C++ solution for Sleepy Cow Sorting Feb 7, 2025
solutions/gold/usaco-898.mdx Outdated Show resolved Hide resolved
solutions/gold/usaco-898.mdx Outdated Show resolved Hide resolved
Copy link
Contributor

@TheGamingMousse TheGamingMousse left a comment

Choose a reason for hiding this comment

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

overall looks solid, i think explaining the solution above the code would be good tho

solutions/gold/usaco-898.mdx Outdated Show resolved Hide resolved
solutions/gold/usaco-898.mdx Outdated Show resolved Hide resolved
solutions/gold/usaco-898.mdx Outdated Show resolved Hide resolved
solutions/gold/usaco-898.mdx Outdated Show resolved Hide resolved
solutions/gold/usaco-898.mdx Outdated Show resolved Hide resolved
solutions/gold/usaco-898.mdx Outdated Show resolved Hide resolved
solutions/gold/usaco-898.mdx Outdated Show resolved Hide resolved
solutions/gold/usaco-898.mdx Outdated Show resolved Hide resolved
@@ -18,7 +18,94 @@ Note: The video solution might not be the same as other solutions. Code in C++.

### Using Segment Tree
Copy link
Contributor

Choose a reason for hiding this comment

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

this header is no longer needed

Copy link
Contributor Author

Choose a reason for hiding this comment

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

check now, ig it is just about fine

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.

Contact Form Submission - Request - Missing Section or Solution (Gold - Point Update Range Sum)
3 participants