제출 #944519

#제출 시각아이디문제언어결과실행 시간메모리
944519vladiliusAdvertisement 2 (JOI23_ho_t2)C++17
59 / 100
19 ms2396 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; struct node{ int x, e; }; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin>>n; vector<node> t(n + 1); for (int i = 1; i <= n; i++){ cin>>t[i].x>>t[i].e; } auto cmp = [&](node a, node b){ return (a.e >= b.e); }; sort(t.begin() + 1, t.end(), cmp); vector<int> d(n + 1), s(n + 1); for (int i = 1; i <= n; i++){ d[i] = t[i].e - t[i].x; s[i] = t[i].e + t[i].x; } set<pii> s1, s2; for (int i = 1; i <= n; i++){ s1.insert({d[i], i}); s2.insert({s[i], i}); } int out = 0; for (int i = 1; i <= n; i++){ if (s1.empty() || s1.find({d[i], i}) == s1.end()){ continue; } // xj <= xi and d[j] <= d[i] // xj > xi and s[j] <= s[i] vector<int> rem; if (!s1.empty()){ auto it = s1.begin(); while (it != s1.end()){ auto [a, j] = *it; if (a > d[i]) break; if (t[j].x > t[i].x){ it++; continue; } rem.push_back(j); it++; } } if (!s2.empty()){ auto it = s2.begin(); while (it != s2.end()){ auto [a, j] = *it; if (a > s[i]) break; if (t[j].x < t[i].x){ it++; continue; } rem.push_back(j); it++; } } for (int j: rem){ if (!s1.empty()){ auto it = s1.find({d[j], j}); if (it != s1.end()) s1.erase(it); } if (!s2.empty()){ auto it = s2.find({s[j], j}); if (it != s2.end()) s2.erase(it); } } out++; } cout<<out<<"\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...