| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1144701 | Nomio | Advertisement 2 (JOI23_ho_t2) | C++20 | 367 ms | 101792 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];
}
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 time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
