# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
234919 | RiscadoA | Building Skyscrapers (CEOI19_skyscrapers) | C++14 | 523 ms | 14780 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;
int N, T;
map<pair<int, int>, int> P;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> T;
for (int i = 0, r, c; i < N; ++i) {
cin >> r >> c;
P.insert({{ r, c }, i });
}
if (T == 1) {
vector<int> s;
map<pair<int, int>, int> candidates;
candidates.insert(*P.begin());
P.erase(P.begin());
while (!candidates.empty()) {
auto node = *candidates.begin();
candidates.erase(candidates.begin());
s.push_back(node.second);
for (int i = -1; i <= 1; ++i) {
# | 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... |