Lounge Lizards

input/code.cpp: In function 'll lis(std::vector<std::pair<long long int, long long int> >)':
input/code.cpp:28:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < v.size(); ++i) {
                            ^
input/code.cpp:32:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < v.size(); ++i) {
                            ^

#include <bits/stdc++.h>

#define F first
#define S second
using namespace std;

typedef long long ll;
const int N = 1<<20;
ll st[2*N];
ll getMax(ll a, ll b) {
	ll ma = 0;
	a += N;
	b += N;
	for(; a <= b; a/=2, b/=2) {
		if(a&1) ma = max(ma, st[a++]);
		if(~b&1) ma = max(ma, st[b--]);
	}
	return ma;
}
void setValue(ll a, ll v) {
	a += N;
	st[a] = v;
	for(a/=2; a; a/=2) {
		st[a] = max(st[a*2], st[a*2+1]);
	}
}
ll lis(vector<pair<ll, ll> > v) {
	for(int i = 0; i < v.size(); ++i) {
		setValue(v[i].S, max(getMax(0ll, v[i].S-1)+1, getMax(v[i].S, v[i].S)));
	}
	ll ans = getMax(0, N-1);
	for(int i = 0; i < v.size(); ++i) {
		setValue(v[i].S, 0);
	}
	return ans;
}
int main() {
	ll tx, ty;
	cin>>tx>>ty;
	int n;
	cin>>n;
	vector<pair<pair<ll, ll>, pair<ll, ll> > > v(n);
	for(int i = 0; i < n; ++i) {
		cin>>v[i].F.F>>v[i].F.S>>v[i].S.S;
		v[i].F.F -= tx;
		v[i].F.S -= ty;
		ll q = __gcd(abs(v[i].F.F), abs(v[i].F.S));
		v[i].F.F /= q;
		v[i].F.S /= q;
		v[i].S.F = q;
	}
	sort(v.begin(), v.end());
	ll ans = 0;
	while(v.size()) {
		vector<pair<ll, ll> > v2;
		pair<ll, ll> q = v.back().F;
		while(v.size() && v.back().F == q) {
			v2.push_back(v.back().S);
			v.pop_back();
		}
		sort(v2.begin(), v2.end());
		ans += lis(v2);
	}
	cout<<ans<<'\n';
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED