# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1067524 | _rain_ | Advertisement 2 (JOI23_ho_t2) | C++14 | 125 ms | 16068 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
using i64 = long long;
#define debug false
const int maxn = 5'00'000;
int x[maxn+2] , e[maxn+2] , n;
int main(){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> n;
vector<int> value;
for (int i = 1; i <= n; ++i) {
cin >> x[i] >> e[i];
value.push_back(x[i]);
}
sort(value.begin(),value.end());
value.resize(unique(value.begin(),value.end()) - value.begin());
cout << value.size();
}
# | 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... |