Submission #26266131

---

Source Code Expand

# include <bits/stdc++.h>
using namespace std;
 
// # define USING_STDIN
// # define NDEBUG
// # define NCHECK
# include <cassert>
 
namespace Elaina {
 
# define rep(i, l, r) for(int i=(l), i##_end_=(r); i <= i##_end_; ++i)
# define drep(i, l, r) for(int i=(l), i##_end_=(r); i >= i##_end_; --i)
# define fi first
# define se second
# define mp(a, b) make_pair(a, b)
# define Endl putchar('\n')
# define whole(v) ((v).begin()), ((v).end())
# define bitcnt(s) (__builtin_popcount(s))
# ifdef NCHECK
#  define iputs(Content) ((void)0)
#  define iprintf(Content, argvs...) ((void)0)
# else
#  define iputs(Content) fprintf(stderr, Content)
#  define iprintf(Content, argvs...) fprintf(stderr, Content, argvs)
# endif
 
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
 
template <class T> inline T fab(T x) { return x < 0? -x: x; }
template <class T> inline void getmin(T& x, const T rhs) { x=min(x, rhs); }
template <class T> inline void getmax(T& x, const T rhs) { x=max(x, rhs); }
 
# ifndef USING_STDIN
inline char freaGET() {
#  define BUFFERSIZE 5000
    static char BUF[BUFFERSIZE], *p1=BUF, *p2=BUF;
    return p1 == p2 && (p2=(p1=BUF)+fread(BUF, 1, BUFFERSIZE, stdin), p1 == p2)? EOF: *p1++;
#  undef BUFFERSIZE
}
#  define CHARGET freaGET()
# else
#  define CHARGET getchar()
# endif
template <class T> inline T readret(T x) {
    x=0; int f=0; char c;
    while((c=CHARGET) < '0' || '9' < c) if(c=='-') f=1;
    for(x=(c^48); '0' <= (c=CHARGET) && c <= '9'; x=(x<<1)+(x<<3)+(c^48));
    return f? -x: x;
}
template <class T> inline void readin(T& x) { x=readret(T(1)); }
template <class T, class... Args> inline void readin(T& x, Args&... args){
    readin(x), readin(args...);
}

template <class T> inline void writc(T x, char s='\n') {
    static int fwri_sta[55], fwri_ed=0;
    if(x < 0) putchar('-'), x=-x;
    do fwri_sta[++fwri_ed]=x%10, x/=10; while(x);
    while(putchar(fwri_sta[fwri_ed--]^48), fwri_ed);
    putchar(s);
}

} using namespace Elaina;

const int maxn=2e5;

struct node { int a, b; } p[maxn+5];
int n, m;

inline void input() {
	readin(m, n);
	rep(i, 1, n) readin(p[i].a, p[i].b);
	sort(p+1, p+n+1, [](const node& x, const node& y) -> bool {
		return x.a == y.a? x.b>y.b: x.a<y.a;
	});
}

namespace saya {

int mx[maxn+5];

# define lowbit(i) (i&(-i))

inline int query(int i) {
	int ret=0;
	for(; i; i-=lowbit(i)) ret=max(ret, mx[i]);
	return ret;
}
inline void insert(int i, int x) {
	for(; i <= maxn; i+=lowbit(i)) mx[i]=max(mx[i], x);
}

# undef lowbit(i)

} // using namespace saya;

int dp[maxn+5];
inline void work() {
	int ans=0;
	rep(i, 1, n) {
		dp[i]=saya::query(p[i].b-1)+1;
		saya::insert(p[i].b, dp[i]);
		ans=max(ans, dp[i]);
	}
	writc(ans);
}

signed main() {
	input();
	work();
    return 0;
}

Submission Info

Compile Error

./Main.cpp:97:15: warning: extra tokens at end of #undef directive
   97 | # undef lowbit(i)
      |               ^

Judge Result