Submission #1221319

#TimeUsernameProblemLanguageResultExecution timeMemory
1221319sula2Advertisement 2 (JOI23_ho_t2)C++20
10 / 100
282 ms6108 KiB
#include <bits/stdc++.h> #define all(a) (a).begin(), (a).end() using namespace std; int main() { int n; cin >> n; pair<int,int> a[n]; // x[j] - x[i] <= e[i] - e[j] // x[j] + e[j] <= e[i] + x[i] // // x[i] - x[j] <= e[i] - e[j] // e[j] - x[j] <= e[i] - x[i] // // X[j] <= X[i] // Y[j] <= Y[i] for (auto& [x, y] : a) { int pos, inf; cin >> pos >> inf; x = inf + pos; y = inf - pos; } sort(a, a+n, greater<>()); deque<int> lis; for (auto [x, y] : a) { auto it = lower_bound(lis.rbegin(), lis.rend(), y); if (it == lis.rend()) lis.push_front(y); else *it = y; } cout << lis.size(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...