Skip to content

chore: update mo's #27

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.

Sign up for GitHub

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

Merged
manoflearning merged 1 commit into from
Nov 19, 2025
Merged

chore: update mo's #27

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 5 additions & 11 deletions src/7-misc/sqrt_decomposition_mos_algorithm.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,23 +1,17 @@
#include "../common/common.hpp"

#include <bits/stdc++.h>
using namespace std;
int sq;
struct se {
int s, e, idx;
bool operator<(const se &rhs) const {
if (s / sq != rhs.s / sq) return s / sq < rhs.s / sq;
return e < rhs.e;
}
// Zigzag Mo's (faster than basic Mo's Algorithm)
// bool operator<(const se &rhs) const {
// if(s / sq != rhs.s / sq) return s / sq < rhs.s / sq;
// else return (s / sq) & 1 ? e < rhs.e : e > rhs.e;
// }
};
// Zigzag Mo's (faster than basic Mo's Algorithm)
/*struct se {
int s, e, idx;
bool operator<(const se &rhs) const {
if(s / sq != rhs.s / sq) return s / sq < rhs.s / sq;
else return (s / sq) & 1 ? e < rhs.e : e > rhs.e;
}
};*/
vector<se> q;
vector<int> ans;
void input() {
Expand Down