# |
Author |
Problem |
Lang |
Verdict |
Time |
Memory |
Sent |
Judged |
|
95156325 |
Practice:
dario2994 |
1427C
- 24
|
C++17 (GCC 9-64)
|
Accepted
|
280 ms
|
1968 KB
|
2020-10-10 23:12:12 |
2020-10-10 23:12:12 |
|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define SZ(x) ((int)((x).size()))
template <typename T1, typename T2>
string print_iterable(T1 begin_iter, T2 end_iter, int counter) {
bool done_something = false;
stringstream res;
res << "[";
for (; begin_iter != end_iter and counter; ++begin_iter) {
done_something = true;
counter--;
res << *begin_iter << ", ";
}
string str = res.str();
if (done_something) {
str.pop_back();
str.pop_back();
}
str += "]";
return str;
}
vector<int> SortIndex(int size, std::function<bool(int, int)> compare) {
vector<int> ord(size);
for (int i = 0; i < size; i++) ord[i] = i;
sort(ord.begin(), ord.end(), compare);
return ord;
}
template <typename T>
bool MinPlace(T& a, const T& b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T>
bool MaxPlace(T& a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename S, typename T>
ostream& operator <<(ostream& out, const pair<S, T>& p) {
out << "{" << p.first << ", " << p.second << "}";
return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& v) {
out << "[";
for (int i = 0; i < (int)v.size(); i++) {
out << v[i];
if (i != (int)v.size()-1) out << ", ";
}
out << "]";
return out;
}
template<class TH>
void _dbg(const char* name, TH val){
clog << name << ": " << val << endl;
}
template<class TH, class... TA>
void _dbg(const char* names, TH curr_val, TA... vals) {
while(*names != ',') clog << *names++;
clog << ": " << curr_val << ", ";
_dbg(names+1, vals...);
}
#if DEBUG && !ONLINE_JUDGE
ifstream input_from_file("input.txt");
#define cin input_from_file
#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#define dbg_arr(x, len) clog << #x << ": " << print_iterable(x, x+len, -1) << endl;
#else
#define dbg(...)
#define dbg_arr(x, len)
#endif
///////////////////////////////////////////////////////////////////////////
//////////////////// DO NOT TOUCH BEFORE THIS LINE ////////////////////////
///////////////////////////////////////////////////////////////////////////
const int MAXN = 1e5 + 100;
int t[MAXN];
int x[MAXN], y[MAXN];
int ans[MAXN];
int max_ans[MAXN];
int main() {
ios::sync_with_stdio(false);
cin.tie(0); // Remove in problems with online queries!
x[0] = 1, y[0] = 1;
int R, N;
cin >> R >> N;
for (int i = 1; i <= N; i++) {
cin >> t[i] >> x[i] >> y[i];
ans[i] = -1e9;
for (int j = max(i-2*R, 0); j < i; j++) {
if (abs(x[i]-x[j]) + abs(y[i]-y[j]) <= t[i]-t[j])
ans[i] = max(ans[i], 1 + ans[j]);
}
if (i > 2*R) ans[i] = max(ans[i], 1 + max_ans[i-2*R]);
max_ans[i] = max(ans[i], max_ans[i-1]);
}
cout << max_ans[N] << "\n";
}
Click to see test details