Submission #1144700

#TimeUsernameProblemLanguageResultExecution timeMemory
1144700NomioAdvertisement 2 (JOI23_ho_t2)C++20
0 / 100
2095 ms15212 KiB
#include<bits/stdc++.h> using namespace std; using ll = long long; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; ll x[n], e[n]; set<int> chi[n], par[n]; int cnt[n] {}; for(int i = 0; i < n; i++) { cin >> x[i] >> e[i]; } for(int i = 0; i < n; i++) { for(int j = 0; j < n; j++) { if(i == j) continue; if(abs(x[i] - x[j]) <= e[i] - e[j]) { chi[i].insert(j); cnt[i]++; par[j].insert(i); } } } set<pair<int, int> > s; set<int> S; for(int i = 0; i < n; i++) { s.insert({x[i], e[i]}); S.insert(i); } cout << s.size() << '\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...