# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
711306 | kostia244 | Team Contest (JOI22_team) | C++17 | 2054 ms | 8524 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>
#define all(x) begin(x), end(x)
using namespace std;
using ll = long long;
const int inf = 1<<28;
int main() {
cin.tie(0)->sync_with_stdio(0);
int n;
cin >> n;
vector<array<int, 3>> a(n);
vector<int> Y, yid(n), A(n, -inf), B(n, inf);
for(auto &[x, y, z] : a) {
cin >> x >> y >> z;
Y.push_back(y);
}
sort(all(a));
a.erase(unique(all(a)), a.end());
sort(all(Y));
Y.erase(unique(all(Y)), Y.end());
for(int i = 0; i < n; i++)
yid[i] = lower_bound(all(Y), a[i][1]) - Y.begin();
n = a.size();
auto add = [&](int i) {
int y_id = yid[i];
int z = a[i][2];
B[y_id] = min(B[y_id], z);
A[y_id] = max(A[y_id], z);
};
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |