Submission #885487

#TimeUsernameProblemLanguageResultExecution timeMemory
885487juliany2Advertisement 2 (JOI23_ho_t2)C++17
59 / 100
2088 ms1372 KiB
#include<bits/stdc++.h> using namespace std; using ll = long long; #define all(x) (x).begin(), (x).end() int main() { cin.tie(0)->sync_with_stdio(false); int n; cin >> n; vector<array<int, 2>> a(n); for (auto &[x, e] : a) cin >> x >> e; sort(all(a)); a.erase(unique(all(a)), a.end()); n = a.size(); int ans = 0; for (int i = 0; i < n; i++) { bool cov = 0; for (int j = 0; j < n; j++) { if (i != j && a[j][1] - a[i][1] >= abs(a[j][0] - a[i][0])) cov = 1; } if (!cov) ans++; } cout << ans << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...